./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 f8e1c903 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/bin/uautomizer-IVEQpCNsaX/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_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/bin/uautomizer-IVEQpCNsaX --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 a05fbc1d8a2048d37fda072c6a9d42f1f996d033c914869a4e2960aadff82dde --- Real Ultimate output --- This is Ultimate 0.2.1-dev-f8e1c90 [2021-11-09 10:48:21,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 10:48:21,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 10:48:21,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 10:48:21,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 10:48:21,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 10:48:21,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 10:48:21,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 10:48:21,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 10:48:21,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 10:48:21,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 10:48:21,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 10:48:21,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 10:48:21,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 10:48:21,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 10:48:21,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 10:48:21,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 10:48:21,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 10:48:21,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 10:48:21,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 10:48:21,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 10:48:21,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 10:48:21,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 10:48:21,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 10:48:21,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 10:48:21,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 10:48:21,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 10:48:21,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 10:48:21,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 10:48:21,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 10:48:21,291 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 10:48:21,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 10:48:21,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 10:48:21,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 10:48:21,298 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 10:48:21,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 10:48:21,299 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 10:48:21,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 10:48:21,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 10:48:21,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 10:48:21,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 10:48:21,303 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-09 10:48:21,346 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 10:48:21,346 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 10:48:21,347 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 10:48:21,347 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 10:48:21,348 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 10:48:21,349 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 10:48:21,349 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 10:48:21,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 10:48:21,349 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-09 10:48:21,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 10:48:21,351 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-09 10:48:21,351 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 10:48:21,351 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-09 10:48:21,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-09 10:48:21,352 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-09 10:48:21,352 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-09 10:48:21,352 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 10:48:21,352 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 10:48:21,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-09 10:48:21,353 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 10:48:21,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 10:48:21,353 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-09 10:48:21,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 10:48:21,354 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 10:48:21,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-09 10:48:21,355 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-09 10:48:21,355 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 10:48:21,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-09 10:48:21,355 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-09 10:48:21,357 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-09 10:48:21,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-09 10:48:21,358 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 10:48:21,358 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_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/bin/uautomizer-IVEQpCNsaX/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_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/bin/uautomizer-IVEQpCNsaX 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 -> a05fbc1d8a2048d37fda072c6a9d42f1f996d033c914869a4e2960aadff82dde [2021-11-09 10:48:21,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 10:48:21,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 10:48:21,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 10:48:21,636 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 10:48:21,637 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 10:48:21,638 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2021-11-09 10:48:21,727 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/bin/uautomizer-IVEQpCNsaX/data/c69550be5/caa6c8524c6c441696186961346994a0/FLAGe90664160 [2021-11-09 10:48:22,262 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 10:48:22,268 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2021-11-09 10:48:22,280 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/bin/uautomizer-IVEQpCNsaX/data/c69550be5/caa6c8524c6c441696186961346994a0/FLAGe90664160 [2021-11-09 10:48:22,570 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/bin/uautomizer-IVEQpCNsaX/data/c69550be5/caa6c8524c6c441696186961346994a0 [2021-11-09 10:48:22,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 10:48:22,574 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 10:48:22,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 10:48:22,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 10:48:22,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 10:48:22,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:48:22" (1/1) ... [2021-11-09 10:48:22,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73845244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:48:22, skipping insertion in model container [2021-11-09 10:48:22,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:48:22" (1/1) ... [2021-11-09 10:48:22,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 10:48:22,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 10:48:22,954 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_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c[29656,29669] [2021-11-09 10:48:22,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 10:48:22,970 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 10:48:23,050 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_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c[29656,29669] [2021-11-09 10:48:23,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 10:48:23,068 INFO L208 MainTranslator]: Completed translation [2021-11-09 10:48:23,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:48:23 WrapperNode [2021-11-09 10:48:23,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 10:48:23,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 10:48:23,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 10:48:23,071 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 10:48:23,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:48:23" (1/1) ... [2021-11-09 10:48:23,111 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:48:23" (1/1) ... [2021-11-09 10:48:23,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 10:48:23,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 10:48:23,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 10:48:23,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 10:48:23,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:48:23" (1/1) ... [2021-11-09 10:48:23,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:48:23" (1/1) ... [2021-11-09 10:48:23,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:48:23" (1/1) ... [2021-11-09 10:48:23,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:48:23" (1/1) ... [2021-11-09 10:48:23,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:48:23" (1/1) ... [2021-11-09 10:48:23,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:48:23" (1/1) ... [2021-11-09 10:48:23,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:48:23" (1/1) ... [2021-11-09 10:48:23,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 10:48:23,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 10:48:23,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 10:48:23,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 10:48:23,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:48:23" (1/1) ... [2021-11-09 10:48:23,360 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 10:48:23,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:48:23,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-09 10:48:23,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-09 10:48:23,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 10:48:23,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-09 10:48:23,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 10:48:23,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 10:48:23,619 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 10:48:23,629 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 10:48:23,643 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 10:48:23,681 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 10:48:23,690 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 10:48:23,697 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 10:48:23,708 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 10:48:23,719 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 10:48:23,730 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 10:48:23,738 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 10:48:23,744 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 10:48:23,766 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 10:48:24,673 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-11-09 10:48:24,675 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-11-09 10:48:24,675 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2021-11-09 10:48:24,676 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2021-11-09 10:48:24,676 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##219: assume false; [2021-11-09 10:48:24,676 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##220: assume !false; [2021-11-09 10:48:24,676 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2021-11-09 10:48:24,676 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2021-11-09 10:48:24,676 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##322: assume !false; [2021-11-09 10:48:24,677 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##321: assume false; [2021-11-09 10:48:24,677 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-11-09 10:48:24,677 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-11-09 10:48:24,678 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2021-11-09 10:48:24,678 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2021-11-09 10:48:24,678 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume !false; [2021-11-09 10:48:24,679 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume false; [2021-11-09 10:48:24,679 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume false; [2021-11-09 10:48:24,679 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume !false; [2021-11-09 10:48:24,679 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##389: assume !false; [2021-11-09 10:48:24,679 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##388: assume false; [2021-11-09 10:48:24,679 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-11-09 10:48:24,680 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-11-09 10:48:24,680 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !false; [2021-11-09 10:48:24,680 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##161: assume false; [2021-11-09 10:48:24,701 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 10:48:24,701 INFO L299 CfgBuilder]: Removed 154 assume(true) statements. [2021-11-09 10:48:24,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:48:24 BoogieIcfgContainer [2021-11-09 10:48:24,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 10:48:24,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-09 10:48:24,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-09 10:48:24,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-09 10:48:24,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:48:22" (1/3) ... [2021-11-09 10:48:24,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d1ac7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:48:24, skipping insertion in model container [2021-11-09 10:48:24,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:48:23" (2/3) ... [2021-11-09 10:48:24,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d1ac7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:48:24, skipping insertion in model container [2021-11-09 10:48:24,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:48:24" (3/3) ... [2021-11-09 10:48:24,712 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2021-11-09 10:48:24,729 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-09 10:48:24,729 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2021-11-09 10:48:24,804 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-09 10:48:24,812 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-09 10:48:24,813 INFO L340 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2021-11-09 10:48:24,847 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-11-09 10:48:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-09 10:48:24,854 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:24,854 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:48:24,855 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-11-09 10:48:24,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:24,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1766777508, now seen corresponding path program 1 times [2021-11-09 10:48:24,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:24,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44069347] [2021-11-09 10:48:24,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:24,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:25,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:25,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44069347] [2021-11-09 10:48:25,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44069347] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:25,064 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:25,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:48:25,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898805974] [2021-11-09 10:48:25,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:48:25,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:25,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:48:25,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:25,087 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-11-09 10:48:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:25,206 INFO L93 Difference]: Finished difference Result 578 states and 842 transitions. [2021-11-09 10:48:25,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:48:25,208 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-11-09 10:48:25,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:25,223 INFO L225 Difference]: With dead ends: 578 [2021-11-09 10:48:25,223 INFO L226 Difference]: Without dead ends: 324 [2021-11-09 10:48:25,227 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:25,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-11-09 10:48:25,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2021-11-09 10:48:25,288 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-11-09 10:48:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 442 transitions. [2021-11-09 10:48:25,292 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 442 transitions. Word has length 11 [2021-11-09 10:48:25,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:25,293 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 442 transitions. [2021-11-09 10:48:25,293 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-11-09 10:48:25,293 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 442 transitions. [2021-11-09 10:48:25,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-09 10:48:25,294 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:25,295 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:48:25,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-09 10:48:25,295 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-11-09 10:48:25,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:25,296 INFO L85 PathProgramCache]: Analyzing trace with hash 557701687, now seen corresponding path program 1 times [2021-11-09 10:48:25,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:25,297 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216276060] [2021-11-09 10:48:25,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:25,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:25,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:25,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:25,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216276060] [2021-11-09 10:48:25,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216276060] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:25,410 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:25,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:48:25,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117911338] [2021-11-09 10:48:25,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:48:25,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:25,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:48:25,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:25,419 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-11-09 10:48:25,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:25,631 INFO L93 Difference]: Finished difference Result 433 states and 577 transitions. [2021-11-09 10:48:25,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:48:25,632 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-11-09 10:48:25,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:25,643 INFO L225 Difference]: With dead ends: 433 [2021-11-09 10:48:25,644 INFO L226 Difference]: Without dead ends: 368 [2021-11-09 10:48:25,647 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:25,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-11-09 10:48:25,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 351. [2021-11-09 10:48:25,697 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-11-09 10:48:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 479 transitions. [2021-11-09 10:48:25,700 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 479 transitions. Word has length 13 [2021-11-09 10:48:25,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:25,700 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 479 transitions. [2021-11-09 10:48:25,701 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-11-09 10:48:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 479 transitions. [2021-11-09 10:48:25,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-09 10:48:25,703 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:25,703 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:48:25,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-09 10:48:25,703 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-11-09 10:48:25,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:25,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1900748477, now seen corresponding path program 1 times [2021-11-09 10:48:25,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:25,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258567945] [2021-11-09 10:48:25,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:25,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:25,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:25,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258567945] [2021-11-09 10:48:25,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258567945] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:25,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:25,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:48:25,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47113364] [2021-11-09 10:48:25,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:48:25,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:25,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:48:25,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:25,832 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-11-09 10:48:25,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:25,883 INFO L93 Difference]: Finished difference Result 554 states and 735 transitions. [2021-11-09 10:48:25,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:48:25,884 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-11-09 10:48:25,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:25,886 INFO L225 Difference]: With dead ends: 554 [2021-11-09 10:48:25,887 INFO L226 Difference]: Without dead ends: 362 [2021-11-09 10:48:25,888 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:25,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-11-09 10:48:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 307. [2021-11-09 10:48:25,936 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-11-09 10:48:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 421 transitions. [2021-11-09 10:48:25,938 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 421 transitions. Word has length 15 [2021-11-09 10:48:25,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:25,938 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 421 transitions. [2021-11-09 10:48:25,939 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-11-09 10:48:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 421 transitions. [2021-11-09 10:48:25,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-09 10:48:25,946 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:25,947 INFO L513 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-11-09 10:48:25,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-09 10:48:25,947 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-11-09 10:48:25,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash 306593718, now seen corresponding path program 1 times [2021-11-09 10:48:25,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:25,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006512903] [2021-11-09 10:48:25,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:25,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:26,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:26,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006512903] [2021-11-09 10:48:26,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006512903] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:26,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:26,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:48:26,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942950457] [2021-11-09 10:48:26,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:48:26,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:26,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:48:26,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:26,029 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-11-09 10:48:26,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:26,154 INFO L93 Difference]: Finished difference Result 307 states and 421 transitions. [2021-11-09 10:48:26,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:48:26,155 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-11-09 10:48:26,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:26,157 INFO L225 Difference]: With dead ends: 307 [2021-11-09 10:48:26,157 INFO L226 Difference]: Without dead ends: 293 [2021-11-09 10:48:26,158 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:26,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-11-09 10:48:26,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2021-11-09 10:48:26,172 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-11-09 10:48:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 407 transitions. [2021-11-09 10:48:26,174 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 407 transitions. Word has length 21 [2021-11-09 10:48:26,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:26,174 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 407 transitions. [2021-11-09 10:48:26,175 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-11-09 10:48:26,175 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 407 transitions. [2021-11-09 10:48:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-09 10:48:26,176 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:26,176 INFO L513 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-11-09 10:48:26,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-09 10:48:26,177 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-11-09 10:48:26,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:26,177 INFO L85 PathProgramCache]: Analyzing trace with hash 847063989, now seen corresponding path program 1 times [2021-11-09 10:48:26,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:26,178 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063830504] [2021-11-09 10:48:26,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:26,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:26,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:26,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063830504] [2021-11-09 10:48:26,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063830504] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:26,271 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:26,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 10:48:26,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532751422] [2021-11-09 10:48:26,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 10:48:26,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:26,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 10:48:26,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 10:48:26,273 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-11-09 10:48:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:26,425 INFO L93 Difference]: Finished difference Result 318 states and 435 transitions. [2021-11-09 10:48:26,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 10:48:26,425 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-11-09 10:48:26,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:26,428 INFO L225 Difference]: With dead ends: 318 [2021-11-09 10:48:26,428 INFO L226 Difference]: Without dead ends: 309 [2021-11-09 10:48:26,428 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:48:26,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-11-09 10:48:26,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 305. [2021-11-09 10:48:26,459 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-11-09 10:48:26,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 422 transitions. [2021-11-09 10:48:26,460 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 422 transitions. Word has length 26 [2021-11-09 10:48:26,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:26,461 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 422 transitions. [2021-11-09 10:48:26,461 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-11-09 10:48:26,461 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 422 transitions. [2021-11-09 10:48:26,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-09 10:48:26,465 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:26,465 INFO L513 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-11-09 10:48:26,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-09 10:48:26,466 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-11-09 10:48:26,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:26,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1660315800, now seen corresponding path program 1 times [2021-11-09 10:48:26,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:26,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258095473] [2021-11-09 10:48:26,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:26,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:26,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:26,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:26,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258095473] [2021-11-09 10:48:26,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258095473] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:26,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:26,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:48:26,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94029425] [2021-11-09 10:48:26,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:48:26,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:26,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:48:26,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:26,535 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-11-09 10:48:26,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:26,633 INFO L93 Difference]: Finished difference Result 349 states and 478 transitions. [2021-11-09 10:48:26,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:48:26,634 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-11-09 10:48:26,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:26,636 INFO L225 Difference]: With dead ends: 349 [2021-11-09 10:48:26,637 INFO L226 Difference]: Without dead ends: 302 [2021-11-09 10:48:26,637 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:26,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-11-09 10:48:26,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2021-11-09 10:48:26,660 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-11-09 10:48:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 418 transitions. [2021-11-09 10:48:26,661 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 418 transitions. Word has length 27 [2021-11-09 10:48:26,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:26,662 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 418 transitions. [2021-11-09 10:48:26,662 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-11-09 10:48:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 418 transitions. [2021-11-09 10:48:26,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-09 10:48:26,664 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:26,664 INFO L513 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-11-09 10:48:26,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-09 10:48:26,664 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-11-09 10:48:26,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:26,665 INFO L85 PathProgramCache]: Analyzing trace with hash -23036524, now seen corresponding path program 1 times [2021-11-09 10:48:26,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:26,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031368179] [2021-11-09 10:48:26,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:26,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:26,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:26,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031368179] [2021-11-09 10:48:26,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031368179] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:26,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:26,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:48:26,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024290774] [2021-11-09 10:48:26,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:48:26,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:26,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:48:26,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:26,730 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-11-09 10:48:26,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:26,766 INFO L93 Difference]: Finished difference Result 366 states and 498 transitions. [2021-11-09 10:48:26,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:48:26,766 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-11-09 10:48:26,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:26,769 INFO L225 Difference]: With dead ends: 366 [2021-11-09 10:48:26,769 INFO L226 Difference]: Without dead ends: 315 [2021-11-09 10:48:26,770 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:26,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-11-09 10:48:26,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 302. [2021-11-09 10:48:26,792 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-11-09 10:48:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 417 transitions. [2021-11-09 10:48:26,793 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 417 transitions. Word has length 27 [2021-11-09 10:48:26,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:26,794 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 417 transitions. [2021-11-09 10:48:26,794 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-11-09 10:48:26,794 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 417 transitions. [2021-11-09 10:48:26,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-09 10:48:26,795 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:26,795 INFO L513 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-11-09 10:48:26,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-09 10:48:26,796 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-11-09 10:48:26,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:26,796 INFO L85 PathProgramCache]: Analyzing trace with hash 476963846, now seen corresponding path program 1 times [2021-11-09 10:48:26,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:26,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709164684] [2021-11-09 10:48:26,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:26,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:26,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:26,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:26,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709164684] [2021-11-09 10:48:26,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709164684] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:26,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:26,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 10:48:26,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712847539] [2021-11-09 10:48:26,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 10:48:26,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:26,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 10:48:26,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 10:48:26,894 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-11-09 10:48:27,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:27,044 INFO L93 Difference]: Finished difference Result 310 states and 423 transitions. [2021-11-09 10:48:27,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 10:48:27,046 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-11-09 10:48:27,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:27,048 INFO L225 Difference]: With dead ends: 310 [2021-11-09 10:48:27,049 INFO L226 Difference]: Without dead ends: 306 [2021-11-09 10:48:27,049 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:48:27,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-11-09 10:48:27,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2021-11-09 10:48:27,070 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-11-09 10:48:27,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 416 transitions. [2021-11-09 10:48:27,072 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 416 transitions. Word has length 27 [2021-11-09 10:48:27,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:27,072 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 416 transitions. [2021-11-09 10:48:27,072 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-11-09 10:48:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 416 transitions. [2021-11-09 10:48:27,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-09 10:48:27,074 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:27,074 INFO L513 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-11-09 10:48:27,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-09 10:48:27,075 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-11-09 10:48:27,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:27,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1894183263, now seen corresponding path program 1 times [2021-11-09 10:48:27,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:27,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362387079] [2021-11-09 10:48:27,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:27,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:27,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:27,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:27,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362387079] [2021-11-09 10:48:27,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362387079] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:27,109 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:27,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:48:27,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914553294] [2021-11-09 10:48:27,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:48:27,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:27,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:48:27,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:27,111 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-11-09 10:48:27,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:27,148 INFO L93 Difference]: Finished difference Result 319 states and 437 transitions. [2021-11-09 10:48:27,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:48:27,149 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-11-09 10:48:27,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:27,151 INFO L225 Difference]: With dead ends: 319 [2021-11-09 10:48:27,151 INFO L226 Difference]: Without dead ends: 273 [2021-11-09 10:48:27,152 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:27,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-11-09 10:48:27,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 249. [2021-11-09 10:48:27,170 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-11-09 10:48:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 347 transitions. [2021-11-09 10:48:27,171 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 347 transitions. Word has length 28 [2021-11-09 10:48:27,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:27,172 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 347 transitions. [2021-11-09 10:48:27,172 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-11-09 10:48:27,172 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 347 transitions. [2021-11-09 10:48:27,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-09 10:48:27,173 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:27,173 INFO L513 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-11-09 10:48:27,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-09 10:48:27,174 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-11-09 10:48:27,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:27,174 INFO L85 PathProgramCache]: Analyzing trace with hash 403678015, now seen corresponding path program 1 times [2021-11-09 10:48:27,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:27,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532737967] [2021-11-09 10:48:27,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:27,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:27,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:27,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532737967] [2021-11-09 10:48:27,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532737967] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:27,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:27,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 10:48:27,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487006280] [2021-11-09 10:48:27,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 10:48:27,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:27,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 10:48:27,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:48:27,222 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-11-09 10:48:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:27,414 INFO L93 Difference]: Finished difference Result 410 states and 537 transitions. [2021-11-09 10:48:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 10:48:27,415 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-11-09 10:48:27,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:27,417 INFO L225 Difference]: With dead ends: 410 [2021-11-09 10:48:27,418 INFO L226 Difference]: Without dead ends: 359 [2021-11-09 10:48:27,418 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-09 10:48:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-11-09 10:48:27,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 284. [2021-11-09 10:48:27,450 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-11-09 10:48:27,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 399 transitions. [2021-11-09 10:48:27,452 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 399 transitions. Word has length 30 [2021-11-09 10:48:27,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:27,452 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 399 transitions. [2021-11-09 10:48:27,452 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-11-09 10:48:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 399 transitions. [2021-11-09 10:48:27,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-09 10:48:27,454 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:27,454 INFO L513 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-11-09 10:48:27,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-09 10:48:27,455 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-11-09 10:48:27,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:27,455 INFO L85 PathProgramCache]: Analyzing trace with hash 361661719, now seen corresponding path program 1 times [2021-11-09 10:48:27,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:27,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363827232] [2021-11-09 10:48:27,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:27,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:27,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:27,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363827232] [2021-11-09 10:48:27,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363827232] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:27,503 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:27,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 10:48:27,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181872966] [2021-11-09 10:48:27,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 10:48:27,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:27,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 10:48:27,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:48:27,505 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-11-09 10:48:27,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:27,678 INFO L93 Difference]: Finished difference Result 341 states and 456 transitions. [2021-11-09 10:48:27,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 10:48:27,679 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-11-09 10:48:27,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:27,681 INFO L225 Difference]: With dead ends: 341 [2021-11-09 10:48:27,682 INFO L226 Difference]: Without dead ends: 315 [2021-11-09 10:48:27,682 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-09 10:48:27,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-11-09 10:48:27,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 271. [2021-11-09 10:48:27,707 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-11-09 10:48:27,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 381 transitions. [2021-11-09 10:48:27,709 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 381 transitions. Word has length 30 [2021-11-09 10:48:27,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:27,710 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 381 transitions. [2021-11-09 10:48:27,710 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-11-09 10:48:27,710 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 381 transitions. [2021-11-09 10:48:27,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-09 10:48:27,712 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:27,712 INFO L513 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-11-09 10:48:27,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-09 10:48:27,712 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-11-09 10:48:27,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:27,713 INFO L85 PathProgramCache]: Analyzing trace with hash -959450186, now seen corresponding path program 1 times [2021-11-09 10:48:27,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:27,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969721740] [2021-11-09 10:48:27,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:27,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:27,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:27,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969721740] [2021-11-09 10:48:27,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969721740] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:27,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:27,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 10:48:27,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095057395] [2021-11-09 10:48:27,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 10:48:27,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:27,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 10:48:27,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 10:48:27,785 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-11-09 10:48:27,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:27,920 INFO L93 Difference]: Finished difference Result 305 states and 415 transitions. [2021-11-09 10:48:27,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 10:48:27,921 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-11-09 10:48:27,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:27,923 INFO L225 Difference]: With dead ends: 305 [2021-11-09 10:48:27,923 INFO L226 Difference]: Without dead ends: 271 [2021-11-09 10:48:27,924 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:48:27,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-11-09 10:48:27,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2021-11-09 10:48:27,948 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-11-09 10:48:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 368 transitions. [2021-11-09 10:48:27,950 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 368 transitions. Word has length 31 [2021-11-09 10:48:27,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:27,950 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 368 transitions. [2021-11-09 10:48:27,951 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-11-09 10:48:27,951 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 368 transitions. [2021-11-09 10:48:27,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-09 10:48:27,952 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:27,952 INFO L513 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-11-09 10:48:27,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-09 10:48:27,952 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-11-09 10:48:27,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:27,953 INFO L85 PathProgramCache]: Analyzing trace with hash -378484437, now seen corresponding path program 1 times [2021-11-09 10:48:27,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:27,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601104259] [2021-11-09 10:48:27,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:27,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:28,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:28,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:28,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601104259] [2021-11-09 10:48:28,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601104259] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:28,006 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:28,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:48:28,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598885360] [2021-11-09 10:48:28,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:48:28,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:28,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:48:28,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:28,008 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-11-09 10:48:28,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:28,076 INFO L93 Difference]: Finished difference Result 499 states and 682 transitions. [2021-11-09 10:48:28,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:48:28,077 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-11-09 10:48:28,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:28,080 INFO L225 Difference]: With dead ends: 499 [2021-11-09 10:48:28,081 INFO L226 Difference]: Without dead ends: 495 [2021-11-09 10:48:28,081 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2021-11-09 10:48:28,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 321. [2021-11-09 10:48:28,117 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-11-09 10:48:28,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 434 transitions. [2021-11-09 10:48:28,119 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 434 transitions. Word has length 31 [2021-11-09 10:48:28,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:28,119 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 434 transitions. [2021-11-09 10:48:28,126 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-11-09 10:48:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 434 transitions. [2021-11-09 10:48:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-09 10:48:28,128 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:28,128 INFO L513 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-11-09 10:48:28,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-09 10:48:28,128 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-11-09 10:48:28,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:28,129 INFO L85 PathProgramCache]: Analyzing trace with hash -378424855, now seen corresponding path program 1 times [2021-11-09 10:48:28,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:28,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392597646] [2021-11-09 10:48:28,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:28,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:28,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:28,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392597646] [2021-11-09 10:48:28,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392597646] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:28,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:28,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 10:48:28,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554927397] [2021-11-09 10:48:28,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 10:48:28,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:28,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 10:48:28,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 10:48:28,178 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-11-09 10:48:28,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:28,235 INFO L93 Difference]: Finished difference Result 367 states and 489 transitions. [2021-11-09 10:48:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 10:48:28,236 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-11-09 10:48:28,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:28,238 INFO L225 Difference]: With dead ends: 367 [2021-11-09 10:48:28,238 INFO L226 Difference]: Without dead ends: 309 [2021-11-09 10:48:28,239 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:48:28,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-11-09 10:48:28,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2021-11-09 10:48:28,272 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-11-09 10:48:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 416 transitions. [2021-11-09 10:48:28,273 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 416 transitions. Word has length 31 [2021-11-09 10:48:28,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:28,274 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 416 transitions. [2021-11-09 10:48:28,274 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-11-09 10:48:28,274 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 416 transitions. [2021-11-09 10:48:28,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-09 10:48:28,275 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:28,276 INFO L513 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-11-09 10:48:28,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-09 10:48:28,276 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-11-09 10:48:28,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:28,277 INFO L85 PathProgramCache]: Analyzing trace with hash -329006014, now seen corresponding path program 1 times [2021-11-09 10:48:28,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:28,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673375120] [2021-11-09 10:48:28,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:28,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:28,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:28,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673375120] [2021-11-09 10:48:28,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673375120] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:28,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:28,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 10:48:28,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278636396] [2021-11-09 10:48:28,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 10:48:28,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:28,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 10:48:28,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 10:48:28,325 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-11-09 10:48:28,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:28,457 INFO L93 Difference]: Finished difference Result 343 states and 459 transitions. [2021-11-09 10:48:28,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 10:48:28,458 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-11-09 10:48:28,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:28,460 INFO L225 Difference]: With dead ends: 343 [2021-11-09 10:48:28,460 INFO L226 Difference]: Without dead ends: 297 [2021-11-09 10:48:28,461 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:48:28,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-11-09 10:48:28,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2021-11-09 10:48:28,492 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-11-09 10:48:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 400 transitions. [2021-11-09 10:48:28,494 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 400 transitions. Word has length 32 [2021-11-09 10:48:28,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:28,494 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 400 transitions. [2021-11-09 10:48:28,495 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-11-09 10:48:28,495 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 400 transitions. [2021-11-09 10:48:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-09 10:48:28,496 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:28,496 INFO L513 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-11-09 10:48:28,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-09 10:48:28,497 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-11-09 10:48:28,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:28,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2012498225, now seen corresponding path program 1 times [2021-11-09 10:48:28,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:28,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355824976] [2021-11-09 10:48:28,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:28,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:28,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:28,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:28,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355824976] [2021-11-09 10:48:28,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355824976] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:28,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:28,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-09 10:48:28,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349247260] [2021-11-09 10:48:28,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-09 10:48:28,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:28,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-09 10:48:28,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-09 10:48:28,547 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-11-09 10:48:28,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:28,769 INFO L93 Difference]: Finished difference Result 330 states and 433 transitions. [2021-11-09 10:48:28,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-09 10:48:28,770 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-11-09 10:48:28,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:28,772 INFO L225 Difference]: With dead ends: 330 [2021-11-09 10:48:28,772 INFO L226 Difference]: Without dead ends: 267 [2021-11-09 10:48:28,772 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-09 10:48:28,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-11-09 10:48:28,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 245. [2021-11-09 10:48:28,797 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-11-09 10:48:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 328 transitions. [2021-11-09 10:48:28,799 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 328 transitions. Word has length 33 [2021-11-09 10:48:28,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:28,799 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 328 transitions. [2021-11-09 10:48:28,800 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-11-09 10:48:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 328 transitions. [2021-11-09 10:48:28,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-09 10:48:28,801 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:28,801 INFO L513 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-11-09 10:48:28,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-09 10:48:28,801 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-11-09 10:48:28,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:28,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1781478438, now seen corresponding path program 1 times [2021-11-09 10:48:28,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:28,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714518680] [2021-11-09 10:48:28,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:28,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:28,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:28,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714518680] [2021-11-09 10:48:28,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714518680] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:28,837 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:28,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:48:28,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185749719] [2021-11-09 10:48:28,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:48:28,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:28,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:48:28,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:28,839 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-11-09 10:48:28,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:28,926 INFO L93 Difference]: Finished difference Result 356 states and 458 transitions. [2021-11-09 10:48:28,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:48:28,927 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-11-09 10:48:28,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:28,929 INFO L225 Difference]: With dead ends: 356 [2021-11-09 10:48:28,929 INFO L226 Difference]: Without dead ends: 299 [2021-11-09 10:48:28,929 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:28,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-11-09 10:48:28,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 247. [2021-11-09 10:48:28,955 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-11-09 10:48:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 330 transitions. [2021-11-09 10:48:28,957 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 330 transitions. Word has length 34 [2021-11-09 10:48:28,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:28,957 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 330 transitions. [2021-11-09 10:48:28,958 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-11-09 10:48:28,958 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 330 transitions. [2021-11-09 10:48:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-09 10:48:28,959 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:28,959 INFO L513 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-11-09 10:48:28,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-09 10:48:28,960 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-11-09 10:48:28,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:28,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1662125936, now seen corresponding path program 1 times [2021-11-09 10:48:28,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:28,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991840786] [2021-11-09 10:48:28,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:28,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:28,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:28,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991840786] [2021-11-09 10:48:28,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991840786] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:28,988 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:28,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:48:28,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915413485] [2021-11-09 10:48:28,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:48:28,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:28,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:48:28,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:28,990 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-11-09 10:48:29,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:29,066 INFO L93 Difference]: Finished difference Result 263 states and 349 transitions. [2021-11-09 10:48:29,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:48:29,067 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-11-09 10:48:29,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:29,068 INFO L225 Difference]: With dead ends: 263 [2021-11-09 10:48:29,069 INFO L226 Difference]: Without dead ends: 259 [2021-11-09 10:48:29,069 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:29,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-11-09 10:48:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 251. [2021-11-09 10:48:29,094 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-11-09 10:48:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 333 transitions. [2021-11-09 10:48:29,095 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 333 transitions. Word has length 34 [2021-11-09 10:48:29,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:29,096 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 333 transitions. [2021-11-09 10:48:29,096 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-11-09 10:48:29,096 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 333 transitions. [2021-11-09 10:48:29,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-09 10:48:29,097 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:29,097 INFO L513 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-11-09 10:48:29,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-09 10:48:29,098 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-11-09 10:48:29,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:29,098 INFO L85 PathProgramCache]: Analyzing trace with hash -822248422, now seen corresponding path program 1 times [2021-11-09 10:48:29,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:29,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058842270] [2021-11-09 10:48:29,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:29,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:29,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:29,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:29,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058842270] [2021-11-09 10:48:29,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058842270] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:29,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:29,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 10:48:29,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459024126] [2021-11-09 10:48:29,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 10:48:29,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:29,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 10:48:29,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:48:29,147 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-11-09 10:48:29,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:29,278 INFO L93 Difference]: Finished difference Result 304 states and 384 transitions. [2021-11-09 10:48:29,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 10:48:29,278 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-11-09 10:48:29,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:29,280 INFO L225 Difference]: With dead ends: 304 [2021-11-09 10:48:29,280 INFO L226 Difference]: Without dead ends: 300 [2021-11-09 10:48:29,281 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-09 10:48:29,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-11-09 10:48:29,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 251. [2021-11-09 10:48:29,307 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-11-09 10:48:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 331 transitions. [2021-11-09 10:48:29,308 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 331 transitions. Word has length 34 [2021-11-09 10:48:29,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:29,309 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 331 transitions. [2021-11-09 10:48:29,309 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-11-09 10:48:29,309 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 331 transitions. [2021-11-09 10:48:29,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-09 10:48:29,310 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:29,311 INFO L513 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-11-09 10:48:29,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-09 10:48:29,311 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-11-09 10:48:29,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:29,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1935189253, now seen corresponding path program 1 times [2021-11-09 10:48:29,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:29,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468312203] [2021-11-09 10:48:29,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:29,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:29,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:29,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:29,351 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468312203] [2021-11-09 10:48:29,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468312203] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:29,352 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:29,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-09 10:48:29,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690615638] [2021-11-09 10:48:29,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 10:48:29,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:29,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 10:48:29,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-09 10:48:29,354 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-11-09 10:48:29,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:29,485 INFO L93 Difference]: Finished difference Result 262 states and 342 transitions. [2021-11-09 10:48:29,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 10:48:29,485 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-11-09 10:48:29,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:29,487 INFO L225 Difference]: With dead ends: 262 [2021-11-09 10:48:29,487 INFO L226 Difference]: Without dead ends: 229 [2021-11-09 10:48:29,488 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-09 10:48:29,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-11-09 10:48:29,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2021-11-09 10:48:29,509 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-11-09 10:48:29,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 299 transitions. [2021-11-09 10:48:29,510 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 299 transitions. Word has length 34 [2021-11-09 10:48:29,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:29,510 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 299 transitions. [2021-11-09 10:48:29,511 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-11-09 10:48:29,511 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 299 transitions. [2021-11-09 10:48:29,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-09 10:48:29,512 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:29,512 INFO L513 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-11-09 10:48:29,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-09 10:48:29,512 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-11-09 10:48:29,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:29,513 INFO L85 PathProgramCache]: Analyzing trace with hash -21362253, now seen corresponding path program 1 times [2021-11-09 10:48:29,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:29,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625770980] [2021-11-09 10:48:29,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:29,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:29,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:29,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625770980] [2021-11-09 10:48:29,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625770980] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:29,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:29,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 10:48:29,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324805438] [2021-11-09 10:48:29,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 10:48:29,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:29,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 10:48:29,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 10:48:29,570 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-11-09 10:48:29,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:29,668 INFO L93 Difference]: Finished difference Result 254 states and 323 transitions. [2021-11-09 10:48:29,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 10:48:29,668 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-11-09 10:48:29,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:29,670 INFO L225 Difference]: With dead ends: 254 [2021-11-09 10:48:29,670 INFO L226 Difference]: Without dead ends: 241 [2021-11-09 10:48:29,671 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:48:29,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-11-09 10:48:29,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 218. [2021-11-09 10:48:29,691 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-11-09 10:48:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 284 transitions. [2021-11-09 10:48:29,692 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 284 transitions. Word has length 35 [2021-11-09 10:48:29,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:29,693 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 284 transitions. [2021-11-09 10:48:29,693 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-11-09 10:48:29,693 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 284 transitions. [2021-11-09 10:48:29,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-09 10:48:29,694 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:29,694 INFO L513 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-11-09 10:48:29,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-09 10:48:29,695 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-11-09 10:48:29,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:29,695 INFO L85 PathProgramCache]: Analyzing trace with hash 272561262, now seen corresponding path program 1 times [2021-11-09 10:48:29,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:29,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431513157] [2021-11-09 10:48:29,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:29,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:29,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:29,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431513157] [2021-11-09 10:48:29,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431513157] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:29,761 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:29,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 10:48:29,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733846945] [2021-11-09 10:48:29,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 10:48:29,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:29,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 10:48:29,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:48:29,763 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-11-09 10:48:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:29,880 INFO L93 Difference]: Finished difference Result 276 states and 342 transitions. [2021-11-09 10:48:29,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 10:48:29,882 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-11-09 10:48:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:29,884 INFO L225 Difference]: With dead ends: 276 [2021-11-09 10:48:29,884 INFO L226 Difference]: Without dead ends: 245 [2021-11-09 10:48:29,885 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-09 10:48:29,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-11-09 10:48:29,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 218. [2021-11-09 10:48:29,906 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-11-09 10:48:29,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 278 transitions. [2021-11-09 10:48:29,907 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 278 transitions. Word has length 35 [2021-11-09 10:48:29,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:29,907 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 278 transitions. [2021-11-09 10:48:29,907 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-11-09 10:48:29,908 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 278 transitions. [2021-11-09 10:48:29,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-09 10:48:29,908 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:29,909 INFO L513 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-11-09 10:48:29,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-09 10:48:29,909 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-11-09 10:48:29,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:29,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1030061199, now seen corresponding path program 1 times [2021-11-09 10:48:29,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:29,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312533284] [2021-11-09 10:48:29,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:29,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:29,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:29,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312533284] [2021-11-09 10:48:29,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312533284] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:29,937 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:29,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:48:29,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467476424] [2021-11-09 10:48:29,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:48:29,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:29,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:48:29,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:29,939 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-11-09 10:48:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:29,964 INFO L93 Difference]: Finished difference Result 236 states and 298 transitions. [2021-11-09 10:48:29,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:48:29,964 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-11-09 10:48:29,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:29,966 INFO L225 Difference]: With dead ends: 236 [2021-11-09 10:48:29,966 INFO L226 Difference]: Without dead ends: 210 [2021-11-09 10:48:29,967 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:48:29,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-11-09 10:48:29,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-11-09 10:48:29,986 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-11-09 10:48:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 267 transitions. [2021-11-09 10:48:29,987 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 267 transitions. Word has length 35 [2021-11-09 10:48:29,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:29,988 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 267 transitions. [2021-11-09 10:48:29,988 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-11-09 10:48:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 267 transitions. [2021-11-09 10:48:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-09 10:48:29,989 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:29,989 INFO L513 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-11-09 10:48:29,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-09 10:48:29,989 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-11-09 10:48:29,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:29,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2102888975, now seen corresponding path program 1 times [2021-11-09 10:48:29,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:29,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108253076] [2021-11-09 10:48:29,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:29,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:30,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:30,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108253076] [2021-11-09 10:48:30,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108253076] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:30,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:30,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 10:48:30,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790116359] [2021-11-09 10:48:30,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 10:48:30,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:30,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 10:48:30,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 10:48:30,058 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-11-09 10:48:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:30,145 INFO L93 Difference]: Finished difference Result 238 states and 294 transitions. [2021-11-09 10:48:30,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 10:48:30,145 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-11-09 10:48:30,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:30,147 INFO L225 Difference]: With dead ends: 238 [2021-11-09 10:48:30,147 INFO L226 Difference]: Without dead ends: 233 [2021-11-09 10:48:30,148 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:48:30,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-09 10:48:30,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 227. [2021-11-09 10:48:30,172 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-11-09 10:48:30,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 284 transitions. [2021-11-09 10:48:30,173 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 284 transitions. Word has length 35 [2021-11-09 10:48:30,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:30,174 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 284 transitions. [2021-11-09 10:48:30,174 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-11-09 10:48:30,174 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 284 transitions. [2021-11-09 10:48:30,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-09 10:48:30,175 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:30,175 INFO L513 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-11-09 10:48:30,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-09 10:48:30,176 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-11-09 10:48:30,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:30,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1665760845, now seen corresponding path program 1 times [2021-11-09 10:48:30,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:30,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311286065] [2021-11-09 10:48:30,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:30,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:30,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:30,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311286065] [2021-11-09 10:48:30,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311286065] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:30,226 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:30,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-09 10:48:30,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235420723] [2021-11-09 10:48:30,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-09 10:48:30,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:30,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-09 10:48:30,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-09 10:48:30,228 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-11-09 10:48:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:30,393 INFO L93 Difference]: Finished difference Result 247 states and 304 transitions. [2021-11-09 10:48:30,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-09 10:48:30,393 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-11-09 10:48:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:30,394 INFO L225 Difference]: With dead ends: 247 [2021-11-09 10:48:30,395 INFO L226 Difference]: Without dead ends: 168 [2021-11-09 10:48:30,395 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-09 10:48:30,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-11-09 10:48:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2021-11-09 10:48:30,413 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-11-09 10:48:30,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 197 transitions. [2021-11-09 10:48:30,414 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 197 transitions. Word has length 35 [2021-11-09 10:48:30,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:30,414 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 197 transitions. [2021-11-09 10:48:30,414 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-11-09 10:48:30,415 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 197 transitions. [2021-11-09 10:48:30,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-09 10:48:30,415 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:30,416 INFO L513 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-11-09 10:48:30,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-09 10:48:30,416 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-11-09 10:48:30,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:30,417 INFO L85 PathProgramCache]: Analyzing trace with hash -961302835, now seen corresponding path program 1 times [2021-11-09 10:48:30,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:30,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246080582] [2021-11-09 10:48:30,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:30,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:48:30,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:30,461 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246080582] [2021-11-09 10:48:30,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246080582] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:30,461 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:30,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-09 10:48:30,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110040872] [2021-11-09 10:48:30,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-09 10:48:30,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:30,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-09 10:48:30,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-09 10:48:30,464 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-11-09 10:48:30,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:30,604 INFO L93 Difference]: Finished difference Result 224 states and 255 transitions. [2021-11-09 10:48:30,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-09 10:48:30,605 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-11-09 10:48:30,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:30,606 INFO L225 Difference]: With dead ends: 224 [2021-11-09 10:48:30,606 INFO L226 Difference]: Without dead ends: 195 [2021-11-09 10:48:30,607 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-11-09 10:48:30,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-11-09 10:48:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 167. [2021-11-09 10:48:30,625 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-11-09 10:48:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2021-11-09 10:48:30,626 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 36 [2021-11-09 10:48:30,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:30,626 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2021-11-09 10:48:30,626 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-11-09 10:48:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2021-11-09 10:48:30,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-09 10:48:30,627 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:30,627 INFO L513 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-11-09 10:48:30,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-09 10:48:30,628 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-11-09 10:48:30,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:30,628 INFO L85 PathProgramCache]: Analyzing trace with hash 724480386, now seen corresponding path program 1 times [2021-11-09 10:48:30,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:30,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248379683] [2021-11-09 10:48:30,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:30,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 10:48:30,644 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 10:48:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 10:48:30,705 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 10:48:30,706 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-09 10:48:30,707 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,709 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,709 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,709 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:30,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-09 10:48:30,719 INFO L731 BasicCegarLoop]: Path program 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-11-09 10:48:30,723 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-09 10:48:30,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:48:30 BoogieIcfgContainer [2021-11-09 10:48:30,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-09 10:48:30,804 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-09 10:48:30,804 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-09 10:48:30,804 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-09 10:48:30,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:48:24" (3/4) ... [2021-11-09 10:48:30,807 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-09 10:48:30,885 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/bin/uautomizer-IVEQpCNsaX/witness.graphml [2021-11-09 10:48:30,885 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-09 10:48:30,887 INFO L168 Benchmark]: Toolchain (without parser) took 8312.18 ms. Allocated memory was 90.2 MB in the beginning and 190.8 MB in the end (delta: 100.7 MB). Free memory was 54.6 MB in the beginning and 137.0 MB in the end (delta: -82.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-11-09 10:48:30,887 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 90.2 MB. Free memory was 60.1 MB in the beginning and 60.1 MB in the end (delta: 24.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 10:48:30,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 493.86 ms. Allocated memory was 90.2 MB in the beginning and 109.1 MB in the end (delta: 18.9 MB). Free memory was 54.4 MB in the beginning and 78.0 MB in the end (delta: -23.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 16.1 GB. [2021-11-09 10:48:30,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 176.97 ms. Allocated memory is still 109.1 MB. Free memory was 77.7 MB in the beginning and 71.7 MB in the end (delta: 6.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-09 10:48:30,889 INFO L168 Benchmark]: Boogie Preprocessor took 85.93 ms. Allocated memory is still 109.1 MB. Free memory was 71.7 MB in the beginning and 67.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-09 10:48:30,889 INFO L168 Benchmark]: RCFGBuilder took 1369.19 ms. Allocated memory is still 109.1 MB. Free memory was 67.7 MB in the beginning and 69.8 MB in the end (delta: -2.1 MB). Peak memory consumption was 22.4 MB. Max. memory is 16.1 GB. [2021-11-09 10:48:30,890 INFO L168 Benchmark]: TraceAbstraction took 6098.45 ms. Allocated memory was 109.1 MB in the beginning and 190.8 MB in the end (delta: 81.8 MB). Free memory was 69.3 MB in the beginning and 146.6 MB in the end (delta: -77.3 MB). Peak memory consumption was 101.9 MB. Max. memory is 16.1 GB. [2021-11-09 10:48:30,890 INFO L168 Benchmark]: Witness Printer took 81.63 ms. Allocated memory is still 190.8 MB. Free memory was 146.6 MB in the beginning and 137.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-09 10:48:30,893 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.26 ms. Allocated memory is still 90.2 MB. Free memory was 60.1 MB in the beginning and 60.1 MB in the end (delta: 24.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 493.86 ms. Allocated memory was 90.2 MB in the beginning and 109.1 MB in the end (delta: 18.9 MB). Free memory was 54.4 MB in the beginning and 78.0 MB in the end (delta: -23.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 176.97 ms. Allocated memory is still 109.1 MB. Free memory was 77.7 MB in the beginning and 71.7 MB in the end (delta: 6.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 85.93 ms. Allocated memory is still 109.1 MB. Free memory was 71.7 MB in the beginning and 67.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1369.19 ms. Allocated memory is still 109.1 MB. Free memory was 67.7 MB in the beginning and 69.8 MB in the end (delta: -2.1 MB). Peak memory consumption was 22.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6098.45 ms. Allocated memory was 109.1 MB in the beginning and 190.8 MB in the end (delta: 81.8 MB). Free memory was 69.3 MB in the beginning and 146.6 MB in the end (delta: -77.3 MB). Peak memory consumption was 101.9 MB. Max. memory is 16.1 GB. * Witness Printer took 81.63 ms. Allocated memory is still 190.8 MB. Free memory was 146.6 MB in the beginning and 137.0 MB in the end (delta: 9.6 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s 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: 5.9s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 7646 SDtfs, 5293 SDslu, 9940 SDs, 0 SdLazy, 2104 SolverSat, 295 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s 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.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 625 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s 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-11-09 10:48:30,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5dc4408-88fa-44cf-8101-2ad7a30bcb5f/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE