./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/singleton.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 96f16385 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/singleton.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 692248c827814d69f794d70185d48fd053222a0c .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-96f1638 [2020-12-02 11:42:48,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 11:42:48,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 11:42:48,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 11:42:48,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 11:42:48,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 11:42:48,448 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 11:42:48,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 11:42:48,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 11:42:48,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 11:42:48,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 11:42:48,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 11:42:48,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 11:42:48,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 11:42:48,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 11:42:48,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 11:42:48,466 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 11:42:48,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 11:42:48,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 11:42:48,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 11:42:48,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 11:42:48,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 11:42:48,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 11:42:48,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 11:42:48,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 11:42:48,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 11:42:48,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 11:42:48,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 11:42:48,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 11:42:48,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 11:42:48,489 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 11:42:48,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 11:42:48,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 11:42:48,493 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 11:42:48,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 11:42:48,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 11:42:48,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 11:42:48,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 11:42:48,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 11:42:48,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 11:42:48,499 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 11:42:48,500 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 11:42:48,535 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 11:42:48,535 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 11:42:48,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 11:42:48,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 11:42:48,539 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 11:42:48,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 11:42:48,540 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 11:42:48,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 11:42:48,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 11:42:48,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 11:42:48,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 11:42:48,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 11:42:48,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 11:42:48,542 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 11:42:48,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 11:42:48,543 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 11:42:48,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 11:42:48,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 11:42:48,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 11:42:48,544 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 11:42:48,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 11:42:48,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 11:42:48,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 11:42:48,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 11:42:48,546 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 11:42:48,546 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 11:42:48,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 11:42:48,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 11:42:48,547 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 11:42:48,547 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/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/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 -> 692248c827814d69f794d70185d48fd053222a0c [2020-12-02 11:42:48,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 11:42:48,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 11:42:48,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 11:42:48,958 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 11:42:48,959 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 11:42:48,960 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/singleton.i [2020-12-02 11:42:49,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/753080524/76a91479e83847d49d303140fd20f936/FLAGc1f5d2556 [2020-12-02 11:42:49,874 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 11:42:49,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i [2020-12-02 11:42:49,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/753080524/76a91479e83847d49d303140fd20f936/FLAGc1f5d2556 [2020-12-02 11:42:50,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/753080524/76a91479e83847d49d303140fd20f936 [2020-12-02 11:42:50,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 11:42:50,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 11:42:50,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 11:42:50,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 11:42:50,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 11:42:50,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:42:50" (1/1) ... [2020-12-02 11:42:50,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b4160b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:50, skipping insertion in model container [2020-12-02 11:42:50,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:42:50" (1/1) ... [2020-12-02 11:42:50,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 11:42:50,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-02 11:42:50,432 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-12-02 11:42:50,779 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i[55547,55560] [2020-12-02 11:42:50,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 11:42:50,808 INFO L203 MainTranslator]: Completed pre-run [2020-12-02 11:42:50,828 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-12-02 11:42:50,850 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i[55547,55560] [2020-12-02 11:42:50,858 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 11:42:51,085 INFO L208 MainTranslator]: Completed translation [2020-12-02 11:42:51,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:51 WrapperNode [2020-12-02 11:42:51,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 11:42:51,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 11:42:51,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 11:42:51,089 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 11:42:51,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:51" (1/1) ... [2020-12-02 11:42:51,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:51" (1/1) ... [2020-12-02 11:42:51,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 11:42:51,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 11:42:51,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 11:42:51,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 11:42:51,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:51" (1/1) ... [2020-12-02 11:42:51,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:51" (1/1) ... [2020-12-02 11:42:51,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:51" (1/1) ... [2020-12-02 11:42:51,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:51" (1/1) ... [2020-12-02 11:42:51,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:51" (1/1) ... [2020-12-02 11:42:51,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:51" (1/1) ... [2020-12-02 11:42:51,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:51" (1/1) ... [2020-12-02 11:42:51,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 11:42:51,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 11:42:51,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 11:42:51,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 11:42:51,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 11:42:51,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-02 11:42:51,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 11:42:51,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 11:42:51,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-02 11:42:51,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-02 11:42:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-12-02 11:42:51,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-12-02 11:42:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-12-02 11:42:51,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-12-02 11:42:51,377 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-12-02 11:42:51,377 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-12-02 11:42:51,378 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-12-02 11:42:51,378 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-12-02 11:42:51,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-02 11:42:51,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-02 11:42:51,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 11:42:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 11:42:51,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 11:42:51,385 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-02 11:42:51,925 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 11:42:51,926 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-12-02 11:42:51,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:42:51 BoogieIcfgContainer [2020-12-02 11:42:51,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 11:42:51,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 11:42:51,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 11:42:51,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 11:42:51,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:42:50" (1/3) ... [2020-12-02 11:42:51,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693fd418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:42:51, skipping insertion in model container [2020-12-02 11:42:51,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:51" (2/3) ... [2020-12-02 11:42:51,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693fd418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:42:51, skipping insertion in model container [2020-12-02 11:42:51,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:42:51" (3/3) ... [2020-12-02 11:42:51,938 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-12-02 11:42:51,955 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-02 11:42:51,956 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 11:42:51,961 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-02 11:42:51,962 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-02 11:42:52,004 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,005 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,005 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,006 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,006 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,006 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,006 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,007 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,007 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,007 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,008 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,008 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,008 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,009 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,009 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,009 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,010 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,010 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,011 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,011 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,011 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,011 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,012 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,012 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,013 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,013 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,013 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,013 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,014 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,014 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,015 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,015 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,015 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,016 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,016 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,016 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,016 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,017 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,017 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,017 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,018 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,018 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,019 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,019 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,019 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,020 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,020 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,020 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,021 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,021 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,021 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,021 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,022 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,022 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,023 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,023 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,023 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,024 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,024 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,024 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,024 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,025 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,025 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,025 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,026 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,026 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,026 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,027 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,027 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,027 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,027 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,028 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,028 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,028 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,029 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,029 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,029 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,030 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,030 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,030 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,031 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,031 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,031 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,031 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,032 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,032 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,032 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,032 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,033 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,033 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,033 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,034 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,034 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,034 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,035 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,035 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,035 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,035 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,036 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,036 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,036 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,036 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,037 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,051 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,051 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,051 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,052 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,052 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,052 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,052 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,053 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,053 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,053 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,053 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,054 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,054 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,054 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,055 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,055 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,055 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,055 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,056 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,056 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,056 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,056 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,057 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,057 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,057 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,058 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,058 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,058 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,058 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,059 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,059 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,059 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,059 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,060 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,060 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,060 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,060 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,061 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,061 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,062 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,062 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,062 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,062 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,063 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,063 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,063 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,064 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,064 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,064 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,065 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,065 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,065 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,066 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,066 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,066 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,066 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,067 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,067 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,067 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,068 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,068 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,068 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,069 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,069 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,069 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,069 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,070 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,070 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,070 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,070 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,071 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,071 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,071 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,072 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,072 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,072 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,072 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,073 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,073 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,073 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,073 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,074 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,074 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,074 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,074 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,075 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,075 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,075 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,076 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,076 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,076 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,076 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,077 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,077 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,077 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,078 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,078 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,080 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,081 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,081 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,082 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,087 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,088 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,088 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,088 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,090 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,091 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,091 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,092 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,094 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,094 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,094 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,095 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,095 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,095 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,097 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,099 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,099 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,099 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,099 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,100 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,100 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,100 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,100 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,101 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,101 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,101 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,101 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,102 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,102 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,102 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,102 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,103 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,103 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,103 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,103 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,106 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,106 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,107 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,107 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,109 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,109 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,109 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,110 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,110 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,110 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,112 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,113 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,113 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,113 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,115 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,115 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,115 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,116 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,118 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,118 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,119 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,119 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,121 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,121 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,121 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,122 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:42:52,245 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2020-12-02 11:42:52,260 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-12-02 11:42:52,286 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 11:42:52,287 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 11:42:52,287 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 11:42:52,287 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 11:42:52,287 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 11:42:52,288 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 11:42:52,288 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 11:42:52,288 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 11:42:52,308 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-02 11:42:52,311 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 248 transitions, 876 flow [2020-12-02 11:42:52,315 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 248 transitions, 876 flow [2020-12-02 11:42:52,317 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 248 transitions, 876 flow [2020-12-02 11:42:52,472 INFO L129 PetriNetUnfolder]: 61/274 cut-off events. [2020-12-02 11:42:52,473 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-12-02 11:42:52,498 INFO L84 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 274 events. 61/274 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 804 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 330. Up to 24 conditions per place. [2020-12-02 11:42:52,515 INFO L116 LiptonReduction]: Number of co-enabled transitions 4156 [2020-12-02 11:42:55,299 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-12-02 11:42:55,506 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-12-02 11:42:55,617 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-12-02 11:42:55,983 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-12-02 11:42:56,188 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-12-02 11:42:56,358 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-02 11:42:56,467 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-02 11:42:56,594 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-02 11:42:56,711 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-02 11:42:56,980 INFO L131 LiptonReduction]: Checked pairs total: 49018 [2020-12-02 11:42:56,980 INFO L133 LiptonReduction]: Total number of compositions: 81 [2020-12-02 11:42:56,988 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 173 transitions, 726 flow [2020-12-02 11:42:57,601 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2020-12-02 11:42:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2020-12-02 11:42:57,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-02 11:42:57,612 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:42:57,613 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:42:57,613 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:42:57,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:42:57,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1391244601, now seen corresponding path program 1 times [2020-12-02 11:42:57,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:42:57,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572825125] [2020-12-02 11:42:57,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:42:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:42:57,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:42:57,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572825125] [2020-12-02 11:42:57,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:42:57,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 11:42:57,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681945030] [2020-12-02 11:42:57,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:42:57,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:42:58,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:42:58,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:42:58,026 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2020-12-02 11:42:58,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:42:58,442 INFO L93 Difference]: Finished difference Result 6012 states and 25679 transitions. [2020-12-02 11:42:58,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 11:42:58,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-02 11:42:58,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:42:58,529 INFO L225 Difference]: With dead ends: 6012 [2020-12-02 11:42:58,530 INFO L226 Difference]: Without dead ends: 5524 [2020-12-02 11:42:58,531 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-02 11:42:58,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2020-12-02 11:42:58,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 3018. [2020-12-02 11:42:58,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-12-02 11:42:58,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2020-12-02 11:42:58,880 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2020-12-02 11:42:58,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:42:58,881 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2020-12-02 11:42:58,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:42:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2020-12-02 11:42:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-02 11:42:58,882 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:42:58,883 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:42:58,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 11:42:58,883 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:42:58,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:42:58,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1473766845, now seen corresponding path program 2 times [2020-12-02 11:42:58,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:42:58,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307553745] [2020-12-02 11:42:58,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:42:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:42:58,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:42:58,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307553745] [2020-12-02 11:42:58,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:42:58,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 11:42:58,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131437724] [2020-12-02 11:42:58,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:42:58,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:42:58,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:42:58,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:42:58,978 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2020-12-02 11:42:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:42:59,202 INFO L93 Difference]: Finished difference Result 4266 states and 18042 transitions. [2020-12-02 11:42:59,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 11:42:59,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-02 11:42:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:42:59,248 INFO L225 Difference]: With dead ends: 4266 [2020-12-02 11:42:59,249 INFO L226 Difference]: Without dead ends: 4266 [2020-12-02 11:42:59,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 11:42:59,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4266 states. [2020-12-02 11:42:59,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4266 to 3008. [2020-12-02 11:42:59,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2020-12-02 11:42:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2020-12-02 11:42:59,537 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2020-12-02 11:42:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:42:59,537 INFO L481 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2020-12-02 11:42:59,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:42:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2020-12-02 11:42:59,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 11:42:59,540 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:42:59,540 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:42:59,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-02 11:42:59,541 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:42:59,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:42:59,552 INFO L82 PathProgramCache]: Analyzing trace with hash -658761216, now seen corresponding path program 1 times [2020-12-02 11:42:59,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:42:59,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261372019] [2020-12-02 11:42:59,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:42:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:42:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:42:59,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261372019] [2020-12-02 11:42:59,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:42:59,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 11:42:59,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723891531] [2020-12-02 11:42:59,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 11:42:59,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:42:59,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 11:42:59,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:42:59,684 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2020-12-02 11:42:59,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:42:59,764 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2020-12-02 11:42:59,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 11:42:59,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-12-02 11:42:59,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:42:59,797 INFO L225 Difference]: With dead ends: 4848 [2020-12-02 11:42:59,797 INFO L226 Difference]: Without dead ends: 3558 [2020-12-02 11:42:59,797 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:42:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2020-12-02 11:43:00,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2020-12-02 11:43:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2020-12-02 11:43:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2020-12-02 11:43:00,018 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2020-12-02 11:43:00,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:00,018 INFO L481 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2020-12-02 11:43:00,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 11:43:00,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2020-12-02 11:43:00,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 11:43:00,023 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:00,023 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:00,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-02 11:43:00,024 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:00,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:00,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1053238145, now seen corresponding path program 1 times [2020-12-02 11:43:00,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:00,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557495996] [2020-12-02 11:43:00,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:00,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557495996] [2020-12-02 11:43:00,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:00,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 11:43:00,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696737637] [2020-12-02 11:43:00,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:43:00,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:00,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:43:00,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:43:00,155 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 6 states. [2020-12-02 11:43:00,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:00,425 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2020-12-02 11:43:00,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 11:43:00,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-02 11:43:00,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:00,454 INFO L225 Difference]: With dead ends: 4417 [2020-12-02 11:43:00,455 INFO L226 Difference]: Without dead ends: 4393 [2020-12-02 11:43:00,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-02 11:43:00,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2020-12-02 11:43:00,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2020-12-02 11:43:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2020-12-02 11:43:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2020-12-02 11:43:00,661 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2020-12-02 11:43:00,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:00,662 INFO L481 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2020-12-02 11:43:00,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:43:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2020-12-02 11:43:00,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 11:43:00,669 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:00,669 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:00,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-02 11:43:00,670 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:00,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:00,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1471262403, now seen corresponding path program 2 times [2020-12-02 11:43:00,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:00,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287560488] [2020-12-02 11:43:00,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:00,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:00,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287560488] [2020-12-02 11:43:00,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:00,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 11:43:00,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329631128] [2020-12-02 11:43:00,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:43:00,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:00,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:43:00,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:43:00,790 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2020-12-02 11:43:00,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:00,919 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2020-12-02 11:43:00,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:43:00,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-02 11:43:00,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:00,942 INFO L225 Difference]: With dead ends: 4024 [2020-12-02 11:43:00,942 INFO L226 Difference]: Without dead ends: 4024 [2020-12-02 11:43:00,943 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 11:43:00,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2020-12-02 11:43:01,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2020-12-02 11:43:01,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2020-12-02 11:43:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2020-12-02 11:43:01,193 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2020-12-02 11:43:01,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:01,194 INFO L481 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2020-12-02 11:43:01,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:43:01,194 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2020-12-02 11:43:01,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 11:43:01,197 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:01,197 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:01,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-02 11:43:01,198 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:01,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:01,199 INFO L82 PathProgramCache]: Analyzing trace with hash -564581282, now seen corresponding path program 1 times [2020-12-02 11:43:01,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:01,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300257419] [2020-12-02 11:43:01,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:01,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300257419] [2020-12-02 11:43:01,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:01,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 11:43:01,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422531225] [2020-12-02 11:43:01,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:43:01,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:01,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:43:01,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:43:01,280 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 6 states. [2020-12-02 11:43:01,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:01,490 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2020-12-02 11:43:01,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 11:43:01,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-02 11:43:01,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:01,510 INFO L225 Difference]: With dead ends: 4225 [2020-12-02 11:43:01,511 INFO L226 Difference]: Without dead ends: 4129 [2020-12-02 11:43:01,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-02 11:43:01,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2020-12-02 11:43:01,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2020-12-02 11:43:01,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2020-12-02 11:43:01,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2020-12-02 11:43:01,643 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2020-12-02 11:43:01,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:01,707 INFO L481 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2020-12-02 11:43:01,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:43:01,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2020-12-02 11:43:01,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 11:43:01,708 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:01,708 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:01,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-02 11:43:01,709 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:01,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:01,709 INFO L82 PathProgramCache]: Analyzing trace with hash -490731172, now seen corresponding path program 2 times [2020-12-02 11:43:01,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:01,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693781439] [2020-12-02 11:43:01,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:01,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693781439] [2020-12-02 11:43:01,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:01,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 11:43:01,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194744563] [2020-12-02 11:43:01,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 11:43:01,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:01,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 11:43:01,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-02 11:43:01,813 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 8 states. [2020-12-02 11:43:02,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:02,195 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2020-12-02 11:43:02,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-02 11:43:02,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-12-02 11:43:02,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:02,221 INFO L225 Difference]: With dead ends: 4979 [2020-12-02 11:43:02,221 INFO L226 Difference]: Without dead ends: 4905 [2020-12-02 11:43:02,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-02 11:43:02,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2020-12-02 11:43:02,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2020-12-02 11:43:02,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-12-02 11:43:02,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2020-12-02 11:43:02,447 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2020-12-02 11:43:02,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:02,448 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2020-12-02 11:43:02,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 11:43:02,448 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2020-12-02 11:43:02,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 11:43:02,450 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:02,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:02,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-02 11:43:02,450 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:02,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:02,451 INFO L82 PathProgramCache]: Analyzing trace with hash 991975414, now seen corresponding path program 3 times [2020-12-02 11:43:02,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:02,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070356808] [2020-12-02 11:43:02,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:02,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070356808] [2020-12-02 11:43:02,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:02,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 11:43:02,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363116268] [2020-12-02 11:43:02,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 11:43:02,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:02,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 11:43:02,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-02 11:43:02,601 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 9 states. [2020-12-02 11:43:03,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:03,054 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2020-12-02 11:43:03,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 11:43:03,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-12-02 11:43:03,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:03,087 INFO L225 Difference]: With dead ends: 6735 [2020-12-02 11:43:03,087 INFO L226 Difference]: Without dead ends: 6661 [2020-12-02 11:43:03,088 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-12-02 11:43:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2020-12-02 11:43:03,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2020-12-02 11:43:03,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2020-12-02 11:43:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2020-12-02 11:43:03,298 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2020-12-02 11:43:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:03,299 INFO L481 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2020-12-02 11:43:03,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 11:43:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2020-12-02 11:43:03,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 11:43:03,302 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:03,302 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:03,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-02 11:43:03,302 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:03,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:03,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1869283970, now seen corresponding path program 4 times [2020-12-02 11:43:03,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:03,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884783555] [2020-12-02 11:43:03,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:03,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:03,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884783555] [2020-12-02 11:43:03,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:03,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 11:43:03,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649669319] [2020-12-02 11:43:03,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 11:43:03,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:03,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 11:43:03,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-02 11:43:03,458 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 9 states. [2020-12-02 11:43:03,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:03,836 INFO L93 Difference]: Finished difference Result 5385 states and 21914 transitions. [2020-12-02 11:43:03,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 11:43:03,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-12-02 11:43:03,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:03,907 INFO L225 Difference]: With dead ends: 5385 [2020-12-02 11:43:03,908 INFO L226 Difference]: Without dead ends: 5311 [2020-12-02 11:43:03,908 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-12-02 11:43:03,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2020-12-02 11:43:04,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4125. [2020-12-02 11:43:04,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4125 states. [2020-12-02 11:43:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 16604 transitions. [2020-12-02 11:43:04,047 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 16604 transitions. Word has length 18 [2020-12-02 11:43:04,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:04,048 INFO L481 AbstractCegarLoop]: Abstraction has 4125 states and 16604 transitions. [2020-12-02 11:43:04,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 11:43:04,048 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 16604 transitions. [2020-12-02 11:43:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 11:43:04,050 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:04,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:04,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-02 11:43:04,051 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:04,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:04,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1339896726, now seen corresponding path program 5 times [2020-12-02 11:43:04,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:04,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829649802] [2020-12-02 11:43:04,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:04,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:04,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829649802] [2020-12-02 11:43:04,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:04,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 11:43:04,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108515355] [2020-12-02 11:43:04,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 11:43:04,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:04,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 11:43:04,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-02 11:43:04,252 INFO L87 Difference]: Start difference. First operand 4125 states and 16604 transitions. Second operand 11 states. [2020-12-02 11:43:04,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:04,977 INFO L93 Difference]: Finished difference Result 5686 states and 23415 transitions. [2020-12-02 11:43:04,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-02 11:43:04,978 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-12-02 11:43:04,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:05,001 INFO L225 Difference]: With dead ends: 5686 [2020-12-02 11:43:05,001 INFO L226 Difference]: Without dead ends: 5630 [2020-12-02 11:43:05,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-02 11:43:05,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2020-12-02 11:43:05,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 4116. [2020-12-02 11:43:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4116 states. [2020-12-02 11:43:05,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 16578 transitions. [2020-12-02 11:43:05,174 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 16578 transitions. Word has length 18 [2020-12-02 11:43:05,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:05,175 INFO L481 AbstractCegarLoop]: Abstraction has 4116 states and 16578 transitions. [2020-12-02 11:43:05,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 11:43:05,175 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 16578 transitions. [2020-12-02 11:43:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 11:43:05,177 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:05,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:05,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-02 11:43:05,178 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:05,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:05,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1845549347, now seen corresponding path program 1 times [2020-12-02 11:43:05,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:05,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061698506] [2020-12-02 11:43:05,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:05,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:05,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061698506] [2020-12-02 11:43:05,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:05,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 11:43:05,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855487922] [2020-12-02 11:43:05,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:43:05,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:05,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:43:05,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:43:05,242 INFO L87 Difference]: Start difference. First operand 4116 states and 16578 transitions. Second operand 6 states. [2020-12-02 11:43:05,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:05,381 INFO L93 Difference]: Finished difference Result 4687 states and 18325 transitions. [2020-12-02 11:43:05,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:43:05,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-02 11:43:05,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:05,398 INFO L225 Difference]: With dead ends: 4687 [2020-12-02 11:43:05,398 INFO L226 Difference]: Without dead ends: 4687 [2020-12-02 11:43:05,399 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 11:43:05,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2020-12-02 11:43:05,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4131. [2020-12-02 11:43:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-12-02 11:43:05,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16621 transitions. [2020-12-02 11:43:05,552 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16621 transitions. Word has length 19 [2020-12-02 11:43:05,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:05,552 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16621 transitions. [2020-12-02 11:43:05,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:43:05,553 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16621 transitions. [2020-12-02 11:43:05,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 11:43:05,555 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:05,556 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:05,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-02 11:43:05,556 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:05,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:05,557 INFO L82 PathProgramCache]: Analyzing trace with hash 838752707, now seen corresponding path program 2 times [2020-12-02 11:43:05,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:05,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302937391] [2020-12-02 11:43:05,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:05,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302937391] [2020-12-02 11:43:05,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:05,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-02 11:43:05,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314814395] [2020-12-02 11:43:05,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 11:43:05,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:05,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 11:43:05,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-02 11:43:05,641 INFO L87 Difference]: Start difference. First operand 4131 states and 16621 transitions. Second operand 7 states. [2020-12-02 11:43:05,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:05,762 INFO L93 Difference]: Finished difference Result 4619 states and 18100 transitions. [2020-12-02 11:43:05,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:43:05,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-12-02 11:43:05,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:05,774 INFO L225 Difference]: With dead ends: 4619 [2020-12-02 11:43:05,774 INFO L226 Difference]: Without dead ends: 4619 [2020-12-02 11:43:05,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-02 11:43:05,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2020-12-02 11:43:05,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4078. [2020-12-02 11:43:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4078 states. [2020-12-02 11:43:05,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 16436 transitions. [2020-12-02 11:43:05,903 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 16436 transitions. Word has length 19 [2020-12-02 11:43:05,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:05,903 INFO L481 AbstractCegarLoop]: Abstraction has 4078 states and 16436 transitions. [2020-12-02 11:43:05,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 11:43:05,904 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 16436 transitions. [2020-12-02 11:43:05,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 11:43:05,906 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:05,906 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:05,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-02 11:43:05,906 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:05,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:05,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1368539430, now seen corresponding path program 1 times [2020-12-02 11:43:05,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:05,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762768152] [2020-12-02 11:43:05,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:06,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:06,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762768152] [2020-12-02 11:43:06,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:06,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 11:43:06,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194413929] [2020-12-02 11:43:06,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 11:43:06,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:06,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 11:43:06,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-12-02 11:43:06,195 INFO L87 Difference]: Start difference. First operand 4078 states and 16436 transitions. Second operand 10 states. [2020-12-02 11:43:06,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:06,783 INFO L93 Difference]: Finished difference Result 5300 states and 21612 transitions. [2020-12-02 11:43:06,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 11:43:06,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-12-02 11:43:06,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:06,802 INFO L225 Difference]: With dead ends: 5300 [2020-12-02 11:43:06,802 INFO L226 Difference]: Without dead ends: 5226 [2020-12-02 11:43:06,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-12-02 11:43:06,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5226 states. [2020-12-02 11:43:06,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5226 to 4066. [2020-12-02 11:43:06,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4066 states. [2020-12-02 11:43:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4066 states to 4066 states and 16392 transitions. [2020-12-02 11:43:06,940 INFO L78 Accepts]: Start accepts. Automaton has 4066 states and 16392 transitions. Word has length 19 [2020-12-02 11:43:06,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:06,941 INFO L481 AbstractCegarLoop]: Abstraction has 4066 states and 16392 transitions. [2020-12-02 11:43:06,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 11:43:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 4066 states and 16392 transitions. [2020-12-02 11:43:06,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 11:43:06,945 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:06,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:06,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-02 11:43:06,946 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:06,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:06,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1392670140, now seen corresponding path program 2 times [2020-12-02 11:43:06,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:06,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680699927] [2020-12-02 11:43:06,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:07,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680699927] [2020-12-02 11:43:07,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:07,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 11:43:07,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156910002] [2020-12-02 11:43:07,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 11:43:07,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:07,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 11:43:07,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-02 11:43:07,287 INFO L87 Difference]: Start difference. First operand 4066 states and 16392 transitions. Second operand 12 states. [2020-12-02 11:43:08,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:08,214 INFO L93 Difference]: Finished difference Result 5713 states and 23638 transitions. [2020-12-02 11:43:08,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 11:43:08,215 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-12-02 11:43:08,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:08,229 INFO L225 Difference]: With dead ends: 5713 [2020-12-02 11:43:08,229 INFO L226 Difference]: Without dead ends: 5651 [2020-12-02 11:43:08,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2020-12-02 11:43:08,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2020-12-02 11:43:08,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 4021. [2020-12-02 11:43:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2020-12-02 11:43:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 16226 transitions. [2020-12-02 11:43:08,365 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 16226 transitions. Word has length 19 [2020-12-02 11:43:08,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:08,365 INFO L481 AbstractCegarLoop]: Abstraction has 4021 states and 16226 transitions. [2020-12-02 11:43:08,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 11:43:08,365 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 16226 transitions. [2020-12-02 11:43:08,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 11:43:08,368 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:08,369 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:08,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-02 11:43:08,369 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:08,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:08,370 INFO L82 PathProgramCache]: Analyzing trace with hash -638770199, now seen corresponding path program 1 times [2020-12-02 11:43:08,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:08,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323990961] [2020-12-02 11:43:08,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:08,518 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-12-02 11:43:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:08,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323990961] [2020-12-02 11:43:08,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:08,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 11:43:08,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185955201] [2020-12-02 11:43:08,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 11:43:08,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:08,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 11:43:08,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-02 11:43:08,558 INFO L87 Difference]: Start difference. First operand 4021 states and 16226 transitions. Second operand 8 states. [2020-12-02 11:43:08,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:08,859 INFO L93 Difference]: Finished difference Result 6240 states and 25278 transitions. [2020-12-02 11:43:08,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 11:43:08,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-02 11:43:08,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:08,877 INFO L225 Difference]: With dead ends: 6240 [2020-12-02 11:43:08,878 INFO L226 Difference]: Without dead ends: 6194 [2020-12-02 11:43:08,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-12-02 11:43:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6194 states. [2020-12-02 11:43:09,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6194 to 4020. [2020-12-02 11:43:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4020 states. [2020-12-02 11:43:09,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 16225 transitions. [2020-12-02 11:43:09,025 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 16225 transitions. Word has length 20 [2020-12-02 11:43:09,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:09,025 INFO L481 AbstractCegarLoop]: Abstraction has 4020 states and 16225 transitions. [2020-12-02 11:43:09,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 11:43:09,025 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 16225 transitions. [2020-12-02 11:43:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 11:43:09,028 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:09,028 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:09,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-02 11:43:09,029 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:09,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:09,029 INFO L82 PathProgramCache]: Analyzing trace with hash -78568143, now seen corresponding path program 2 times [2020-12-02 11:43:09,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:09,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286799613] [2020-12-02 11:43:09,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:09,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286799613] [2020-12-02 11:43:09,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:09,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 11:43:09,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972490130] [2020-12-02 11:43:09,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 11:43:09,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:09,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 11:43:09,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-02 11:43:09,118 INFO L87 Difference]: Start difference. First operand 4020 states and 16225 transitions. Second operand 8 states. [2020-12-02 11:43:09,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:09,338 INFO L93 Difference]: Finished difference Result 5057 states and 20246 transitions. [2020-12-02 11:43:09,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 11:43:09,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-02 11:43:09,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:09,353 INFO L225 Difference]: With dead ends: 5057 [2020-12-02 11:43:09,354 INFO L226 Difference]: Without dead ends: 5011 [2020-12-02 11:43:09,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-12-02 11:43:09,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5011 states. [2020-12-02 11:43:09,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5011 to 4017. [2020-12-02 11:43:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4017 states. [2020-12-02 11:43:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 16218 transitions. [2020-12-02 11:43:09,483 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 16218 transitions. Word has length 20 [2020-12-02 11:43:09,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:09,483 INFO L481 AbstractCegarLoop]: Abstraction has 4017 states and 16218 transitions. [2020-12-02 11:43:09,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 11:43:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 16218 transitions. [2020-12-02 11:43:09,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 11:43:09,487 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:09,487 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:09,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-02 11:43:09,488 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:09,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:09,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1686883325, now seen corresponding path program 3 times [2020-12-02 11:43:09,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:09,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059363512] [2020-12-02 11:43:09,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:09,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:09,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059363512] [2020-12-02 11:43:09,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:09,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 11:43:09,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760313303] [2020-12-02 11:43:09,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 11:43:09,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:09,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 11:43:09,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-02 11:43:09,638 INFO L87 Difference]: Start difference. First operand 4017 states and 16218 transitions. Second operand 9 states. [2020-12-02 11:43:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:10,140 INFO L93 Difference]: Finished difference Result 5047 states and 20222 transitions. [2020-12-02 11:43:10,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 11:43:10,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-12-02 11:43:10,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:10,154 INFO L225 Difference]: With dead ends: 5047 [2020-12-02 11:43:10,154 INFO L226 Difference]: Without dead ends: 5001 [2020-12-02 11:43:10,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-12-02 11:43:10,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5001 states. [2020-12-02 11:43:10,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5001 to 4010. [2020-12-02 11:43:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4010 states. [2020-12-02 11:43:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 16199 transitions. [2020-12-02 11:43:10,243 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 16199 transitions. Word has length 20 [2020-12-02 11:43:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:10,243 INFO L481 AbstractCegarLoop]: Abstraction has 4010 states and 16199 transitions. [2020-12-02 11:43:10,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 11:43:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 16199 transitions. [2020-12-02 11:43:10,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 11:43:10,247 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:10,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:10,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-02 11:43:10,247 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:10,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:10,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1644928641, now seen corresponding path program 4 times [2020-12-02 11:43:10,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:10,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710160675] [2020-12-02 11:43:10,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:10,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710160675] [2020-12-02 11:43:10,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:10,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 11:43:10,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629450736] [2020-12-02 11:43:10,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 11:43:10,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:10,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 11:43:10,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-12-02 11:43:10,531 INFO L87 Difference]: Start difference. First operand 4010 states and 16199 transitions. Second operand 11 states. [2020-12-02 11:43:11,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:11,309 INFO L93 Difference]: Finished difference Result 5545 states and 22382 transitions. [2020-12-02 11:43:11,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-02 11:43:11,310 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-02 11:43:11,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:11,327 INFO L225 Difference]: With dead ends: 5545 [2020-12-02 11:43:11,327 INFO L226 Difference]: Without dead ends: 5499 [2020-12-02 11:43:11,327 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-12-02 11:43:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2020-12-02 11:43:11,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 4140. [2020-12-02 11:43:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2020-12-02 11:43:11,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 16867 transitions. [2020-12-02 11:43:11,435 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 16867 transitions. Word has length 20 [2020-12-02 11:43:11,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:11,435 INFO L481 AbstractCegarLoop]: Abstraction has 4140 states and 16867 transitions. [2020-12-02 11:43:11,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 11:43:11,436 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 16867 transitions. [2020-12-02 11:43:11,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 11:43:11,439 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:11,439 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:11,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-02 11:43:11,439 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:11,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:11,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1818104208, now seen corresponding path program 1 times [2020-12-02 11:43:11,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:11,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113897385] [2020-12-02 11:43:11,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:11,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113897385] [2020-12-02 11:43:11,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:11,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 11:43:11,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94459145] [2020-12-02 11:43:11,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 11:43:11,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:11,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 11:43:11,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-02 11:43:11,672 INFO L87 Difference]: Start difference. First operand 4140 states and 16867 transitions. Second operand 11 states. [2020-12-02 11:43:12,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:12,651 INFO L93 Difference]: Finished difference Result 6397 states and 25724 transitions. [2020-12-02 11:43:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-02 11:43:12,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-02 11:43:12,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:12,674 INFO L225 Difference]: With dead ends: 6397 [2020-12-02 11:43:12,674 INFO L226 Difference]: Without dead ends: 6351 [2020-12-02 11:43:12,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2020-12-02 11:43:12,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6351 states. [2020-12-02 11:43:12,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6351 to 4140. [2020-12-02 11:43:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2020-12-02 11:43:12,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 16868 transitions. [2020-12-02 11:43:12,804 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 16868 transitions. Word has length 20 [2020-12-02 11:43:12,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:12,804 INFO L481 AbstractCegarLoop]: Abstraction has 4140 states and 16868 transitions. [2020-12-02 11:43:12,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 11:43:12,804 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 16868 transitions. [2020-12-02 11:43:12,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 11:43:12,808 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:12,809 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:12,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-02 11:43:12,809 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:12,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:12,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1599554532, now seen corresponding path program 2 times [2020-12-02 11:43:12,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:12,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077505874] [2020-12-02 11:43:12,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:13,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:13,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077505874] [2020-12-02 11:43:13,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:13,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 11:43:13,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431690526] [2020-12-02 11:43:13,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 11:43:13,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:13,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 11:43:13,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-02 11:43:13,015 INFO L87 Difference]: Start difference. First operand 4140 states and 16868 transitions. Second operand 11 states. [2020-12-02 11:43:13,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:13,813 INFO L93 Difference]: Finished difference Result 5409 states and 21869 transitions. [2020-12-02 11:43:13,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-02 11:43:13,814 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-02 11:43:13,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:13,828 INFO L225 Difference]: With dead ends: 5409 [2020-12-02 11:43:13,828 INFO L226 Difference]: Without dead ends: 5363 [2020-12-02 11:43:13,829 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-12-02 11:43:13,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5363 states. [2020-12-02 11:43:13,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5363 to 4142. [2020-12-02 11:43:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4142 states. [2020-12-02 11:43:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4142 states to 4142 states and 16874 transitions. [2020-12-02 11:43:13,922 INFO L78 Accepts]: Start accepts. Automaton has 4142 states and 16874 transitions. Word has length 20 [2020-12-02 11:43:13,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:13,922 INFO L481 AbstractCegarLoop]: Abstraction has 4142 states and 16874 transitions. [2020-12-02 11:43:13,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 11:43:13,923 INFO L276 IsEmpty]: Start isEmpty. Operand 4142 states and 16874 transitions. [2020-12-02 11:43:13,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 11:43:13,925 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:13,925 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:13,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-02 11:43:13,926 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:13,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:13,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1117675172, now seen corresponding path program 3 times [2020-12-02 11:43:13,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:13,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368045792] [2020-12-02 11:43:13,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:14,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368045792] [2020-12-02 11:43:14,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:14,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 11:43:14,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988365951] [2020-12-02 11:43:14,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 11:43:14,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:14,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 11:43:14,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-02 11:43:14,079 INFO L87 Difference]: Start difference. First operand 4142 states and 16874 transitions. Second operand 10 states. [2020-12-02 11:43:14,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:14,621 INFO L93 Difference]: Finished difference Result 6189 states and 24832 transitions. [2020-12-02 11:43:14,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-02 11:43:14,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-12-02 11:43:14,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:14,644 INFO L225 Difference]: With dead ends: 6189 [2020-12-02 11:43:14,644 INFO L226 Difference]: Without dead ends: 6143 [2020-12-02 11:43:14,645 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-12-02 11:43:14,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2020-12-02 11:43:14,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 4141. [2020-12-02 11:43:14,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4141 states. [2020-12-02 11:43:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4141 states to 4141 states and 16873 transitions. [2020-12-02 11:43:14,787 INFO L78 Accepts]: Start accepts. Automaton has 4141 states and 16873 transitions. Word has length 20 [2020-12-02 11:43:14,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:14,788 INFO L481 AbstractCegarLoop]: Abstraction has 4141 states and 16873 transitions. [2020-12-02 11:43:14,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 11:43:14,789 INFO L276 IsEmpty]: Start isEmpty. Operand 4141 states and 16873 transitions. [2020-12-02 11:43:14,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 11:43:14,792 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:14,793 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:14,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-02 11:43:14,793 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:14,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:14,794 INFO L82 PathProgramCache]: Analyzing trace with hash -240366616, now seen corresponding path program 4 times [2020-12-02 11:43:14,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:14,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452795048] [2020-12-02 11:43:14,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:14,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:14,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452795048] [2020-12-02 11:43:14,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:14,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 11:43:14,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570512610] [2020-12-02 11:43:14,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 11:43:14,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:14,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 11:43:14,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-02 11:43:14,961 INFO L87 Difference]: Start difference. First operand 4141 states and 16873 transitions. Second operand 10 states. [2020-12-02 11:43:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:15,380 INFO L93 Difference]: Finished difference Result 5246 states and 21125 transitions. [2020-12-02 11:43:15,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 11:43:15,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-12-02 11:43:15,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:15,394 INFO L225 Difference]: With dead ends: 5246 [2020-12-02 11:43:15,394 INFO L226 Difference]: Without dead ends: 5200 [2020-12-02 11:43:15,396 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2020-12-02 11:43:15,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2020-12-02 11:43:15,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 3983. [2020-12-02 11:43:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3983 states. [2020-12-02 11:43:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 16133 transitions. [2020-12-02 11:43:15,492 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 16133 transitions. Word has length 20 [2020-12-02 11:43:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:15,492 INFO L481 AbstractCegarLoop]: Abstraction has 3983 states and 16133 transitions. [2020-12-02 11:43:15,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 11:43:15,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 16133 transitions. [2020-12-02 11:43:15,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 11:43:15,495 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:15,495 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:15,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-02 11:43:15,496 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:15,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:15,496 INFO L82 PathProgramCache]: Analyzing trace with hash -565771751, now seen corresponding path program 1 times [2020-12-02 11:43:15,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:15,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737768840] [2020-12-02 11:43:15,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:15,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:15,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737768840] [2020-12-02 11:43:15,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:15,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 11:43:15,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236759265] [2020-12-02 11:43:15,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:43:15,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:15,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:43:15,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:43:15,549 INFO L87 Difference]: Start difference. First operand 3983 states and 16133 transitions. Second operand 6 states. [2020-12-02 11:43:15,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:15,760 INFO L93 Difference]: Finished difference Result 4762 states and 18800 transitions. [2020-12-02 11:43:15,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 11:43:15,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-02 11:43:15,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:15,773 INFO L225 Difference]: With dead ends: 4762 [2020-12-02 11:43:15,773 INFO L226 Difference]: Without dead ends: 4687 [2020-12-02 11:43:15,776 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-02 11:43:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2020-12-02 11:43:15,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4305. [2020-12-02 11:43:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4305 states. [2020-12-02 11:43:15,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 17320 transitions. [2020-12-02 11:43:15,870 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 17320 transitions. Word has length 21 [2020-12-02 11:43:15,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:15,871 INFO L481 AbstractCegarLoop]: Abstraction has 4305 states and 17320 transitions. [2020-12-02 11:43:15,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:43:15,871 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 17320 transitions. [2020-12-02 11:43:15,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 11:43:15,875 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:15,875 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:15,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-02 11:43:15,875 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:15,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:15,876 INFO L82 PathProgramCache]: Analyzing trace with hash 479599707, now seen corresponding path program 2 times [2020-12-02 11:43:15,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:15,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939465330] [2020-12-02 11:43:15,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:15,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939465330] [2020-12-02 11:43:15,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:15,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 11:43:15,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994200518] [2020-12-02 11:43:15,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:43:15,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:15,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:43:15,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:43:15,942 INFO L87 Difference]: Start difference. First operand 4305 states and 17320 transitions. Second operand 6 states. [2020-12-02 11:43:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:16,059 INFO L93 Difference]: Finished difference Result 5233 states and 20429 transitions. [2020-12-02 11:43:16,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:43:16,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-02 11:43:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:16,076 INFO L225 Difference]: With dead ends: 5233 [2020-12-02 11:43:16,076 INFO L226 Difference]: Without dead ends: 4707 [2020-12-02 11:43:16,076 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 11:43:16,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4707 states. [2020-12-02 11:43:16,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4707 to 3933. [2020-12-02 11:43:16,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3933 states. [2020-12-02 11:43:16,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3933 states to 3933 states and 15536 transitions. [2020-12-02 11:43:16,180 INFO L78 Accepts]: Start accepts. Automaton has 3933 states and 15536 transitions. Word has length 21 [2020-12-02 11:43:16,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:16,180 INFO L481 AbstractCegarLoop]: Abstraction has 3933 states and 15536 transitions. [2020-12-02 11:43:16,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:43:16,181 INFO L276 IsEmpty]: Start isEmpty. Operand 3933 states and 15536 transitions. [2020-12-02 11:43:16,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 11:43:16,183 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:16,183 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:16,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-02 11:43:16,184 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:16,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:16,184 INFO L82 PathProgramCache]: Analyzing trace with hash -586116813, now seen corresponding path program 1 times [2020-12-02 11:43:16,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:16,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171394662] [2020-12-02 11:43:16,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:16,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171394662] [2020-12-02 11:43:16,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:16,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 11:43:16,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709286648] [2020-12-02 11:43:16,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 11:43:16,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:16,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 11:43:16,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-12-02 11:43:16,386 INFO L87 Difference]: Start difference. First operand 3933 states and 15536 transitions. Second operand 10 states. [2020-12-02 11:43:17,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:17,126 INFO L93 Difference]: Finished difference Result 4734 states and 18567 transitions. [2020-12-02 11:43:17,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 11:43:17,126 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-12-02 11:43:17,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:17,141 INFO L225 Difference]: With dead ends: 4734 [2020-12-02 11:43:17,141 INFO L226 Difference]: Without dead ends: 4685 [2020-12-02 11:43:17,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-02 11:43:17,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4685 states. [2020-12-02 11:43:17,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4685 to 3841. [2020-12-02 11:43:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2020-12-02 11:43:17,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 15162 transitions. [2020-12-02 11:43:17,239 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 15162 transitions. Word has length 21 [2020-12-02 11:43:17,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:17,239 INFO L481 AbstractCegarLoop]: Abstraction has 3841 states and 15162 transitions. [2020-12-02 11:43:17,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 11:43:17,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 15162 transitions. [2020-12-02 11:43:17,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 11:43:17,241 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:17,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:17,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-02 11:43:17,242 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:17,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:17,242 INFO L82 PathProgramCache]: Analyzing trace with hash -757352757, now seen corresponding path program 1 times [2020-12-02 11:43:17,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:17,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853892275] [2020-12-02 11:43:17,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:17,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853892275] [2020-12-02 11:43:17,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:17,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 11:43:17,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784150760] [2020-12-02 11:43:17,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 11:43:17,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:17,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 11:43:17,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-02 11:43:17,539 INFO L87 Difference]: Start difference. First operand 3841 states and 15162 transitions. Second operand 12 states. [2020-12-02 11:43:18,256 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2020-12-02 11:43:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:18,687 INFO L93 Difference]: Finished difference Result 5118 states and 20406 transitions. [2020-12-02 11:43:18,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-02 11:43:18,688 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-12-02 11:43:18,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:18,704 INFO L225 Difference]: With dead ends: 5118 [2020-12-02 11:43:18,704 INFO L226 Difference]: Without dead ends: 4964 [2020-12-02 11:43:18,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2020-12-02 11:43:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4964 states. [2020-12-02 11:43:18,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4964 to 3443. [2020-12-02 11:43:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3443 states. [2020-12-02 11:43:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 13378 transitions. [2020-12-02 11:43:18,791 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 13378 transitions. Word has length 21 [2020-12-02 11:43:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:18,792 INFO L481 AbstractCegarLoop]: Abstraction has 3443 states and 13378 transitions. [2020-12-02 11:43:18,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 11:43:18,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 13378 transitions. [2020-12-02 11:43:18,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 11:43:18,794 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:18,795 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:18,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-02 11:43:18,795 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:18,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:18,796 INFO L82 PathProgramCache]: Analyzing trace with hash 820571943, now seen corresponding path program 2 times [2020-12-02 11:43:18,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:18,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334253838] [2020-12-02 11:43:18,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:19,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334253838] [2020-12-02 11:43:19,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:19,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 11:43:19,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810497112] [2020-12-02 11:43:19,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 11:43:19,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:19,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 11:43:19,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-12-02 11:43:19,041 INFO L87 Difference]: Start difference. First operand 3443 states and 13378 transitions. Second operand 12 states. [2020-12-02 11:43:19,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:19,628 INFO L93 Difference]: Finished difference Result 4562 states and 17491 transitions. [2020-12-02 11:43:19,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 11:43:19,628 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-12-02 11:43:19,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:19,640 INFO L225 Difference]: With dead ends: 4562 [2020-12-02 11:43:19,640 INFO L226 Difference]: Without dead ends: 4510 [2020-12-02 11:43:19,640 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-02 11:43:19,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2020-12-02 11:43:19,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 3368. [2020-12-02 11:43:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3368 states. [2020-12-02 11:43:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 12841 transitions. [2020-12-02 11:43:19,718 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 12841 transitions. Word has length 21 [2020-12-02 11:43:19,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:19,718 INFO L481 AbstractCegarLoop]: Abstraction has 3368 states and 12841 transitions. [2020-12-02 11:43:19,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 11:43:19,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 12841 transitions. [2020-12-02 11:43:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 11:43:19,720 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:19,720 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:19,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-02 11:43:19,721 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:19,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:19,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1673753334, now seen corresponding path program 1 times [2020-12-02 11:43:19,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:19,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421800254] [2020-12-02 11:43:19,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:19,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:19,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421800254] [2020-12-02 11:43:19,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:19,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-02 11:43:19,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483798765] [2020-12-02 11:43:19,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 11:43:19,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:19,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 11:43:19,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-02 11:43:19,788 INFO L87 Difference]: Start difference. First operand 3368 states and 12841 transitions. Second operand 7 states. [2020-12-02 11:43:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:19,901 INFO L93 Difference]: Finished difference Result 3879 states and 14497 transitions. [2020-12-02 11:43:19,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:43:19,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-12-02 11:43:19,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:19,914 INFO L225 Difference]: With dead ends: 3879 [2020-12-02 11:43:19,914 INFO L226 Difference]: Without dead ends: 3785 [2020-12-02 11:43:19,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-02 11:43:19,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3785 states. [2020-12-02 11:43:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3785 to 3369. [2020-12-02 11:43:19,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3369 states. [2020-12-02 11:43:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 12845 transitions. [2020-12-02 11:43:20,013 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 12845 transitions. Word has length 21 [2020-12-02 11:43:20,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:20,013 INFO L481 AbstractCegarLoop]: Abstraction has 3369 states and 12845 transitions. [2020-12-02 11:43:20,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 11:43:20,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 12845 transitions. [2020-12-02 11:43:20,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 11:43:20,017 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:20,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:20,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-02 11:43:20,017 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:20,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:20,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1208728268, now seen corresponding path program 1 times [2020-12-02 11:43:20,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:20,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159072592] [2020-12-02 11:43:20,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:20,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159072592] [2020-12-02 11:43:20,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:20,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 11:43:20,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695964211] [2020-12-02 11:43:20,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 11:43:20,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:20,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 11:43:20,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-02 11:43:20,259 INFO L87 Difference]: Start difference. First operand 3369 states and 12845 transitions. Second operand 11 states. [2020-12-02 11:43:21,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:21,123 INFO L93 Difference]: Finished difference Result 4138 states and 15694 transitions. [2020-12-02 11:43:21,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-02 11:43:21,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-12-02 11:43:21,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:21,137 INFO L225 Difference]: With dead ends: 4138 [2020-12-02 11:43:21,137 INFO L226 Difference]: Without dead ends: 4089 [2020-12-02 11:43:21,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-12-02 11:43:21,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4089 states. [2020-12-02 11:43:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4089 to 3004. [2020-12-02 11:43:21,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3004 states. [2020-12-02 11:43:21,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 11303 transitions. [2020-12-02 11:43:21,208 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 11303 transitions. Word has length 21 [2020-12-02 11:43:21,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:21,208 INFO L481 AbstractCegarLoop]: Abstraction has 3004 states and 11303 transitions. [2020-12-02 11:43:21,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 11:43:21,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 11303 transitions. [2020-12-02 11:43:21,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 11:43:21,210 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:21,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:21,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-02 11:43:21,211 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:21,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:21,211 INFO L82 PathProgramCache]: Analyzing trace with hash 172061386, now seen corresponding path program 2 times [2020-12-02 11:43:21,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:21,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609984535] [2020-12-02 11:43:21,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:21,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609984535] [2020-12-02 11:43:21,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:21,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 11:43:21,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46927759] [2020-12-02 11:43:21,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 11:43:21,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:21,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 11:43:21,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-02 11:43:21,325 INFO L87 Difference]: Start difference. First operand 3004 states and 11303 transitions. Second operand 8 states. [2020-12-02 11:43:21,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:21,479 INFO L93 Difference]: Finished difference Result 3058 states and 11357 transitions. [2020-12-02 11:43:21,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:43:21,480 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-12-02 11:43:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:21,490 INFO L225 Difference]: With dead ends: 3058 [2020-12-02 11:43:21,490 INFO L226 Difference]: Without dead ends: 3058 [2020-12-02 11:43:21,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-02 11:43:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2020-12-02 11:43:21,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2831. [2020-12-02 11:43:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2020-12-02 11:43:21,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2020-12-02 11:43:21,575 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2020-12-02 11:43:21,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:21,576 INFO L481 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2020-12-02 11:43:21,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 11:43:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2020-12-02 11:43:21,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 11:43:21,579 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:21,579 INFO L422 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] [2020-12-02 11:43:21,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-02 11:43:21,579 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:21,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:21,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1320448504, now seen corresponding path program 1 times [2020-12-02 11:43:21,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:21,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304600213] [2020-12-02 11:43:21,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:21,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304600213] [2020-12-02 11:43:21,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:21,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 11:43:21,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439028534] [2020-12-02 11:43:21,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 11:43:21,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:21,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 11:43:21,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-02 11:43:21,694 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 8 states. [2020-12-02 11:43:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:22,020 INFO L93 Difference]: Finished difference Result 3550 states and 13085 transitions. [2020-12-02 11:43:22,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-02 11:43:22,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-12-02 11:43:22,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:22,029 INFO L225 Difference]: With dead ends: 3550 [2020-12-02 11:43:22,030 INFO L226 Difference]: Without dead ends: 3490 [2020-12-02 11:43:22,030 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-02 11:43:22,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2020-12-02 11:43:22,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2828. [2020-12-02 11:43:22,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2020-12-02 11:43:22,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 10620 transitions. [2020-12-02 11:43:22,082 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 10620 transitions. Word has length 22 [2020-12-02 11:43:22,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:22,082 INFO L481 AbstractCegarLoop]: Abstraction has 2828 states and 10620 transitions. [2020-12-02 11:43:22,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 11:43:22,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 10620 transitions. [2020-12-02 11:43:22,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 11:43:22,084 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:22,084 INFO L422 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] [2020-12-02 11:43:22,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-02 11:43:22,084 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:22,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:22,085 INFO L82 PathProgramCache]: Analyzing trace with hash -893918318, now seen corresponding path program 2 times [2020-12-02 11:43:22,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:22,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143490483] [2020-12-02 11:43:22,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:22,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143490483] [2020-12-02 11:43:22,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:22,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 11:43:22,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326765979] [2020-12-02 11:43:22,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 11:43:22,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:22,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 11:43:22,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-02 11:43:22,196 INFO L87 Difference]: Start difference. First operand 2828 states and 10620 transitions. Second operand 9 states. [2020-12-02 11:43:22,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:22,610 INFO L93 Difference]: Finished difference Result 3862 states and 14252 transitions. [2020-12-02 11:43:22,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 11:43:22,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-12-02 11:43:22,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:22,620 INFO L225 Difference]: With dead ends: 3862 [2020-12-02 11:43:22,621 INFO L226 Difference]: Without dead ends: 3802 [2020-12-02 11:43:22,621 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-02 11:43:22,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2020-12-02 11:43:22,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 2822. [2020-12-02 11:43:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-12-02 11:43:22,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2020-12-02 11:43:22,680 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2020-12-02 11:43:22,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:22,680 INFO L481 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2020-12-02 11:43:22,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 11:43:22,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2020-12-02 11:43:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 11:43:22,682 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:22,682 INFO L422 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] [2020-12-02 11:43:22,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-02 11:43:22,683 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:22,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:22,683 INFO L82 PathProgramCache]: Analyzing trace with hash 131153448, now seen corresponding path program 3 times [2020-12-02 11:43:22,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:22,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448918664] [2020-12-02 11:43:22,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:22,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:22,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448918664] [2020-12-02 11:43:22,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:22,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 11:43:22,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833501848] [2020-12-02 11:43:22,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 11:43:22,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:22,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 11:43:22,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-02 11:43:22,788 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 10 states. [2020-12-02 11:43:23,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:23,246 INFO L93 Difference]: Finished difference Result 4277 states and 15941 transitions. [2020-12-02 11:43:23,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 11:43:23,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-12-02 11:43:23,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:23,257 INFO L225 Difference]: With dead ends: 4277 [2020-12-02 11:43:23,257 INFO L226 Difference]: Without dead ends: 4217 [2020-12-02 11:43:23,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-12-02 11:43:23,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4217 states. [2020-12-02 11:43:23,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4217 to 2818. [2020-12-02 11:43:23,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2818 states. [2020-12-02 11:43:23,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 10596 transitions. [2020-12-02 11:43:23,315 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 10596 transitions. Word has length 22 [2020-12-02 11:43:23,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:23,315 INFO L481 AbstractCegarLoop]: Abstraction has 2818 states and 10596 transitions. [2020-12-02 11:43:23,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 11:43:23,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 10596 transitions. [2020-12-02 11:43:23,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 11:43:23,317 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:23,317 INFO L422 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] [2020-12-02 11:43:23,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-02 11:43:23,317 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:23,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:23,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1026439080, now seen corresponding path program 4 times [2020-12-02 11:43:23,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:23,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928481853] [2020-12-02 11:43:23,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:23,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928481853] [2020-12-02 11:43:23,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:23,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 11:43:23,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188168786] [2020-12-02 11:43:23,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 11:43:23,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:23,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 11:43:23,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-02 11:43:23,436 INFO L87 Difference]: Start difference. First operand 2818 states and 10596 transitions. Second operand 10 states. [2020-12-02 11:43:23,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:23,695 INFO L93 Difference]: Finished difference Result 3433 states and 12660 transitions. [2020-12-02 11:43:23,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 11:43:23,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-12-02 11:43:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:23,708 INFO L225 Difference]: With dead ends: 3433 [2020-12-02 11:43:23,708 INFO L226 Difference]: Without dead ends: 3373 [2020-12-02 11:43:23,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-12-02 11:43:23,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2020-12-02 11:43:23,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 2730. [2020-12-02 11:43:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2020-12-02 11:43:23,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 10232 transitions. [2020-12-02 11:43:23,787 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 10232 transitions. Word has length 22 [2020-12-02 11:43:23,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:23,787 INFO L481 AbstractCegarLoop]: Abstraction has 2730 states and 10232 transitions. [2020-12-02 11:43:23,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 11:43:23,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 10232 transitions. [2020-12-02 11:43:23,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 11:43:23,790 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:23,790 INFO L422 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] [2020-12-02 11:43:23,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-02 11:43:23,791 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:23,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:23,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1544480782, now seen corresponding path program 5 times [2020-12-02 11:43:23,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:23,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640794295] [2020-12-02 11:43:23,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:24,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640794295] [2020-12-02 11:43:24,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:24,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 11:43:24,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313452039] [2020-12-02 11:43:24,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 11:43:24,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:24,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 11:43:24,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-02 11:43:24,025 INFO L87 Difference]: Start difference. First operand 2730 states and 10232 transitions. Second operand 12 states. [2020-12-02 11:43:24,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:24,473 INFO L93 Difference]: Finished difference Result 3588 states and 13121 transitions. [2020-12-02 11:43:24,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 11:43:24,473 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-12-02 11:43:24,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:24,484 INFO L225 Difference]: With dead ends: 3588 [2020-12-02 11:43:24,484 INFO L226 Difference]: Without dead ends: 3528 [2020-12-02 11:43:24,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2020-12-02 11:43:24,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2020-12-02 11:43:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 2670. [2020-12-02 11:43:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2020-12-02 11:43:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2020-12-02 11:43:24,559 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2020-12-02 11:43:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:24,559 INFO L481 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2020-12-02 11:43:24,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 11:43:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2020-12-02 11:43:24,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 11:43:24,563 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:24,563 INFO L422 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] [2020-12-02 11:43:24,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-02 11:43:24,563 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:24,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:24,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1499150017, now seen corresponding path program 1 times [2020-12-02 11:43:24,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:24,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772977060] [2020-12-02 11:43:24,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:24,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:24,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772977060] [2020-12-02 11:43:24,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:24,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 11:43:24,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911317737] [2020-12-02 11:43:24,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 11:43:24,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:24,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 11:43:24,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-12-02 11:43:24,893 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2020-12-02 11:43:25,330 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2020-12-02 11:43:25,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:25,785 INFO L93 Difference]: Finished difference Result 2896 states and 10368 transitions. [2020-12-02 11:43:25,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-02 11:43:25,786 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-12-02 11:43:25,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:25,792 INFO L225 Difference]: With dead ends: 2896 [2020-12-02 11:43:25,792 INFO L226 Difference]: Without dead ends: 2802 [2020-12-02 11:43:25,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2020-12-02 11:43:25,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2020-12-02 11:43:25,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2426. [2020-12-02 11:43:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2020-12-02 11:43:25,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 8840 transitions. [2020-12-02 11:43:25,834 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 8840 transitions. Word has length 23 [2020-12-02 11:43:25,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:25,834 INFO L481 AbstractCegarLoop]: Abstraction has 2426 states and 8840 transitions. [2020-12-02 11:43:25,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 11:43:25,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 8840 transitions. [2020-12-02 11:43:25,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 11:43:25,836 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:25,837 INFO L422 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] [2020-12-02 11:43:25,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-02 11:43:25,837 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:25,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:25,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1292151056, now seen corresponding path program 1 times [2020-12-02 11:43:25,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:25,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908398455] [2020-12-02 11:43:25,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:26,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908398455] [2020-12-02 11:43:26,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:26,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 11:43:26,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095825069] [2020-12-02 11:43:26,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 11:43:26,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:26,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 11:43:26,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-12-02 11:43:26,132 INFO L87 Difference]: Start difference. First operand 2426 states and 8840 transitions. Second operand 12 states. [2020-12-02 11:43:26,553 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2020-12-02 11:43:27,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:27,006 INFO L93 Difference]: Finished difference Result 2538 states and 8863 transitions. [2020-12-02 11:43:27,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-02 11:43:27,007 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-12-02 11:43:27,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:27,015 INFO L225 Difference]: With dead ends: 2538 [2020-12-02 11:43:27,015 INFO L226 Difference]: Without dead ends: 2419 [2020-12-02 11:43:27,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2020-12-02 11:43:27,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2020-12-02 11:43:27,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1794. [2020-12-02 11:43:27,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2020-12-02 11:43:27,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6287 transitions. [2020-12-02 11:43:27,055 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6287 transitions. Word has length 23 [2020-12-02 11:43:27,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:27,055 INFO L481 AbstractCegarLoop]: Abstraction has 1794 states and 6287 transitions. [2020-12-02 11:43:27,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 11:43:27,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6287 transitions. [2020-12-02 11:43:27,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 11:43:27,057 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:27,057 INFO L422 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] [2020-12-02 11:43:27,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-02 11:43:27,057 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:27,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:27,057 INFO L82 PathProgramCache]: Analyzing trace with hash -974214744, now seen corresponding path program 1 times [2020-12-02 11:43:27,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:27,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435527978] [2020-12-02 11:43:27,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:27,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435527978] [2020-12-02 11:43:27,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:27,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 11:43:27,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668490428] [2020-12-02 11:43:27,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:43:27,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:27,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:43:27,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:43:27,103 INFO L87 Difference]: Start difference. First operand 1794 states and 6287 transitions. Second operand 6 states. [2020-12-02 11:43:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:27,284 INFO L93 Difference]: Finished difference Result 2291 states and 7723 transitions. [2020-12-02 11:43:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 11:43:27,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-12-02 11:43:27,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:27,292 INFO L225 Difference]: With dead ends: 2291 [2020-12-02 11:43:27,292 INFO L226 Difference]: Without dead ends: 2227 [2020-12-02 11:43:27,293 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-02 11:43:27,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2020-12-02 11:43:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2106. [2020-12-02 11:43:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-12-02 11:43:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7279 transitions. [2020-12-02 11:43:27,343 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7279 transitions. Word has length 24 [2020-12-02 11:43:27,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:27,344 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 7279 transitions. [2020-12-02 11:43:27,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:43:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7279 transitions. [2020-12-02 11:43:27,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 11:43:27,347 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:27,347 INFO L422 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] [2020-12-02 11:43:27,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-02 11:43:27,347 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:27,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:27,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1120972762, now seen corresponding path program 2 times [2020-12-02 11:43:27,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:27,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408609510] [2020-12-02 11:43:27,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:27,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408609510] [2020-12-02 11:43:27,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:27,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 11:43:27,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544751851] [2020-12-02 11:43:27,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 11:43:27,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:27,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 11:43:27,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-02 11:43:27,437 INFO L87 Difference]: Start difference. First operand 2106 states and 7279 transitions. Second operand 8 states. [2020-12-02 11:43:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:27,816 INFO L93 Difference]: Finished difference Result 2599 states and 8709 transitions. [2020-12-02 11:43:27,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-02 11:43:27,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-12-02 11:43:27,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:27,822 INFO L225 Difference]: With dead ends: 2599 [2020-12-02 11:43:27,822 INFO L226 Difference]: Without dead ends: 2535 [2020-12-02 11:43:27,823 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-02 11:43:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2020-12-02 11:43:27,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2102. [2020-12-02 11:43:27,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2020-12-02 11:43:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7273 transitions. [2020-12-02 11:43:27,855 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7273 transitions. Word has length 24 [2020-12-02 11:43:27,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:27,855 INFO L481 AbstractCegarLoop]: Abstraction has 2102 states and 7273 transitions. [2020-12-02 11:43:27,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 11:43:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7273 transitions. [2020-12-02 11:43:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 11:43:27,857 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:27,860 INFO L422 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] [2020-12-02 11:43:27,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-02 11:43:27,860 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:27,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:27,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1176290112, now seen corresponding path program 3 times [2020-12-02 11:43:27,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:27,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052441074] [2020-12-02 11:43:27,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:27,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:27,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052441074] [2020-12-02 11:43:27,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:27,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 11:43:27,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994162419] [2020-12-02 11:43:27,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 11:43:27,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:27,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 11:43:27,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-02 11:43:27,989 INFO L87 Difference]: Start difference. First operand 2102 states and 7273 transitions. Second operand 9 states. [2020-12-02 11:43:28,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:28,392 INFO L93 Difference]: Finished difference Result 2898 states and 9677 transitions. [2020-12-02 11:43:28,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 11:43:28,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-12-02 11:43:28,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:28,399 INFO L225 Difference]: With dead ends: 2898 [2020-12-02 11:43:28,399 INFO L226 Difference]: Without dead ends: 2834 [2020-12-02 11:43:28,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-02 11:43:28,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2020-12-02 11:43:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2093. [2020-12-02 11:43:28,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2020-12-02 11:43:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 7255 transitions. [2020-12-02 11:43:28,435 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 7255 transitions. Word has length 24 [2020-12-02 11:43:28,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:28,435 INFO L481 AbstractCegarLoop]: Abstraction has 2093 states and 7255 transitions. [2020-12-02 11:43:28,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 11:43:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 7255 transitions. [2020-12-02 11:43:28,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 11:43:28,437 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:28,437 INFO L422 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] [2020-12-02 11:43:28,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-02 11:43:28,437 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:28,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:28,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1572220842, now seen corresponding path program 4 times [2020-12-02 11:43:28,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:28,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232170548] [2020-12-02 11:43:28,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:28,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232170548] [2020-12-02 11:43:28,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:28,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 11:43:28,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704357781] [2020-12-02 11:43:28,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 11:43:28,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:28,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 11:43:28,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-02 11:43:28,601 INFO L87 Difference]: Start difference. First operand 2093 states and 7255 transitions. Second operand 10 states. [2020-12-02 11:43:29,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:29,030 INFO L93 Difference]: Finished difference Result 2875 states and 9618 transitions. [2020-12-02 11:43:29,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 11:43:29,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-12-02 11:43:29,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:29,038 INFO L225 Difference]: With dead ends: 2875 [2020-12-02 11:43:29,039 INFO L226 Difference]: Without dead ends: 2811 [2020-12-02 11:43:29,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-12-02 11:43:29,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2020-12-02 11:43:29,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2079. [2020-12-02 11:43:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2079 states. [2020-12-02 11:43:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 7214 transitions. [2020-12-02 11:43:29,091 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 7214 transitions. Word has length 24 [2020-12-02 11:43:29,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:29,091 INFO L481 AbstractCegarLoop]: Abstraction has 2079 states and 7214 transitions. [2020-12-02 11:43:29,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 11:43:29,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 7214 transitions. [2020-12-02 11:43:29,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 11:43:29,094 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:29,095 INFO L422 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] [2020-12-02 11:43:29,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-02 11:43:29,095 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:29,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:29,097 INFO L82 PathProgramCache]: Analyzing trace with hash 438749216, now seen corresponding path program 5 times [2020-12-02 11:43:29,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:29,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530780885] [2020-12-02 11:43:29,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:29,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:29,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530780885] [2020-12-02 11:43:29,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:29,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 11:43:29,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924982567] [2020-12-02 11:43:29,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 11:43:29,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:29,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 11:43:29,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-02 11:43:29,270 INFO L87 Difference]: Start difference. First operand 2079 states and 7214 transitions. Second operand 11 states. [2020-12-02 11:43:29,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:29,613 INFO L93 Difference]: Finished difference Result 3106 states and 10587 transitions. [2020-12-02 11:43:29,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 11:43:29,614 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-12-02 11:43:29,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:29,622 INFO L225 Difference]: With dead ends: 3106 [2020-12-02 11:43:29,622 INFO L226 Difference]: Without dead ends: 3042 [2020-12-02 11:43:29,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-12-02 11:43:29,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2020-12-02 11:43:29,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2071. [2020-12-02 11:43:29,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2020-12-02 11:43:29,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7186 transitions. [2020-12-02 11:43:29,682 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7186 transitions. Word has length 24 [2020-12-02 11:43:29,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:29,682 INFO L481 AbstractCegarLoop]: Abstraction has 2071 states and 7186 transitions. [2020-12-02 11:43:29,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 11:43:29,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7186 transitions. [2020-12-02 11:43:29,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 11:43:29,686 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:29,686 INFO L422 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] [2020-12-02 11:43:29,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-02 11:43:29,686 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:29,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:29,686 INFO L82 PathProgramCache]: Analyzing trace with hash 991769996, now seen corresponding path program 6 times [2020-12-02 11:43:29,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:29,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913699094] [2020-12-02 11:43:29,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:29,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913699094] [2020-12-02 11:43:29,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:29,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 11:43:29,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043405977] [2020-12-02 11:43:29,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 11:43:29,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:29,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 11:43:29,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-02 11:43:29,823 INFO L87 Difference]: Start difference. First operand 2071 states and 7186 transitions. Second operand 11 states. [2020-12-02 11:43:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:30,085 INFO L93 Difference]: Finished difference Result 2481 states and 8355 transitions. [2020-12-02 11:43:30,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 11:43:30,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-12-02 11:43:30,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:30,092 INFO L225 Difference]: With dead ends: 2481 [2020-12-02 11:43:30,092 INFO L226 Difference]: Without dead ends: 2417 [2020-12-02 11:43:30,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2020-12-02 11:43:30,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2020-12-02 11:43:30,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2039. [2020-12-02 11:43:30,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2020-12-02 11:43:30,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 7058 transitions. [2020-12-02 11:43:30,139 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 7058 transitions. Word has length 24 [2020-12-02 11:43:30,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:30,140 INFO L481 AbstractCegarLoop]: Abstraction has 2039 states and 7058 transitions. [2020-12-02 11:43:30,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 11:43:30,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 7058 transitions. [2020-12-02 11:43:30,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 11:43:30,143 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:30,143 INFO L422 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] [2020-12-02 11:43:30,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-12-02 11:43:30,143 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:30,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:30,143 INFO L82 PathProgramCache]: Analyzing trace with hash 71780478, now seen corresponding path program 7 times [2020-12-02 11:43:30,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:30,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758134424] [2020-12-02 11:43:30,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:30,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758134424] [2020-12-02 11:43:30,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:30,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-02 11:43:30,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693265262] [2020-12-02 11:43:30,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-02 11:43:30,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:30,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-02 11:43:30,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-12-02 11:43:30,408 INFO L87 Difference]: Start difference. First operand 2039 states and 7058 transitions. Second operand 13 states. [2020-12-02 11:43:31,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:31,384 INFO L93 Difference]: Finished difference Result 3018 states and 10169 transitions. [2020-12-02 11:43:31,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 11:43:31,385 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2020-12-02 11:43:31,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:31,392 INFO L225 Difference]: With dead ends: 3018 [2020-12-02 11:43:31,393 INFO L226 Difference]: Without dead ends: 2890 [2020-12-02 11:43:31,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2020-12-02 11:43:31,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-12-02 11:43:31,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1971. [2020-12-02 11:43:31,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2020-12-02 11:43:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 6882 transitions. [2020-12-02 11:43:31,429 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 6882 transitions. Word has length 24 [2020-12-02 11:43:31,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:31,429 INFO L481 AbstractCegarLoop]: Abstraction has 1971 states and 6882 transitions. [2020-12-02 11:43:31,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-02 11:43:31,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 6882 transitions. [2020-12-02 11:43:31,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 11:43:31,431 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:31,431 INFO L422 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] [2020-12-02 11:43:31,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-02 11:43:31,432 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:31,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:31,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1318319474, now seen corresponding path program 1 times [2020-12-02 11:43:31,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:31,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241607564] [2020-12-02 11:43:31,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:31,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:31,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241607564] [2020-12-02 11:43:31,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:31,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 11:43:31,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697082685] [2020-12-02 11:43:31,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 11:43:31,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:31,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 11:43:31,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-02 11:43:31,655 INFO L87 Difference]: Start difference. First operand 1971 states and 6882 transitions. Second operand 12 states. [2020-12-02 11:43:32,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:32,067 INFO L93 Difference]: Finished difference Result 3157 states and 10632 transitions. [2020-12-02 11:43:32,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 11:43:32,068 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-12-02 11:43:32,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:32,075 INFO L225 Difference]: With dead ends: 3157 [2020-12-02 11:43:32,075 INFO L226 Difference]: Without dead ends: 3133 [2020-12-02 11:43:32,075 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-02 11:43:32,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2020-12-02 11:43:32,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 1613. [2020-12-02 11:43:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2020-12-02 11:43:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 5563 transitions. [2020-12-02 11:43:32,108 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 5563 transitions. Word has length 24 [2020-12-02 11:43:32,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:32,108 INFO L481 AbstractCegarLoop]: Abstraction has 1613 states and 5563 transitions. [2020-12-02 11:43:32,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 11:43:32,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 5563 transitions. [2020-12-02 11:43:32,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-02 11:43:32,111 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:32,111 INFO L422 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] [2020-12-02 11:43:32,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-12-02 11:43:32,111 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:32,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:32,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1290250801, now seen corresponding path program 1 times [2020-12-02 11:43:32,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:32,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919481811] [2020-12-02 11:43:32,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:32,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:32,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919481811] [2020-12-02 11:43:32,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:32,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 11:43:32,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123683279] [2020-12-02 11:43:32,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 11:43:32,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:32,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 11:43:32,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-02 11:43:32,348 INFO L87 Difference]: Start difference. First operand 1613 states and 5563 transitions. Second operand 12 states. [2020-12-02 11:43:33,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:33,019 INFO L93 Difference]: Finished difference Result 2298 states and 7608 transitions. [2020-12-02 11:43:33,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 11:43:33,019 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-02 11:43:33,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:33,025 INFO L225 Difference]: With dead ends: 2298 [2020-12-02 11:43:33,025 INFO L226 Difference]: Without dead ends: 2254 [2020-12-02 11:43:33,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2020-12-02 11:43:33,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2020-12-02 11:43:33,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 1611. [2020-12-02 11:43:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2020-12-02 11:43:33,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 5567 transitions. [2020-12-02 11:43:33,063 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 5567 transitions. Word has length 26 [2020-12-02 11:43:33,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:33,064 INFO L481 AbstractCegarLoop]: Abstraction has 1611 states and 5567 transitions. [2020-12-02 11:43:33,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 11:43:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 5567 transitions. [2020-12-02 11:43:33,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-02 11:43:33,067 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:33,067 INFO L422 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] [2020-12-02 11:43:33,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-02 11:43:33,067 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:33,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:33,068 INFO L82 PathProgramCache]: Analyzing trace with hash -943856693, now seen corresponding path program 2 times [2020-12-02 11:43:33,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:33,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59176308] [2020-12-02 11:43:33,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:33,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:33,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59176308] [2020-12-02 11:43:33,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:33,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 11:43:33,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992754464] [2020-12-02 11:43:33,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 11:43:33,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:33,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 11:43:33,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-02 11:43:33,274 INFO L87 Difference]: Start difference. First operand 1611 states and 5567 transitions. Second operand 12 states. [2020-12-02 11:43:33,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:33,753 INFO L93 Difference]: Finished difference Result 2242 states and 7477 transitions. [2020-12-02 11:43:33,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 11:43:33,753 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-02 11:43:33,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:33,759 INFO L225 Difference]: With dead ends: 2242 [2020-12-02 11:43:33,759 INFO L226 Difference]: Without dead ends: 2198 [2020-12-02 11:43:33,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-02 11:43:33,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2020-12-02 11:43:33,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 1587. [2020-12-02 11:43:33,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-12-02 11:43:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 5509 transitions. [2020-12-02 11:43:33,786 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 5509 transitions. Word has length 26 [2020-12-02 11:43:33,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:33,786 INFO L481 AbstractCegarLoop]: Abstraction has 1587 states and 5509 transitions. [2020-12-02 11:43:33,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 11:43:33,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 5509 transitions. [2020-12-02 11:43:33,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-02 11:43:33,789 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:33,789 INFO L422 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] [2020-12-02 11:43:33,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-02 11:43:33,789 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:33,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:33,790 INFO L82 PathProgramCache]: Analyzing trace with hash -390835913, now seen corresponding path program 3 times [2020-12-02 11:43:33,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:33,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702034366] [2020-12-02 11:43:33,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:33,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:33,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702034366] [2020-12-02 11:43:33,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:33,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 11:43:33,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270635730] [2020-12-02 11:43:33,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 11:43:33,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:33,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 11:43:33,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-02 11:43:33,987 INFO L87 Difference]: Start difference. First operand 1587 states and 5509 transitions. Second operand 12 states. [2020-12-02 11:43:34,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:34,400 INFO L93 Difference]: Finished difference Result 1640 states and 5473 transitions. [2020-12-02 11:43:34,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 11:43:34,401 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-02 11:43:34,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:34,405 INFO L225 Difference]: With dead ends: 1640 [2020-12-02 11:43:34,406 INFO L226 Difference]: Without dead ends: 1596 [2020-12-02 11:43:34,406 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-02 11:43:34,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2020-12-02 11:43:34,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 885. [2020-12-02 11:43:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-12-02 11:43:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2020-12-02 11:43:34,433 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2020-12-02 11:43:34,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:34,434 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2020-12-02 11:43:34,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 11:43:34,434 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2020-12-02 11:43:34,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-02 11:43:34,437 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:34,438 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:34,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-12-02 11:43:34,438 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:34,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:34,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1977826857, now seen corresponding path program 1 times [2020-12-02 11:43:34,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:34,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349412872] [2020-12-02 11:43:34,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:34,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:34,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349412872] [2020-12-02 11:43:34,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:34,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 11:43:34,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215273137] [2020-12-02 11:43:34,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 11:43:34,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:34,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 11:43:34,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-02 11:43:34,581 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2020-12-02 11:43:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:34,790 INFO L93 Difference]: Finished difference Result 885 states and 3021 transitions. [2020-12-02 11:43:34,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 11:43:34,791 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-12-02 11:43:34,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:34,794 INFO L225 Difference]: With dead ends: 885 [2020-12-02 11:43:34,794 INFO L226 Difference]: Without dead ends: 885 [2020-12-02 11:43:34,794 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-12-02 11:43:34,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2020-12-02 11:43:34,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2020-12-02 11:43:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-12-02 11:43:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3021 transitions. [2020-12-02 11:43:34,817 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3021 transitions. Word has length 41 [2020-12-02 11:43:34,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:34,817 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3021 transitions. [2020-12-02 11:43:34,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 11:43:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3021 transitions. [2020-12-02 11:43:34,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-02 11:43:34,821 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:34,821 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:34,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-12-02 11:43:34,821 INFO L429 AbstractCegarLoop]: === Iteration 50 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:34,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:34,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1154622732, now seen corresponding path program 1 times [2020-12-02 11:43:34,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:34,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706420642] [2020-12-02 11:43:34,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:34,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:34,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706420642] [2020-12-02 11:43:34,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:34,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 11:43:34,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733501847] [2020-12-02 11:43:34,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 11:43:34,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:34,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 11:43:34,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-02 11:43:34,900 INFO L87 Difference]: Start difference. First operand 885 states and 3021 transitions. Second operand 7 states. [2020-12-02 11:43:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:35,032 INFO L93 Difference]: Finished difference Result 885 states and 3017 transitions. [2020-12-02 11:43:35,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 11:43:35,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-12-02 11:43:35,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:35,035 INFO L225 Difference]: With dead ends: 885 [2020-12-02 11:43:35,035 INFO L226 Difference]: Without dead ends: 741 [2020-12-02 11:43:35,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-12-02 11:43:35,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2020-12-02 11:43:35,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2020-12-02 11:43:35,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2020-12-02 11:43:35,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2489 transitions. [2020-12-02 11:43:35,047 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2489 transitions. Word has length 41 [2020-12-02 11:43:35,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:35,047 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 2489 transitions. [2020-12-02 11:43:35,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 11:43:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2489 transitions. [2020-12-02 11:43:35,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-02 11:43:35,049 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:35,049 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:35,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-02 11:43:35,049 INFO L429 AbstractCegarLoop]: === Iteration 51 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:35,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:35,049 INFO L82 PathProgramCache]: Analyzing trace with hash -267308717, now seen corresponding path program 1 times [2020-12-02 11:43:35,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:35,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509669748] [2020-12-02 11:43:35,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:35,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509669748] [2020-12-02 11:43:35,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:35,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 11:43:35,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665685216] [2020-12-02 11:43:35,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 11:43:35,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:35,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 11:43:35,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-02 11:43:35,182 INFO L87 Difference]: Start difference. First operand 741 states and 2489 transitions. Second operand 8 states. [2020-12-02 11:43:35,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:35,358 INFO L93 Difference]: Finished difference Result 741 states and 2481 transitions. [2020-12-02 11:43:35,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 11:43:35,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-12-02 11:43:35,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:35,361 INFO L225 Difference]: With dead ends: 741 [2020-12-02 11:43:35,361 INFO L226 Difference]: Without dead ends: 741 [2020-12-02 11:43:35,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-12-02 11:43:35,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2020-12-02 11:43:35,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2020-12-02 11:43:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2020-12-02 11:43:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2481 transitions. [2020-12-02 11:43:35,373 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2481 transitions. Word has length 41 [2020-12-02 11:43:35,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:35,373 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 2481 transitions. [2020-12-02 11:43:35,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 11:43:35,373 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2481 transitions. [2020-12-02 11:43:35,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-02 11:43:35,375 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:35,375 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:35,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-02 11:43:35,375 INFO L429 AbstractCegarLoop]: === Iteration 52 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:35,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:35,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1194300753, now seen corresponding path program 1 times [2020-12-02 11:43:35,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:35,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454821715] [2020-12-02 11:43:35,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:43:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:43:35,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454821715] [2020-12-02 11:43:35,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:43:35,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 11:43:35,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916220909] [2020-12-02 11:43:35,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 11:43:35,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:43:35,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 11:43:35,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-02 11:43:35,449 INFO L87 Difference]: Start difference. First operand 741 states and 2481 transitions. Second operand 7 states. [2020-12-02 11:43:35,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:43:35,560 INFO L93 Difference]: Finished difference Result 741 states and 2477 transitions. [2020-12-02 11:43:35,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 11:43:35,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-12-02 11:43:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:43:35,562 INFO L225 Difference]: With dead ends: 741 [2020-12-02 11:43:35,562 INFO L226 Difference]: Without dead ends: 495 [2020-12-02 11:43:35,563 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-12-02 11:43:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2020-12-02 11:43:35,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2020-12-02 11:43:35,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2020-12-02 11:43:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1606 transitions. [2020-12-02 11:43:35,574 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 1606 transitions. Word has length 41 [2020-12-02 11:43:35,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:43:35,574 INFO L481 AbstractCegarLoop]: Abstraction has 495 states and 1606 transitions. [2020-12-02 11:43:35,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 11:43:35,575 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 1606 transitions. [2020-12-02 11:43:35,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-02 11:43:35,576 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:43:35,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:43:35,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-12-02 11:43:35,577 INFO L429 AbstractCegarLoop]: === Iteration 53 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 11:43:35,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:43:35,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1766059350, now seen corresponding path program 1 times [2020-12-02 11:43:35,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:43:35,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915725421] [2020-12-02 11:43:35,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:43:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 11:43:35,596 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 11:43:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 11:43:35,619 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 11:43:35,657 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 11:43:35,657 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 11:43:35,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-12-02 11:43:35,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:43:35 BasicIcfg [2020-12-02 11:43:35,775 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 11:43:35,776 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 11:43:35,776 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 11:43:35,776 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 11:43:35,777 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:42:51" (3/4) ... [2020-12-02 11:43:35,779 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-02 11:43:35,881 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-02 11:43:35,882 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 11:43:35,883 INFO L168 Benchmark]: Toolchain (without parser) took 45780.71 ms. Allocated memory was 50.3 MB in the beginning and 1.7 GB in the end (delta: 1.7 GB). Free memory was 32.7 MB in the beginning and 1.0 GB in the end (delta: -984.7 MB). Peak memory consumption was 676.8 MB. Max. memory is 16.1 GB. [2020-12-02 11:43:35,883 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 41.9 MB. Free memory was 27.1 MB in the beginning and 27.1 MB in the end (delta: 24.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 11:43:35,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 983.60 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 32.5 MB in the beginning and 32.7 MB in the end (delta: -140.0 kB). Peak memory consumption was 20.9 MB. Max. memory is 16.1 GB. [2020-12-02 11:43:35,884 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.67 ms. Allocated memory is still 60.8 MB. Free memory was 32.7 MB in the beginning and 30.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 11:43:35,884 INFO L168 Benchmark]: Boogie Preprocessor took 70.17 ms. Allocated memory is still 60.8 MB. Free memory was 30.6 MB in the beginning and 28.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 11:43:35,885 INFO L168 Benchmark]: RCFGBuilder took 667.91 ms. Allocated memory is still 60.8 MB. Free memory was 28.7 MB in the beginning and 24.9 MB in the end (delta: 3.8 MB). Peak memory consumption was 16.3 MB. Max. memory is 16.1 GB. [2020-12-02 11:43:35,885 INFO L168 Benchmark]: TraceAbstraction took 43845.01 ms. Allocated memory was 60.8 MB in the beginning and 1.7 GB in the end (delta: 1.7 GB). Free memory was 24.9 MB in the beginning and 1.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 637.9 MB. Max. memory is 16.1 GB. [2020-12-02 11:43:35,886 INFO L168 Benchmark]: Witness Printer took 106.05 ms. Allocated memory is still 1.7 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-12-02 11:43:35,888 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.35 ms. Allocated memory is still 41.9 MB. Free memory was 27.1 MB in the beginning and 27.1 MB in the end (delta: 24.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 983.60 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 32.5 MB in the beginning and 32.7 MB in the end (delta: -140.0 kB). Peak memory consumption was 20.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 99.67 ms. Allocated memory is still 60.8 MB. Free memory was 32.7 MB in the beginning and 30.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 70.17 ms. Allocated memory is still 60.8 MB. Free memory was 30.6 MB in the beginning and 28.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 667.91 ms. Allocated memory is still 60.8 MB. Free memory was 28.7 MB in the beginning and 24.9 MB in the end (delta: 3.8 MB). Peak memory consumption was 16.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 43845.01 ms. Allocated memory was 60.8 MB in the beginning and 1.7 GB in the end (delta: 1.7 GB). Free memory was 24.9 MB in the beginning and 1.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 637.9 MB. Max. memory is 16.1 GB. * Witness Printer took 106.05 ms. Allocated memory is still 1.7 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 3374 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 42 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 1145 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.6s, 167 PlacesBefore, 93 PlacesAfterwards, 248 TransitionsBefore, 173 TransitionsAfterwards, 4156 CoEnabledTransitionPairs, 5 FixpointIterations, 27 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 49018 MoverChecksTotal - CounterExampleResult [Line: 1123]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1124] 0 char *v; [L1161] 0 pthread_t t; [L1162] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; [L1163] 0 \read(t) VAL [arg={0:0}, arg={0:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={0:0}] [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={0:0}] [L1148] 1 \read(t1) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={0:0}] [L1127] 2 v = malloc(sizeof(char)) [L1128] 2 return 0; [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1149] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1150] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1151] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1133] 5 v[0] = 'X' [L1135] 5 return 0; [L1133] 3 v[0] = 'X' [L1135] 3 return 0; [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1153] 1 \read(t2) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1154] 1 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1133] 6 v[0] = 'X' [L1135] 6 return 0; [L1140] 4 v[0] = 'Y' [L1142] 4 return 0; [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1155] 1 \read(t4) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1156] 1 \read(t5) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1163] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, v={6:0}] [L1164] 0 v[0] [L1123] COND TRUE 0 !expression [L1123] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, v={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 43.3s, OverallIterations: 53, TraceHistogramMax: 1, AutomataDifference: 23.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 5380 SDtfs, 11076 SDslu, 16167 SDs, 0 SdLazy, 10055 SolverSat, 1668 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 703 GetRequests, 60 SyntacticMatches, 18 SemanticMatches, 625 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4305occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.2s AutomataMinimizationTime, 52 MinimizatonAttempts, 47589 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1193 NumberOfCodeBlocks, 1193 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1100 ConstructedInterpolants, 0 QuantifiedInterpolants, 426321 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 52 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...