./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel/ticket-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8c2bbc92 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel/ticket-3.wvr.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux --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 9165506a5cbed6d9b33897b744e7410ef8890a41 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-04 18:48:37,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-04 18:48:37,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-04 18:48:37,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-04 18:48:37,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-04 18:48:37,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-04 18:48:37,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-04 18:48:37,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-04 18:48:37,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-04 18:48:37,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-04 18:48:37,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-04 18:48:37,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-04 18:48:37,436 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-04 18:48:37,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-04 18:48:37,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-04 18:48:37,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-04 18:48:37,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-04 18:48:37,443 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-04 18:48:37,445 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-04 18:48:37,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-04 18:48:37,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-04 18:48:37,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-04 18:48:37,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-04 18:48:37,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-04 18:48:37,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-04 18:48:37,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-04 18:48:37,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-04 18:48:37,471 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-04 18:48:37,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-04 18:48:37,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-04 18:48:37,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-04 18:48:37,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-04 18:48:37,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-04 18:48:37,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-04 18:48:37,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-04 18:48:37,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-04 18:48:37,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-04 18:48:37,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-04 18:48:37,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-04 18:48:37,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-04 18:48:37,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-04 18:48:37,491 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-04 18:48:37,542 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-04 18:48:37,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-04 18:48:37,544 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-04 18:48:37,544 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-04 18:48:37,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-04 18:48:37,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-04 18:48:37,547 INFO L138 SettingsManager]: * Use SBE=true [2021-10-04 18:48:37,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-04 18:48:37,547 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-04 18:48:37,547 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-04 18:48:37,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-04 18:48:37,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-04 18:48:37,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-04 18:48:37,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-04 18:48:37,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-04 18:48:37,550 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-04 18:48:37,550 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-04 18:48:37,550 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-04 18:48:37,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-04 18:48:37,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-04 18:48:37,551 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-04 18:48:37,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-04 18:48:37,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-04 18:48:37,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-04 18:48:37,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-04 18:48:37,552 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-04 18:48:37,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-04 18:48:37,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-04 18:48:37,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-04 18:48:37,553 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-04 18:48:37,553 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:/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux 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 -> 9165506a5cbed6d9b33897b744e7410ef8890a41 [2021-10-04 18:48:37,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-04 18:48:38,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-04 18:48:38,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-04 18:48:38,014 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-04 18:48:38,015 INFO L275 PluginConnector]: CDTParser initialized [2021-10-04 18:48:38,016 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel/ticket-3.wvr.c [2021-10-04 18:48:38,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/386ebcc61/6ef9cb412c904791a1b8d9c893c84edb/FLAGbc7fc62ed [2021-10-04 18:48:38,726 INFO L306 CDTParser]: Found 1 translation units. [2021-10-04 18:48:38,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/ticket-3.wvr.c [2021-10-04 18:48:38,728 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2021-10-04 18:48:38,728 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2021-10-04 18:48:38,737 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/386ebcc61/6ef9cb412c904791a1b8d9c893c84edb/FLAGbc7fc62ed [2021-10-04 18:48:39,102 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/386ebcc61/6ef9cb412c904791a1b8d9c893c84edb [2021-10-04 18:48:39,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-04 18:48:39,116 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-04 18:48:39,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-04 18:48:39,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-04 18:48:39,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-04 18:48:39,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.10 06:48:39" (1/1) ... [2021-10-04 18:48:39,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b71d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:48:39, skipping insertion in model container [2021-10-04 18:48:39,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.10 06:48:39" (1/1) ... [2021-10-04 18:48:39,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-04 18:48:39,157 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-04 18:48:39,325 WARN L612 FunctionHandler]: implicit declaration of function assert [2021-10-04 18:48:39,375 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/ticket-3.wvr.c[1513,1526] [2021-10-04 18:48:39,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-04 18:48:39,389 INFO L203 MainTranslator]: Completed pre-run [2021-10-04 18:48:39,399 WARN L612 FunctionHandler]: implicit declaration of function assert [2021-10-04 18:48:39,413 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/ticket-3.wvr.c[1513,1526] [2021-10-04 18:48:39,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-04 18:48:39,430 INFO L208 MainTranslator]: Completed translation [2021-10-04 18:48:39,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:48:39 WrapperNode [2021-10-04 18:48:39,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-04 18:48:39,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-04 18:48:39,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-04 18:48:39,433 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-04 18:48:39,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:48:39" (1/1) ... [2021-10-04 18:48:39,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:48:39" (1/1) ... [2021-10-04 18:48:39,479 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-04 18:48:39,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-04 18:48:39,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-04 18:48:39,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-04 18:48:39,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:48:39" (1/1) ... [2021-10-04 18:48:39,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:48:39" (1/1) ... [2021-10-04 18:48:39,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:48:39" (1/1) ... [2021-10-04 18:48:39,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:48:39" (1/1) ... [2021-10-04 18:48:39,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:48:39" (1/1) ... [2021-10-04 18:48:39,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:48:39" (1/1) ... [2021-10-04 18:48:39,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:48:39" (1/1) ... [2021-10-04 18:48:39,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-04 18:48:39,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-04 18:48:39,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-04 18:48:39,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-04 18:48:39,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:48:39" (1/1) ... [2021-10-04 18:48:39,545 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-04 18:48:39,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:48:39,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-04 18:48:39,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-04 18:48:39,664 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-04 18:48:39,664 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-04 18:48:39,664 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-04 18:48:39,664 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-04 18:48:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-04 18:48:39,665 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-04 18:48:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-04 18:48:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-04 18:48:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-04 18:48:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-04 18:48:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-04 18:48:39,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-04 18:48:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-04 18:48:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-04 18:48:39,668 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-04 18:48:40,160 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-04 18:48:40,160 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2021-10-04 18:48:40,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 06:48:40 BoogieIcfgContainer [2021-10-04 18:48:40,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-04 18:48:40,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-04 18:48:40,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-04 18:48:40,170 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-04 18:48:40,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.10 06:48:39" (1/3) ... [2021-10-04 18:48:40,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6302bed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 06:48:40, skipping insertion in model container [2021-10-04 18:48:40,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:48:39" (2/3) ... [2021-10-04 18:48:40,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6302bed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 06:48:40, skipping insertion in model container [2021-10-04 18:48:40,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 06:48:40" (3/3) ... [2021-10-04 18:48:40,173 INFO L111 eAbstractionObserver]: Analyzing ICFG ticket-3.wvr.c [2021-10-04 18:48:40,179 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-04 18:48:40,179 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-04 18:48:40,179 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-04 18:48:40,180 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-04 18:48:40,232 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,232 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,233 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,233 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,233 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,233 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,234 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,234 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,234 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,235 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,235 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,235 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,235 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,236 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,236 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,236 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,237 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,237 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,237 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,238 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,238 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,238 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,238 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,239 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,239 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,239 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,240 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,240 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,240 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,241 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,241 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,241 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,241 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,242 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,242 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,242 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,242 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,243 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,243 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,244 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,244 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,244 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,244 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,245 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,245 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,245 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,246 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,246 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,246 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,247 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,247 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,247 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,248 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,248 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,248 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,248 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,249 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,249 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,249 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,249 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,250 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,250 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,251 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,251 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,251 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,251 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,252 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,252 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,252 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,252 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,253 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,253 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,257 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,257 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,257 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,258 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,258 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,258 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,261 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,261 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,261 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,262 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,262 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,262 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,264 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,265 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,265 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,265 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,266 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,266 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:48:40,275 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-04 18:48:40,333 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-04 18:48:40,341 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-04 18:48:40,342 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-10-04 18:48:40,359 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-04 18:48:40,370 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 125 transitions, 274 flow [2021-10-04 18:48:40,374 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 125 transitions, 274 flow [2021-10-04 18:48:40,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 125 transitions, 274 flow [2021-10-04 18:48:40,447 INFO L129 PetriNetUnfolder]: 5/122 cut-off events. [2021-10-04 18:48:40,448 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-04 18:48:40,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 5/122 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2021-10-04 18:48:40,459 INFO L116 LiptonReduction]: Number of co-enabled transitions 2032 [2021-10-04 18:48:44,216 INFO L131 LiptonReduction]: Checked pairs total: 5807 [2021-10-04 18:48:44,217 INFO L133 LiptonReduction]: Total number of compositions: 104 [2021-10-04 18:48:44,226 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 34 transitions, 92 flow [2021-10-04 18:48:44,303 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 690 states, 689 states have (on average 3.0537010159651667) internal successors, (2104), 689 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 690 states, 689 states have (on average 3.0537010159651667) internal successors, (2104), 689 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:44,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-04 18:48:44,343 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:44,344 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:44,345 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:44,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:44,350 INFO L82 PathProgramCache]: Analyzing trace with hash 116229821, now seen corresponding path program 1 times [2021-10-04 18:48:44,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:44,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343703306] [2021-10-04 18:48:44,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:44,360 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:44,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:44,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343703306] [2021-10-04 18:48:44,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343703306] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:44,536 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:44,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-04 18:48:44,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155381068] [2021-10-04 18:48:44,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-04 18:48:44,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:44,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-04 18:48:44,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-04 18:48:44,566 INFO L87 Difference]: Start difference. First operand has 690 states, 689 states have (on average 3.0537010159651667) internal successors, (2104), 689 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:44,603 INFO L93 Difference]: Finished difference Result 690 states and 1994 transitions. [2021-10-04 18:48:44,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-04 18:48:44,605 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-10-04 18:48:44,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:44,640 INFO L225 Difference]: With dead ends: 690 [2021-10-04 18:48:44,640 INFO L226 Difference]: Without dead ends: 690 [2021-10-04 18:48:44,642 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-04 18:48:44,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-10-04 18:48:44,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2021-10-04 18:48:44,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 689 states have (on average 2.8940493468795356) internal successors, (1994), 689 states have internal predecessors, (1994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:44,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1994 transitions. [2021-10-04 18:48:44,785 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1994 transitions. Word has length 25 [2021-10-04 18:48:44,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:44,786 INFO L470 AbstractCegarLoop]: Abstraction has 690 states and 1994 transitions. [2021-10-04 18:48:44,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1994 transitions. [2021-10-04 18:48:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:44,792 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:44,792 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:44,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-04 18:48:44,793 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:44,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:44,794 INFO L82 PathProgramCache]: Analyzing trace with hash 702917772, now seen corresponding path program 1 times [2021-10-04 18:48:44,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:44,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603710098] [2021-10-04 18:48:44,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:44,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:45,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:45,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603710098] [2021-10-04 18:48:45,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603710098] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:45,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:45,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-04 18:48:45,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670861129] [2021-10-04 18:48:45,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-04 18:48:45,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:45,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-04 18:48:45,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-04 18:48:45,245 INFO L87 Difference]: Start difference. First operand 690 states and 1994 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:45,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:45,518 INFO L93 Difference]: Finished difference Result 1135 states and 3256 transitions. [2021-10-04 18:48:45,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-04 18:48:45,518 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:45,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:45,529 INFO L225 Difference]: With dead ends: 1135 [2021-10-04 18:48:45,529 INFO L226 Difference]: Without dead ends: 842 [2021-10-04 18:48:45,530 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 79.7ms TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:48:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2021-10-04 18:48:45,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 836. [2021-10-04 18:48:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 835 states have (on average 2.875449101796407) internal successors, (2401), 835 states have internal predecessors, (2401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 2401 transitions. [2021-10-04 18:48:45,569 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 2401 transitions. Word has length 29 [2021-10-04 18:48:45,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:45,570 INFO L470 AbstractCegarLoop]: Abstraction has 836 states and 2401 transitions. [2021-10-04 18:48:45,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:45,571 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 2401 transitions. [2021-10-04 18:48:45,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:45,576 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:45,576 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:45,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-04 18:48:45,578 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:45,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:45,581 INFO L82 PathProgramCache]: Analyzing trace with hash 909556812, now seen corresponding path program 2 times [2021-10-04 18:48:45,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:45,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227182239] [2021-10-04 18:48:45,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:45,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:45,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:45,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:45,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227182239] [2021-10-04 18:48:45,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227182239] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:45,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:45,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-04 18:48:45,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118618257] [2021-10-04 18:48:45,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-04 18:48:45,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:45,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-04 18:48:45,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:48:45,829 INFO L87 Difference]: Start difference. First operand 836 states and 2401 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:46,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:46,084 INFO L93 Difference]: Finished difference Result 884 states and 2490 transitions. [2021-10-04 18:48:46,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-04 18:48:46,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:46,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:46,096 INFO L225 Difference]: With dead ends: 884 [2021-10-04 18:48:46,096 INFO L226 Difference]: Without dead ends: 884 [2021-10-04 18:48:46,097 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 120.3ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:48:46,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2021-10-04 18:48:46,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 836. [2021-10-04 18:48:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 835 states have (on average 2.8095808383233534) internal successors, (2346), 835 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 2346 transitions. [2021-10-04 18:48:46,139 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 2346 transitions. Word has length 29 [2021-10-04 18:48:46,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:46,140 INFO L470 AbstractCegarLoop]: Abstraction has 836 states and 2346 transitions. [2021-10-04 18:48:46,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 2346 transitions. [2021-10-04 18:48:46,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:46,145 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:46,145 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:46,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-04 18:48:46,146 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:46,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:46,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1733412496, now seen corresponding path program 3 times [2021-10-04 18:48:46,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:46,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045392234] [2021-10-04 18:48:46,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:46,148 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:46,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:46,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:46,365 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045392234] [2021-10-04 18:48:46,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045392234] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:46,366 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:46,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:48:46,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906811808] [2021-10-04 18:48:46,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:48:46,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:46,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:48:46,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:48:46,368 INFO L87 Difference]: Start difference. First operand 836 states and 2346 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:46,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:46,640 INFO L93 Difference]: Finished difference Result 982 states and 2737 transitions. [2021-10-04 18:48:46,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-04 18:48:46,641 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:46,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:46,648 INFO L225 Difference]: With dead ends: 982 [2021-10-04 18:48:46,648 INFO L226 Difference]: Without dead ends: 908 [2021-10-04 18:48:46,649 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 135.6ms TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2021-10-04 18:48:46,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2021-10-04 18:48:46,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 860. [2021-10-04 18:48:46,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 859 states have (on average 2.80093131548312) internal successors, (2406), 859 states have internal predecessors, (2406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 2406 transitions. [2021-10-04 18:48:46,679 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 2406 transitions. Word has length 29 [2021-10-04 18:48:46,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:46,680 INFO L470 AbstractCegarLoop]: Abstraction has 860 states and 2406 transitions. [2021-10-04 18:48:46,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 2406 transitions. [2021-10-04 18:48:46,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:46,684 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:46,684 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:46,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-04 18:48:46,685 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:46,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:46,685 INFO L82 PathProgramCache]: Analyzing trace with hash 337470370, now seen corresponding path program 4 times [2021-10-04 18:48:46,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:46,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73696187] [2021-10-04 18:48:46,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:46,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:46,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:46,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73696187] [2021-10-04 18:48:46,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73696187] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:46,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:46,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:48:46,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312352235] [2021-10-04 18:48:46,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:48:46,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:46,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:48:46,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:48:46,810 INFO L87 Difference]: Start difference. First operand 860 states and 2406 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:47,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:47,212 INFO L93 Difference]: Finished difference Result 806 states and 1997 transitions. [2021-10-04 18:48:47,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-04 18:48:47,213 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:47,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:47,218 INFO L225 Difference]: With dead ends: 806 [2021-10-04 18:48:47,218 INFO L226 Difference]: Without dead ends: 686 [2021-10-04 18:48:47,218 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 173.8ms TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:48:47,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-10-04 18:48:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 646. [2021-10-04 18:48:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 645 states have (on average 2.510077519379845) internal successors, (1619), 645 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:47,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1619 transitions. [2021-10-04 18:48:47,239 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1619 transitions. Word has length 29 [2021-10-04 18:48:47,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:47,239 INFO L470 AbstractCegarLoop]: Abstraction has 646 states and 1619 transitions. [2021-10-04 18:48:47,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:47,240 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1619 transitions. [2021-10-04 18:48:47,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:47,242 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:47,243 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:47,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-04 18:48:47,243 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:47,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:47,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1980719474, now seen corresponding path program 5 times [2021-10-04 18:48:47,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:47,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164163498] [2021-10-04 18:48:47,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:47,244 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:47,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:47,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:47,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164163498] [2021-10-04 18:48:47,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164163498] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:47,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:47,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:48:47,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984078872] [2021-10-04 18:48:47,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:48:47,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:47,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:48:47,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:48:47,359 INFO L87 Difference]: Start difference. First operand 646 states and 1619 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:47,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:47,702 INFO L93 Difference]: Finished difference Result 794 states and 1910 transitions. [2021-10-04 18:48:47,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:48:47,704 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:47,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:47,712 INFO L225 Difference]: With dead ends: 794 [2021-10-04 18:48:47,712 INFO L226 Difference]: Without dead ends: 766 [2021-10-04 18:48:47,713 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 135.2ms TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-10-04 18:48:47,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2021-10-04 18:48:47,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 650. [2021-10-04 18:48:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 649 states have (on average 2.5038520801232664) internal successors, (1625), 649 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:47,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1625 transitions. [2021-10-04 18:48:47,740 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1625 transitions. Word has length 29 [2021-10-04 18:48:47,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:47,743 INFO L470 AbstractCegarLoop]: Abstraction has 650 states and 1625 transitions. [2021-10-04 18:48:47,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:47,743 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1625 transitions. [2021-10-04 18:48:47,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:47,746 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:47,746 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:47,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-04 18:48:47,747 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:47,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:47,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1901023074, now seen corresponding path program 6 times [2021-10-04 18:48:47,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:47,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386671226] [2021-10-04 18:48:47,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:47,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:47,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:47,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386671226] [2021-10-04 18:48:47,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386671226] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:47,900 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:47,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:48:47,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431006001] [2021-10-04 18:48:47,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:48:47,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:47,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:48:47,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:48:47,902 INFO L87 Difference]: Start difference. First operand 650 states and 1625 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:48,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:48,292 INFO L93 Difference]: Finished difference Result 762 states and 1851 transitions. [2021-10-04 18:48:48,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-04 18:48:48,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:48,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:48,298 INFO L225 Difference]: With dead ends: 762 [2021-10-04 18:48:48,298 INFO L226 Difference]: Without dead ends: 730 [2021-10-04 18:48:48,299 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 170.8ms TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:48:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2021-10-04 18:48:48,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 642. [2021-10-04 18:48:48,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 2.5070202808112323) internal successors, (1607), 641 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:48,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1607 transitions. [2021-10-04 18:48:48,321 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1607 transitions. Word has length 29 [2021-10-04 18:48:48,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:48,321 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 1607 transitions. [2021-10-04 18:48:48,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1607 transitions. [2021-10-04 18:48:48,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:48,324 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:48,324 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:48,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-04 18:48:48,324 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:48,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:48,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1466629378, now seen corresponding path program 7 times [2021-10-04 18:48:48,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:48,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623569521] [2021-10-04 18:48:48,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:48,326 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:48,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:48,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:48,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623569521] [2021-10-04 18:48:48,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623569521] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:48,425 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:48,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-04 18:48:48,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300265315] [2021-10-04 18:48:48,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-04 18:48:48,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:48,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-04 18:48:48,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:48:48,427 INFO L87 Difference]: Start difference. First operand 642 states and 1607 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:48,601 INFO L93 Difference]: Finished difference Result 758 states and 1846 transitions. [2021-10-04 18:48:48,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-04 18:48:48,602 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:48,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:48,607 INFO L225 Difference]: With dead ends: 758 [2021-10-04 18:48:48,607 INFO L226 Difference]: Without dead ends: 740 [2021-10-04 18:48:48,608 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 45.7ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-10-04 18:48:48,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-10-04 18:48:48,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 690. [2021-10-04 18:48:48,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 689 states have (on average 2.4876632801161103) internal successors, (1714), 689 states have internal predecessors, (1714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1714 transitions. [2021-10-04 18:48:48,629 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1714 transitions. Word has length 29 [2021-10-04 18:48:48,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:48,630 INFO L470 AbstractCegarLoop]: Abstraction has 690 states and 1714 transitions. [2021-10-04 18:48:48,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:48,630 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1714 transitions. [2021-10-04 18:48:48,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:48,633 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:48,633 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:48,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-04 18:48:48,633 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:48,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:48,634 INFO L82 PathProgramCache]: Analyzing trace with hash 556780146, now seen corresponding path program 8 times [2021-10-04 18:48:48,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:48,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772754919] [2021-10-04 18:48:48,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:48,635 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:48,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:48,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:48,794 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772754919] [2021-10-04 18:48:48,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772754919] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:48,795 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:48,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:48:48,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101813005] [2021-10-04 18:48:48,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:48:48,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:48,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:48:48,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:48:48,800 INFO L87 Difference]: Start difference. First operand 690 states and 1714 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:49,073 INFO L93 Difference]: Finished difference Result 818 states and 1960 transitions. [2021-10-04 18:48:49,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:48:49,073 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:49,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:49,079 INFO L225 Difference]: With dead ends: 818 [2021-10-04 18:48:49,079 INFO L226 Difference]: Without dead ends: 798 [2021-10-04 18:48:49,080 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 109.6ms TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-10-04 18:48:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2021-10-04 18:48:49,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 696. [2021-10-04 18:48:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 2.4805755395683455) internal successors, (1724), 695 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1724 transitions. [2021-10-04 18:48:49,125 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1724 transitions. Word has length 29 [2021-10-04 18:48:49,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:49,126 INFO L470 AbstractCegarLoop]: Abstraction has 696 states and 1724 transitions. [2021-10-04 18:48:49,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1724 transitions. [2021-10-04 18:48:49,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:49,129 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:49,129 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:49,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-04 18:48:49,130 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:49,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:49,131 INFO L82 PathProgramCache]: Analyzing trace with hash 801094206, now seen corresponding path program 9 times [2021-10-04 18:48:49,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:49,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005583800] [2021-10-04 18:48:49,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:49,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:49,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:49,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005583800] [2021-10-04 18:48:49,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005583800] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:49,244 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:49,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-04 18:48:49,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094112557] [2021-10-04 18:48:49,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-04 18:48:49,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:49,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-04 18:48:49,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:48:49,246 INFO L87 Difference]: Start difference. First operand 696 states and 1724 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:49,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:49,444 INFO L93 Difference]: Finished difference Result 802 states and 1940 transitions. [2021-10-04 18:48:49,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:48:49,444 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:49,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:49,450 INFO L225 Difference]: With dead ends: 802 [2021-10-04 18:48:49,450 INFO L226 Difference]: Without dead ends: 782 [2021-10-04 18:48:49,451 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 61.9ms TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:48:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2021-10-04 18:48:49,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 688. [2021-10-04 18:48:49,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 2.483260553129549) internal successors, (1706), 687 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:49,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1706 transitions. [2021-10-04 18:48:49,473 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1706 transitions. Word has length 29 [2021-10-04 18:48:49,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:49,473 INFO L470 AbstractCegarLoop]: Abstraction has 688 states and 1706 transitions. [2021-10-04 18:48:49,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1706 transitions. [2021-10-04 18:48:49,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:49,476 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:49,476 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:49,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-04 18:48:49,477 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:49,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:49,478 INFO L82 PathProgramCache]: Analyzing trace with hash 281905278, now seen corresponding path program 10 times [2021-10-04 18:48:49,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:49,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736291725] [2021-10-04 18:48:49,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:49,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:49,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:49,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:49,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736291725] [2021-10-04 18:48:49,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736291725] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:49,580 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:49,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:48:49,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934762794] [2021-10-04 18:48:49,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:48:49,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:49,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:48:49,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:48:49,582 INFO L87 Difference]: Start difference. First operand 688 states and 1706 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:49,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:49,781 INFO L93 Difference]: Finished difference Result 814 states and 1948 transitions. [2021-10-04 18:48:49,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:48:49,781 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:49,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:49,787 INFO L225 Difference]: With dead ends: 814 [2021-10-04 18:48:49,787 INFO L226 Difference]: Without dead ends: 802 [2021-10-04 18:48:49,788 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 73.9ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-10-04 18:48:49,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2021-10-04 18:48:49,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 688. [2021-10-04 18:48:49,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 2.480349344978166) internal successors, (1704), 687 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1704 transitions. [2021-10-04 18:48:49,811 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1704 transitions. Word has length 29 [2021-10-04 18:48:49,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:49,814 INFO L470 AbstractCegarLoop]: Abstraction has 688 states and 1704 transitions. [2021-10-04 18:48:49,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:49,815 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1704 transitions. [2021-10-04 18:48:49,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:49,817 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:49,817 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:49,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-04 18:48:49,817 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:49,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:49,818 INFO L82 PathProgramCache]: Analyzing trace with hash -42105182, now seen corresponding path program 11 times [2021-10-04 18:48:49,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:49,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297540629] [2021-10-04 18:48:49,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:49,819 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:49,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:49,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297540629] [2021-10-04 18:48:49,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297540629] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:49,930 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:49,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:48:49,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694611090] [2021-10-04 18:48:49,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:48:49,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:49,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:48:49,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:48:49,932 INFO L87 Difference]: Start difference. First operand 688 states and 1704 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:50,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:50,141 INFO L93 Difference]: Finished difference Result 808 states and 1933 transitions. [2021-10-04 18:48:50,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:48:50,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:50,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:50,147 INFO L225 Difference]: With dead ends: 808 [2021-10-04 18:48:50,148 INFO L226 Difference]: Without dead ends: 794 [2021-10-04 18:48:50,148 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 94.6ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-10-04 18:48:50,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2021-10-04 18:48:50,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 686. [2021-10-04 18:48:50,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 685 states have (on average 2.4802919708029196) internal successors, (1699), 685 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:50,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1699 transitions. [2021-10-04 18:48:50,172 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1699 transitions. Word has length 29 [2021-10-04 18:48:50,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:50,172 INFO L470 AbstractCegarLoop]: Abstraction has 686 states and 1699 transitions. [2021-10-04 18:48:50,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:50,172 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1699 transitions. [2021-10-04 18:48:50,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:50,175 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:50,175 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:50,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-04 18:48:50,175 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:50,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:50,176 INFO L82 PathProgramCache]: Analyzing trace with hash -734293454, now seen corresponding path program 12 times [2021-10-04 18:48:50,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:50,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796866271] [2021-10-04 18:48:50,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:50,176 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:50,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:50,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:50,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796866271] [2021-10-04 18:48:50,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796866271] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:50,278 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:50,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:48:50,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432472532] [2021-10-04 18:48:50,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:48:50,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:50,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:48:50,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:48:50,279 INFO L87 Difference]: Start difference. First operand 686 states and 1699 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:50,593 INFO L93 Difference]: Finished difference Result 834 states and 2007 transitions. [2021-10-04 18:48:50,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:48:50,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:50,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:50,600 INFO L225 Difference]: With dead ends: 834 [2021-10-04 18:48:50,600 INFO L226 Difference]: Without dead ends: 822 [2021-10-04 18:48:50,601 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 148.2ms TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:48:50,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2021-10-04 18:48:50,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 682. [2021-10-04 18:48:50,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 2.4801762114537445) internal successors, (1689), 681 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:50,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1689 transitions. [2021-10-04 18:48:50,624 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1689 transitions. Word has length 29 [2021-10-04 18:48:50,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:50,625 INFO L470 AbstractCegarLoop]: Abstraction has 682 states and 1689 transitions. [2021-10-04 18:48:50,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1689 transitions. [2021-10-04 18:48:50,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:50,628 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:50,628 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:50,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-04 18:48:50,628 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:50,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:50,629 INFO L82 PathProgramCache]: Analyzing trace with hash -813989854, now seen corresponding path program 13 times [2021-10-04 18:48:50,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:50,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529343674] [2021-10-04 18:48:50,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:50,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:50,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:50,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529343674] [2021-10-04 18:48:50,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529343674] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:50,730 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:50,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:48:50,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745637108] [2021-10-04 18:48:50,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:48:50,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:50,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:48:50,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:48:50,732 INFO L87 Difference]: Start difference. First operand 682 states and 1689 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:51,061 INFO L93 Difference]: Finished difference Result 774 states and 1903 transitions. [2021-10-04 18:48:51,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-04 18:48:51,061 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:51,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:51,067 INFO L225 Difference]: With dead ends: 774 [2021-10-04 18:48:51,067 INFO L226 Difference]: Without dead ends: 762 [2021-10-04 18:48:51,068 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 173.7ms TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:48:51,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2021-10-04 18:48:51,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 680. [2021-10-04 18:48:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 2.480117820324006) internal successors, (1684), 679 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:51,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1684 transitions. [2021-10-04 18:48:51,100 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1684 transitions. Word has length 29 [2021-10-04 18:48:51,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:51,101 INFO L470 AbstractCegarLoop]: Abstraction has 680 states and 1684 transitions. [2021-10-04 18:48:51,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:51,101 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1684 transitions. [2021-10-04 18:48:51,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:51,103 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:51,103 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:51,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-04 18:48:51,104 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:51,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:51,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1782273714, now seen corresponding path program 14 times [2021-10-04 18:48:51,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:51,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614032416] [2021-10-04 18:48:51,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:51,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:51,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:51,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614032416] [2021-10-04 18:48:51,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614032416] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:51,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:51,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:48:51,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919987712] [2021-10-04 18:48:51,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:48:51,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:51,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:48:51,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:48:51,213 INFO L87 Difference]: Start difference. First operand 680 states and 1684 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:51,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:51,456 INFO L93 Difference]: Finished difference Result 826 states and 1987 transitions. [2021-10-04 18:48:51,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-04 18:48:51,457 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:51,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:51,462 INFO L225 Difference]: With dead ends: 826 [2021-10-04 18:48:51,463 INFO L226 Difference]: Without dead ends: 814 [2021-10-04 18:48:51,463 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 121.0ms TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2021-10-04 18:48:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2021-10-04 18:48:51,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 674. [2021-10-04 18:48:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 673 states have (on average 2.4799405646359585) internal successors, (1669), 673 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:51,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1669 transitions. [2021-10-04 18:48:51,485 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1669 transitions. Word has length 29 [2021-10-04 18:48:51,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:51,486 INFO L470 AbstractCegarLoop]: Abstraction has 674 states and 1669 transitions. [2021-10-04 18:48:51,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1669 transitions. [2021-10-04 18:48:51,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:51,489 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:51,489 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:51,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-04 18:48:51,489 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:51,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:51,490 INFO L82 PathProgramCache]: Analyzing trace with hash 2026587774, now seen corresponding path program 15 times [2021-10-04 18:48:51,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:51,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55590095] [2021-10-04 18:48:51,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:51,491 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:51,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:51,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:51,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55590095] [2021-10-04 18:48:51,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55590095] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:51,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:51,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-04 18:48:51,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509602071] [2021-10-04 18:48:51,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-04 18:48:51,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:51,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-04 18:48:51,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:48:51,573 INFO L87 Difference]: Start difference. First operand 674 states and 1669 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:51,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:51,769 INFO L93 Difference]: Finished difference Result 750 states and 1853 transitions. [2021-10-04 18:48:51,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:48:51,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:51,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:51,774 INFO L225 Difference]: With dead ends: 750 [2021-10-04 18:48:51,774 INFO L226 Difference]: Without dead ends: 732 [2021-10-04 18:48:51,775 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 93.8ms TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-10-04 18:48:51,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2021-10-04 18:48:51,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 650. [2021-10-04 18:48:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 649 states have (on average 2.5069337442218798) internal successors, (1627), 649 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:51,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1627 transitions. [2021-10-04 18:48:51,795 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1627 transitions. Word has length 29 [2021-10-04 18:48:51,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:51,795 INFO L470 AbstractCegarLoop]: Abstraction has 650 states and 1627 transitions. [2021-10-04 18:48:51,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:51,796 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1627 transitions. [2021-10-04 18:48:51,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:51,798 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:51,798 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:51,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-04 18:48:51,799 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:51,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:51,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1013492074, now seen corresponding path program 16 times [2021-10-04 18:48:51,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:51,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607999212] [2021-10-04 18:48:51,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:51,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:51,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:51,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:51,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607999212] [2021-10-04 18:48:51,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607999212] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:51,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:51,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-04 18:48:51,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238691069] [2021-10-04 18:48:51,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-04 18:48:51,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:51,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-04 18:48:51,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-04 18:48:51,860 INFO L87 Difference]: Start difference. First operand 650 states and 1627 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:51,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:51,935 INFO L93 Difference]: Finished difference Result 582 states and 1429 transitions. [2021-10-04 18:48:51,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-04 18:48:51,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:51,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:51,939 INFO L225 Difference]: With dead ends: 582 [2021-10-04 18:48:51,939 INFO L226 Difference]: Without dead ends: 582 [2021-10-04 18:48:51,940 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.3ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:48:51,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-10-04 18:48:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 566. [2021-10-04 18:48:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 2.472566371681416) internal successors, (1397), 565 states have internal predecessors, (1397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1397 transitions. [2021-10-04 18:48:51,957 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 1397 transitions. Word has length 29 [2021-10-04 18:48:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:51,957 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 1397 transitions. [2021-10-04 18:48:51,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:51,958 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 1397 transitions. [2021-10-04 18:48:51,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:51,960 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:51,960 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:51,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-04 18:48:51,960 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:51,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:51,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1620431874, now seen corresponding path program 17 times [2021-10-04 18:48:51,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:51,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111126852] [2021-10-04 18:48:51,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:51,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:52,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:52,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111126852] [2021-10-04 18:48:52,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111126852] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:52,028 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:52,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-04 18:48:52,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300935622] [2021-10-04 18:48:52,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-04 18:48:52,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:52,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-04 18:48:52,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-04 18:48:52,030 INFO L87 Difference]: Start difference. First operand 566 states and 1397 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:52,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:52,112 INFO L93 Difference]: Finished difference Result 584 states and 1420 transitions. [2021-10-04 18:48:52,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-04 18:48:52,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:52,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:52,116 INFO L225 Difference]: With dead ends: 584 [2021-10-04 18:48:52,117 INFO L226 Difference]: Without dead ends: 550 [2021-10-04 18:48:52,117 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.7ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:48:52,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-10-04 18:48:52,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2021-10-04 18:48:52,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 2.4571948998178508) internal successors, (1349), 549 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1349 transitions. [2021-10-04 18:48:52,134 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1349 transitions. Word has length 29 [2021-10-04 18:48:52,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:52,135 INFO L470 AbstractCegarLoop]: Abstraction has 550 states and 1349 transitions. [2021-10-04 18:48:52,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:52,135 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1349 transitions. [2021-10-04 18:48:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:52,137 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:52,137 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:52,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-04 18:48:52,138 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:52,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:52,139 INFO L82 PathProgramCache]: Analyzing trace with hash -114895726, now seen corresponding path program 18 times [2021-10-04 18:48:52,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:52,146 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17413759] [2021-10-04 18:48:52,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:52,146 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:52,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:52,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17413759] [2021-10-04 18:48:52,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17413759] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:52,261 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:52,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:48:52,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051476756] [2021-10-04 18:48:52,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:48:52,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:52,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:48:52,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:48:52,263 INFO L87 Difference]: Start difference. First operand 550 states and 1349 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:52,402 INFO L93 Difference]: Finished difference Result 578 states and 1397 transitions. [2021-10-04 18:48:52,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-04 18:48:52,403 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:52,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:52,407 INFO L225 Difference]: With dead ends: 578 [2021-10-04 18:48:52,407 INFO L226 Difference]: Without dead ends: 568 [2021-10-04 18:48:52,408 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 82.5ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-10-04 18:48:52,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-10-04 18:48:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 566. [2021-10-04 18:48:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 2.4300884955752213) internal successors, (1373), 565 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1373 transitions. [2021-10-04 18:48:52,426 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 1373 transitions. Word has length 29 [2021-10-04 18:48:52,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:52,426 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 1373 transitions. [2021-10-04 18:48:52,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:52,426 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 1373 transitions. [2021-10-04 18:48:52,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:52,428 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:52,429 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:52,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-04 18:48:52,429 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:52,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:52,430 INFO L82 PathProgramCache]: Analyzing trace with hash 432794286, now seen corresponding path program 19 times [2021-10-04 18:48:52,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:52,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112701994] [2021-10-04 18:48:52,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:52,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:52,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:52,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:52,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112701994] [2021-10-04 18:48:52,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112701994] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:52,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:52,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-04 18:48:52,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838845986] [2021-10-04 18:48:52,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-04 18:48:52,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:52,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-04 18:48:52,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-04 18:48:52,539 INFO L87 Difference]: Start difference. First operand 566 states and 1373 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:52,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:52,582 INFO L93 Difference]: Finished difference Result 763 states and 1820 transitions. [2021-10-04 18:48:52,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-04 18:48:52,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:52,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:52,586 INFO L225 Difference]: With dead ends: 763 [2021-10-04 18:48:52,586 INFO L226 Difference]: Without dead ends: 492 [2021-10-04 18:48:52,586 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 24.9ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-04 18:48:52,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-10-04 18:48:52,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2021-10-04 18:48:52,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 2.378818737270876) internal successors, (1168), 491 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1168 transitions. [2021-10-04 18:48:52,600 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1168 transitions. Word has length 29 [2021-10-04 18:48:52,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:52,600 INFO L470 AbstractCegarLoop]: Abstraction has 492 states and 1168 transitions. [2021-10-04 18:48:52,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:52,600 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1168 transitions. [2021-10-04 18:48:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:52,602 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:52,602 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:52,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-04 18:48:52,603 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:52,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:52,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1810658408, now seen corresponding path program 20 times [2021-10-04 18:48:52,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:52,604 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100183223] [2021-10-04 18:48:52,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:52,604 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:52,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:52,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100183223] [2021-10-04 18:48:52,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100183223] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:52,713 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:52,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:48:52,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779108298] [2021-10-04 18:48:52,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:48:52,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:52,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:48:52,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:48:52,715 INFO L87 Difference]: Start difference. First operand 492 states and 1168 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:52,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:52,858 INFO L93 Difference]: Finished difference Result 548 states and 1280 transitions. [2021-10-04 18:48:52,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-04 18:48:52,859 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:52,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:52,863 INFO L225 Difference]: With dead ends: 548 [2021-10-04 18:48:52,863 INFO L226 Difference]: Without dead ends: 536 [2021-10-04 18:48:52,863 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 97.7ms TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-10-04 18:48:52,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2021-10-04 18:48:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 494. [2021-10-04 18:48:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 2.3752535496957403) internal successors, (1171), 493 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1171 transitions. [2021-10-04 18:48:52,878 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1171 transitions. Word has length 29 [2021-10-04 18:48:52,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:52,878 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 1171 transitions. [2021-10-04 18:48:52,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1171 transitions. [2021-10-04 18:48:52,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:52,881 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:52,881 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:52,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-04 18:48:52,881 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:52,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:52,882 INFO L82 PathProgramCache]: Analyzing trace with hash 545965728, now seen corresponding path program 21 times [2021-10-04 18:48:52,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:52,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33526390] [2021-10-04 18:48:52,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:52,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:52,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:52,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33526390] [2021-10-04 18:48:52,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33526390] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:52,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:52,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:48:52,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273869728] [2021-10-04 18:48:52,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:48:52,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:52,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:48:52,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:48:52,997 INFO L87 Difference]: Start difference. First operand 494 states and 1171 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:53,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:53,157 INFO L93 Difference]: Finished difference Result 510 states and 1198 transitions. [2021-10-04 18:48:53,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-04 18:48:53,157 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:53,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:53,161 INFO L225 Difference]: With dead ends: 510 [2021-10-04 18:48:53,161 INFO L226 Difference]: Without dead ends: 492 [2021-10-04 18:48:53,161 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 111.8ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-10-04 18:48:53,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-10-04 18:48:53,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 486. [2021-10-04 18:48:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 2.377319587628866) internal successors, (1153), 485 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1153 transitions. [2021-10-04 18:48:53,176 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1153 transitions. Word has length 29 [2021-10-04 18:48:53,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:53,176 INFO L470 AbstractCegarLoop]: Abstraction has 486 states and 1153 transitions. [2021-10-04 18:48:53,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1153 transitions. [2021-10-04 18:48:53,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:53,179 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:53,179 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:53,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-04 18:48:53,179 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:53,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:53,180 INFO L82 PathProgramCache]: Analyzing trace with hash 169194898, now seen corresponding path program 22 times [2021-10-04 18:48:53,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:53,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26748342] [2021-10-04 18:48:53,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:53,181 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:53,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:53,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26748342] [2021-10-04 18:48:53,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26748342] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:53,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:53,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:48:53,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306660344] [2021-10-04 18:48:53,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:48:53,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:53,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:48:53,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:48:53,294 INFO L87 Difference]: Start difference. First operand 486 states and 1153 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:53,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:53,436 INFO L93 Difference]: Finished difference Result 502 states and 1179 transitions. [2021-10-04 18:48:53,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-04 18:48:53,436 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:53,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:53,439 INFO L225 Difference]: With dead ends: 502 [2021-10-04 18:48:53,439 INFO L226 Difference]: Without dead ends: 482 [2021-10-04 18:48:53,440 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 89.2ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-10-04 18:48:53,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-10-04 18:48:53,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 480. [2021-10-04 18:48:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 2.375782881002088) internal successors, (1138), 479 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 1138 transitions. [2021-10-04 18:48:53,470 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 1138 transitions. Word has length 29 [2021-10-04 18:48:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:53,470 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 1138 transitions. [2021-10-04 18:48:53,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 1138 transitions. [2021-10-04 18:48:53,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:53,473 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:53,473 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:53,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-04 18:48:53,473 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:53,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:53,474 INFO L82 PathProgramCache]: Analyzing trace with hash 753148364, now seen corresponding path program 23 times [2021-10-04 18:48:53,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:53,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911410328] [2021-10-04 18:48:53,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:53,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:53,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:53,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:53,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911410328] [2021-10-04 18:48:53,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911410328] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:53,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:53,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:48:53,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542015431] [2021-10-04 18:48:53,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:48:53,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:53,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:48:53,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:48:53,604 INFO L87 Difference]: Start difference. First operand 480 states and 1138 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:53,809 INFO L93 Difference]: Finished difference Result 456 states and 1015 transitions. [2021-10-04 18:48:53,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:48:53,810 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:53,812 INFO L225 Difference]: With dead ends: 456 [2021-10-04 18:48:53,813 INFO L226 Difference]: Without dead ends: 376 [2021-10-04 18:48:53,813 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 92.9ms TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-10-04 18:48:53,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-10-04 18:48:53,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 340. [2021-10-04 18:48:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 2.28023598820059) internal successors, (773), 339 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:53,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 773 transitions. [2021-10-04 18:48:53,828 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 773 transitions. Word has length 29 [2021-10-04 18:48:53,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:53,829 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 773 transitions. [2021-10-04 18:48:53,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 773 transitions. [2021-10-04 18:48:53,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:53,831 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:53,832 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:53,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-04 18:48:53,832 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:53,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:53,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1412239072, now seen corresponding path program 24 times [2021-10-04 18:48:53,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:53,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975380276] [2021-10-04 18:48:53,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:53,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:53,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:53,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:53,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975380276] [2021-10-04 18:48:53,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975380276] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:53,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:53,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:48:53,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983694933] [2021-10-04 18:48:53,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:48:53,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:53,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:48:53,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:48:53,968 INFO L87 Difference]: Start difference. First operand 340 states and 773 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:54,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:54,113 INFO L93 Difference]: Finished difference Result 354 states and 796 transitions. [2021-10-04 18:48:54,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-04 18:48:54,114 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:54,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:54,116 INFO L225 Difference]: With dead ends: 354 [2021-10-04 18:48:54,116 INFO L226 Difference]: Without dead ends: 324 [2021-10-04 18:48:54,117 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 94.4ms TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-10-04 18:48:54,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-10-04 18:48:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2021-10-04 18:48:54,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 2.2755417956656347) internal successors, (735), 323 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 735 transitions. [2021-10-04 18:48:54,126 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 735 transitions. Word has length 29 [2021-10-04 18:48:54,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:54,126 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 735 transitions. [2021-10-04 18:48:54,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:54,126 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 735 transitions. [2021-10-04 18:48:54,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:54,128 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:54,128 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:54,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-04 18:48:54,128 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:54,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:54,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1561620626, now seen corresponding path program 25 times [2021-10-04 18:48:54,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:54,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161666918] [2021-10-04 18:48:54,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:54,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:54,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:54,222 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161666918] [2021-10-04 18:48:54,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161666918] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:54,222 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:54,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:48:54,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845269190] [2021-10-04 18:48:54,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:48:54,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:54,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:48:54,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:48:54,225 INFO L87 Difference]: Start difference. First operand 324 states and 735 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:54,370 INFO L93 Difference]: Finished difference Result 372 states and 830 transitions. [2021-10-04 18:48:54,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-04 18:48:54,371 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:54,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:54,374 INFO L225 Difference]: With dead ends: 372 [2021-10-04 18:48:54,374 INFO L226 Difference]: Without dead ends: 360 [2021-10-04 18:48:54,374 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 84.2ms TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-10-04 18:48:54,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-10-04 18:48:54,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 324. [2021-10-04 18:48:54,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 2.2693498452012384) internal successors, (733), 323 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 733 transitions. [2021-10-04 18:48:54,384 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 733 transitions. Word has length 29 [2021-10-04 18:48:54,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:54,385 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 733 transitions. [2021-10-04 18:48:54,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:54,385 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 733 transitions. [2021-10-04 18:48:54,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:54,386 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:54,387 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:54,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-04 18:48:54,387 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:54,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:54,388 INFO L82 PathProgramCache]: Analyzing trace with hash -660925870, now seen corresponding path program 26 times [2021-10-04 18:48:54,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:54,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670127143] [2021-10-04 18:48:54,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:54,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:54,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:54,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670127143] [2021-10-04 18:48:54,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670127143] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:54,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:54,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:48:54,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589743064] [2021-10-04 18:48:54,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:48:54,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:54,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:48:54,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:48:54,487 INFO L87 Difference]: Start difference. First operand 324 states and 733 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:54,660 INFO L93 Difference]: Finished difference Result 372 states and 828 transitions. [2021-10-04 18:48:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:48:54,660 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:54,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:54,663 INFO L225 Difference]: With dead ends: 372 [2021-10-04 18:48:54,663 INFO L226 Difference]: Without dead ends: 344 [2021-10-04 18:48:54,664 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 98.9ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-10-04 18:48:54,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-10-04 18:48:54,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 320. [2021-10-04 18:48:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 2.2633228840125392) internal successors, (722), 319 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:54,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 722 transitions. [2021-10-04 18:48:54,682 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 722 transitions. Word has length 29 [2021-10-04 18:48:54,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:54,682 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 722 transitions. [2021-10-04 18:48:54,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:54,683 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 722 transitions. [2021-10-04 18:48:54,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:54,683 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:54,684 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:54,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-04 18:48:54,684 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:54,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:54,684 INFO L82 PathProgramCache]: Analyzing trace with hash 30845594, now seen corresponding path program 27 times [2021-10-04 18:48:54,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:54,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355096603] [2021-10-04 18:48:54,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:54,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:54,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:54,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:54,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355096603] [2021-10-04 18:48:54,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355096603] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:54,794 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:54,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:48:54,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567342080] [2021-10-04 18:48:54,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:48:54,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:54,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:48:54,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:48:54,796 INFO L87 Difference]: Start difference. First operand 320 states and 722 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:54,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:54,948 INFO L93 Difference]: Finished difference Result 328 states and 734 transitions. [2021-10-04 18:48:54,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-04 18:48:54,949 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:54,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:54,951 INFO L225 Difference]: With dead ends: 328 [2021-10-04 18:48:54,951 INFO L226 Difference]: Without dead ends: 316 [2021-10-04 18:48:54,952 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 95.9ms TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-10-04 18:48:54,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-10-04 18:48:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2021-10-04 18:48:54,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 2.2603174603174603) internal successors, (712), 315 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:54,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 712 transitions. [2021-10-04 18:48:54,960 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 712 transitions. Word has length 29 [2021-10-04 18:48:54,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:54,961 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 712 transitions. [2021-10-04 18:48:54,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 712 transitions. [2021-10-04 18:48:54,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:54,963 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:54,963 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:54,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-04 18:48:54,964 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:54,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:54,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1233847086, now seen corresponding path program 28 times [2021-10-04 18:48:54,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:54,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476510549] [2021-10-04 18:48:54,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:54,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:55,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:55,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476510549] [2021-10-04 18:48:55,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476510549] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:55,062 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:55,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:48:55,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368885508] [2021-10-04 18:48:55,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:48:55,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:55,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:48:55,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:48:55,064 INFO L87 Difference]: Start difference. First operand 316 states and 712 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:55,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:55,224 INFO L93 Difference]: Finished difference Result 326 states and 727 transitions. [2021-10-04 18:48:55,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-04 18:48:55,225 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:55,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:55,226 INFO L225 Difference]: With dead ends: 326 [2021-10-04 18:48:55,227 INFO L226 Difference]: Without dead ends: 314 [2021-10-04 18:48:55,227 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 110.8ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-10-04 18:48:55,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-10-04 18:48:55,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2021-10-04 18:48:55,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 2.258785942492013) internal successors, (707), 313 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 707 transitions. [2021-10-04 18:48:55,243 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 707 transitions. Word has length 29 [2021-10-04 18:48:55,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:55,243 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 707 transitions. [2021-10-04 18:48:55,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 707 transitions. [2021-10-04 18:48:55,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:55,245 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:55,245 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:55,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-04 18:48:55,246 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:55,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:55,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1106294632, now seen corresponding path program 29 times [2021-10-04 18:48:55,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:55,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336351248] [2021-10-04 18:48:55,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:55,247 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:55,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:55,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336351248] [2021-10-04 18:48:55,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336351248] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:55,349 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:55,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:48:55,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42068923] [2021-10-04 18:48:55,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:48:55,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:55,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:48:55,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:48:55,352 INFO L87 Difference]: Start difference. First operand 314 states and 707 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:55,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:55,520 INFO L93 Difference]: Finished difference Result 326 states and 727 transitions. [2021-10-04 18:48:55,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:48:55,520 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:55,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:55,521 INFO L225 Difference]: With dead ends: 326 [2021-10-04 18:48:55,521 INFO L226 Difference]: Without dead ends: 302 [2021-10-04 18:48:55,522 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 106.5ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-04 18:48:55,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-10-04 18:48:55,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2021-10-04 18:48:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 2.259136212624585) internal successors, (680), 301 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 680 transitions. [2021-10-04 18:48:55,531 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 680 transitions. Word has length 29 [2021-10-04 18:48:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:55,532 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 680 transitions. [2021-10-04 18:48:55,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 680 transitions. [2021-10-04 18:48:55,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:55,534 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:55,534 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:55,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-04 18:48:55,535 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:55,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:55,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1059092804, now seen corresponding path program 30 times [2021-10-04 18:48:55,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:55,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360140134] [2021-10-04 18:48:55,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:55,537 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:55,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:55,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:55,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360140134] [2021-10-04 18:48:55,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360140134] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:55,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:55,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:48:55,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104995245] [2021-10-04 18:48:55,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:48:55,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:55,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:48:55,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:48:55,634 INFO L87 Difference]: Start difference. First operand 302 states and 680 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:55,785 INFO L93 Difference]: Finished difference Result 284 states and 639 transitions. [2021-10-04 18:48:55,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-04 18:48:55,785 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:55,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:55,786 INFO L225 Difference]: With dead ends: 284 [2021-10-04 18:48:55,786 INFO L226 Difference]: Without dead ends: 250 [2021-10-04 18:48:55,787 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 97.2ms TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-10-04 18:48:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-10-04 18:48:55,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2021-10-04 18:48:55,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 2.325301204819277) internal successors, (579), 249 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 579 transitions. [2021-10-04 18:48:55,796 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 579 transitions. Word has length 29 [2021-10-04 18:48:55,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:55,796 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 579 transitions. [2021-10-04 18:48:55,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:55,797 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 579 transitions. [2021-10-04 18:48:55,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-04 18:48:55,798 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:48:55,798 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:48:55,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-04 18:48:55,799 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:48:55,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:48:55,800 INFO L82 PathProgramCache]: Analyzing trace with hash 213690724, now seen corresponding path program 31 times [2021-10-04 18:48:55,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:48:55,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849721025] [2021-10-04 18:48:55,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:48:55,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:48:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:48:55,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:48:55,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:48:55,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849721025] [2021-10-04 18:48:55,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849721025] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:48:55,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:48:55,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-04 18:48:55,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067312947] [2021-10-04 18:48:55,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:48:55,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:48:55,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:48:55,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:48:55,959 INFO L87 Difference]: Start difference. First operand 250 states and 579 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:56,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:48:56,076 INFO L93 Difference]: Finished difference Result 249 states and 578 transitions. [2021-10-04 18:48:56,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-04 18:48:56,077 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-04 18:48:56,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:48:56,077 INFO L225 Difference]: With dead ends: 249 [2021-10-04 18:48:56,077 INFO L226 Difference]: Without dead ends: 0 [2021-10-04 18:48:56,078 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 103.3ms TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-10-04 18:48:56,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-04 18:48:56,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-04 18:48:56,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-04 18:48:56,078 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2021-10-04 18:48:56,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:48:56,078 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-04 18:48:56,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:48:56,079 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-04 18:48:56,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-04 18:48:56,083 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-04 18:48:56,083 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-04 18:48:56,083 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-04 18:48:56,084 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-04 18:48:56,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-04 18:48:56,088 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-04 18:48:56,088 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-04 18:48:56,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 06:48:56 BasicIcfg [2021-10-04 18:48:56,091 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-04 18:48:56,092 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-04 18:48:56,092 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-04 18:48:56,093 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-04 18:48:56,093 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 06:48:40" (3/4) ... [2021-10-04 18:48:56,097 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-04 18:48:56,105 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-10-04 18:48:56,105 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-10-04 18:48:56,105 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-10-04 18:48:56,113 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2021-10-04 18:48:56,113 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-04 18:48:56,113 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-04 18:48:56,166 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-04 18:48:56,166 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-04 18:48:56,168 INFO L168 Benchmark]: Toolchain (without parser) took 17056.18 ms. Allocated memory was 52.4 MB in the beginning and 134.2 MB in the end (delta: 81.8 MB). Free memory was 28.5 MB in the beginning and 37.3 MB in the end (delta: -8.9 MB). Peak memory consumption was 76.0 MB. Max. memory is 16.1 GB. [2021-10-04 18:48:56,169 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 52.4 MB. Free memory was 35.1 MB in the beginning and 35.1 MB in the end (delta: 36.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-04 18:48:56,170 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.85 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 28.2 MB in the beginning and 42.1 MB in the end (delta: -13.8 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2021-10-04 18:48:56,170 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.42 ms. Allocated memory is still 62.9 MB. Free memory was 41.9 MB in the beginning and 40.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-04 18:48:56,171 INFO L168 Benchmark]: Boogie Preprocessor took 49.66 ms. Allocated memory is still 62.9 MB. Free memory was 40.0 MB in the beginning and 39.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-04 18:48:56,171 INFO L168 Benchmark]: RCFGBuilder took 632.42 ms. Allocated memory is still 62.9 MB. Free memory was 38.8 MB in the beginning and 39.5 MB in the end (delta: -684.9 kB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-04 18:48:56,171 INFO L168 Benchmark]: TraceAbstraction took 15923.71 ms. Allocated memory was 62.9 MB in the beginning and 134.2 MB in the end (delta: 71.3 MB). Free memory was 39.0 MB in the beginning and 39.4 MB in the end (delta: -401.9 kB). Peak memory consumption was 70.5 MB. Max. memory is 16.1 GB. [2021-10-04 18:48:56,172 INFO L168 Benchmark]: Witness Printer took 74.06 ms. Allocated memory is still 134.2 MB. Free memory was 39.4 MB in the beginning and 37.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-04 18:48:56,174 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.20 ms. Allocated memory is still 52.4 MB. Free memory was 35.1 MB in the beginning and 35.1 MB in the end (delta: 36.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 312.85 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 28.2 MB in the beginning and 42.1 MB in the end (delta: -13.8 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.42 ms. Allocated memory is still 62.9 MB. Free memory was 41.9 MB in the beginning and 40.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.66 ms. Allocated memory is still 62.9 MB. Free memory was 40.0 MB in the beginning and 39.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 632.42 ms. Allocated memory is still 62.9 MB. Free memory was 38.8 MB in the beginning and 39.5 MB in the end (delta: -684.9 kB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15923.71 ms. Allocated memory was 62.9 MB in the beginning and 134.2 MB in the end (delta: 71.3 MB). Free memory was 39.0 MB in the beginning and 39.4 MB in the end (delta: -401.9 kB). Peak memory consumption was 70.5 MB. Max. memory is 16.1 GB. * Witness Printer took 74.06 ms. Allocated memory is still 134.2 MB. Free memory was 39.4 MB in the beginning and 37.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3843.3ms, 130 PlacesBefore, 43 PlacesAfterwards, 125 TransitionsBefore, 34 TransitionsAfterwards, 2032 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 5 ConcurrentYvCompositions, 4 ChoiceCompositions, 104 TotalNumberOfCompositions, 5807 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2801, positive: 2603, positive conditional: 0, positive unconditional: 2603, negative: 198, negative conditional: 0, negative unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1443, positive: 1389, positive conditional: 0, positive unconditional: 1389, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1443, positive: 1374, positive conditional: 0, positive unconditional: 1374, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 69, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 105, negative conditional: 0, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2801, positive: 1214, positive conditional: 0, positive unconditional: 1214, negative: 144, negative conditional: 0, negative unconditional: 144, unknown: 1443, unknown conditional: 0, unknown unconditional: 1443] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 147, Positive conditional cache size: 0, Positive unconditional cache size: 147, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 83]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 164 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 15756.3ms, OverallIterations: 32, TraceHistogramMax: 1, EmptinessCheckTime: 109.0ms, AutomataDifference: 6579.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3961.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1521 SDtfs, 2045 SDslu, 6360 SDs, 0 SdLazy, 6039 SolverSat, 404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3089.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 396 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 3094.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=860occurred in iteration=4, InterpolantAutomatonStates: 383, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 754.1ms AutomataMinimizationTime, 32 MinimizatonAttempts, 1422 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 82.0ms SsaConstructionTime, 1034.0ms SatisfiabilityAnalysisTime, 2792.1ms InterpolantComputationTime, 924 NumberOfCodeBlocks, 924 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 892 ConstructedInterpolants, 0 QuantifiedInterpolants, 3869 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-04 18:48:56,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...