/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:38:16,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:38:16,327 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:38:16,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:38:16,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:38:16,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:38:16,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:38:16,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:38:16,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:38:16,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:38:16,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:38:16,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:38:16,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:38:16,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:38:16,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:38:16,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:38:16,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:38:16,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:38:16,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:38:16,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:38:16,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:38:16,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:38:16,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:38:16,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:38:16,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:38:16,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:38:16,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:38:16,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:38:16,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:38:16,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:38:16,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:38:16,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:38:16,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:38:16,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:38:16,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:38:16,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:38:16,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:38:16,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:38:16,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:38:16,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:38:16,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:38:16,403 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 19:38:16,423 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:38:16,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:38:16,425 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:38:16,426 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:38:16,426 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:38:16,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:38:16,426 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:38:16,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:38:16,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:38:16,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:38:16,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:38:16,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:38:16,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:38:16,429 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:38:16,429 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:38:16,429 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:38:16,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:38:16,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:38:16,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:38:16,430 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:38:16,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:38:16,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:38:16,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:38:16,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:38:16,431 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:38:16,431 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:38:16,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:38:16,432 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 19:38:16,432 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:38:16,432 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:38:16,713 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:38:16,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:38:16,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:38:16,735 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:38:16,735 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:38:16,736 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2019-12-18 19:38:16,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ea6bef4/7902b8350b8d4334b40c6d1a03a6a189/FLAGbd9a64b38 [2019-12-18 19:38:17,364 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:38:17,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2019-12-18 19:38:17,389 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ea6bef4/7902b8350b8d4334b40c6d1a03a6a189/FLAGbd9a64b38 [2019-12-18 19:38:17,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ea6bef4/7902b8350b8d4334b40c6d1a03a6a189 [2019-12-18 19:38:17,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:38:17,660 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:38:17,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:38:17,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:38:17,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:38:17,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:38:17" (1/1) ... [2019-12-18 19:38:17,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7de7976e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:17, skipping insertion in model container [2019-12-18 19:38:17,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:38:17" (1/1) ... [2019-12-18 19:38:17,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:38:17,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:38:18,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:38:18,443 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:38:18,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:38:18,690 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:38:18,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:18 WrapperNode [2019-12-18 19:38:18,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:38:18,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:38:18,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:38:18,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:38:18,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:18" (1/1) ... [2019-12-18 19:38:18,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:18" (1/1) ... [2019-12-18 19:38:18,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:38:18,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:38:18,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:38:18,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:38:18,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:18" (1/1) ... [2019-12-18 19:38:18,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:18" (1/1) ... [2019-12-18 19:38:18,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:18" (1/1) ... [2019-12-18 19:38:18,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:18" (1/1) ... [2019-12-18 19:38:18,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:18" (1/1) ... [2019-12-18 19:38:18,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:18" (1/1) ... [2019-12-18 19:38:18,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:18" (1/1) ... [2019-12-18 19:38:18,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:38:18,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:38:18,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:38:18,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:38:18,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:18" (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 [2019-12-18 19:38:18,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:38:18,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:38:18,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 19:38:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2019-12-18 19:38:18,846 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2019-12-18 19:38:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2019-12-18 19:38:18,846 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2019-12-18 19:38:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2019-12-18 19:38:18,847 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2019-12-18 19:38:18,847 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2019-12-18 19:38:18,847 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2019-12-18 19:38:18,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:38:18,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-18 19:38:18,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:38:18,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:38:18,850 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 19:38:19,329 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:38:19,330 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-18 19:38:19,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:38:19 BoogieIcfgContainer [2019-12-18 19:38:19,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:38:19,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:38:19,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:38:19,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:38:19,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:38:17" (1/3) ... [2019-12-18 19:38:19,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d0e6fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:38:19, skipping insertion in model container [2019-12-18 19:38:19,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:18" (2/3) ... [2019-12-18 19:38:19,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d0e6fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:38:19, skipping insertion in model container [2019-12-18 19:38:19,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:38:19" (3/3) ... [2019-12-18 19:38:19,341 INFO L109 eAbstractionObserver]: Analyzing ICFG singleton.i [2019-12-18 19:38:19,351 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:38:19,351 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:38:19,358 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-18 19:38:19,359 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:38:19,407 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,408 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,408 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,408 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,408 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,409 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,409 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,409 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,410 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,410 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,410 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,410 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,411 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,411 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,411 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,411 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,412 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,412 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,412 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,412 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,413 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,413 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,414 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,414 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,414 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,414 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,415 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,415 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,415 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,415 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,416 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,416 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,416 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,416 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,417 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,417 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,417 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,417 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,418 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,418 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,418 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,418 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,418 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,419 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,419 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,419 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,419 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,420 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,420 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,420 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,420 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,421 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,421 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,421 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,421 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,422 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,422 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,422 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,422 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,422 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,423 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,423 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,423 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,423 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,424 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,424 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,424 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,424 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,425 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,425 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,425 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,425 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,425 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,426 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,426 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,426 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,426 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,427 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,427 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,427 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,427 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,427 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,428 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,428 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,428 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,428 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,429 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,429 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,429 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,429 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,430 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,430 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,430 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,430 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,431 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,431 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,431 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,431 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,432 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,432 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,435 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,436 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,436 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,436 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,441 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,442 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,442 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,442 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,445 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,446 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,446 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,446 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,449 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,450 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,450 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,450 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,450 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,451 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,451 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,451 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,451 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,451 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,451 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,452 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,452 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,452 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,452 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,452 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,453 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,453 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,453 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,453 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,454 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,454 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,454 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,454 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,457 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,458 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,458 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,458 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,458 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,458 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,461 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,462 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,462 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,462 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,464 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,464 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,465 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,465 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,465 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,465 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,468 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,469 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,469 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,469 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,471 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,472 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,472 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,472 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,474 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,475 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,475 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,475 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,477 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,477 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,478 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,478 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:19,661 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-12-18 19:38:19,683 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:38:19,683 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:38:19,683 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:38:19,683 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:38:19,683 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:38:19,684 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:38:19,684 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:38:19,684 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:38:19,704 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 243 transitions [2019-12-18 19:38:19,707 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions [2019-12-18 19:38:19,825 INFO L126 PetriNetUnfolder]: 61/264 cut-off events. [2019-12-18 19:38:19,826 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:38:19,844 INFO L76 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs. 227/441 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2019-12-18 19:38:19,869 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions [2019-12-18 19:38:19,973 INFO L126 PetriNetUnfolder]: 61/264 cut-off events. [2019-12-18 19:38:19,973 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:38:19,979 INFO L76 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs. 227/441 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2019-12-18 19:38:19,992 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4038 [2019-12-18 19:38:19,994 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 19:38:21,762 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-18 19:38:21,880 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-18 19:38:22,136 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2242 [2019-12-18 19:38:22,137 INFO L214 etLargeBlockEncoding]: Total number of compositions: 74 [2019-12-18 19:38:22,140 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 99 places, 173 transitions [2019-12-18 19:38:22,689 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2019-12-18 19:38:22,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2019-12-18 19:38:22,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 19:38:22,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:22,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:22,700 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:22,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:22,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1385407457, now seen corresponding path program 1 times [2019-12-18 19:38:22,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:22,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975847060] [2019-12-18 19:38:22,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:23,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975847060] [2019-12-18 19:38:23,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:23,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:38:23,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716598802] [2019-12-18 19:38:23,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:38:23,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:23,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:38:23,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:38:23,154 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2019-12-18 19:38:23,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:23,531 INFO L93 Difference]: Finished difference Result 4760 states and 19900 transitions. [2019-12-18 19:38:23,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:38:23,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-18 19:38:23,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:23,620 INFO L225 Difference]: With dead ends: 4760 [2019-12-18 19:38:23,620 INFO L226 Difference]: Without dead ends: 4272 [2019-12-18 19:38:23,622 INFO L631 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 [2019-12-18 19:38:23,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2019-12-18 19:38:24,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 3018. [2019-12-18 19:38:24,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2019-12-18 19:38:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2019-12-18 19:38:24,032 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2019-12-18 19:38:24,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:24,035 INFO L462 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2019-12-18 19:38:24,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:38:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2019-12-18 19:38:24,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 19:38:24,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:24,044 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:24,045 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:24,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:24,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1192062693, now seen corresponding path program 2 times [2019-12-18 19:38:24,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:24,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836339019] [2019-12-18 19:38:24,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:24,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:24,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836339019] [2019-12-18 19:38:24,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:24,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:38:24,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219172873] [2019-12-18 19:38:24,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:38:24,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:24,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:38:24,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:38:24,164 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2019-12-18 19:38:24,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:24,596 INFO L93 Difference]: Finished difference Result 5518 states and 23821 transitions. [2019-12-18 19:38:24,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:38:24,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-18 19:38:24,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:24,666 INFO L225 Difference]: With dead ends: 5518 [2019-12-18 19:38:24,666 INFO L226 Difference]: Without dead ends: 5518 [2019-12-18 19:38:24,667 INFO L631 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 [2019-12-18 19:38:24,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2019-12-18 19:38:24,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 3008. [2019-12-18 19:38:24,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2019-12-18 19:38:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2019-12-18 19:38:24,877 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2019-12-18 19:38:24,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:24,877 INFO L462 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2019-12-18 19:38:24,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:38:24,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2019-12-18 19:38:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 19:38:24,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:24,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:24,879 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:24,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:24,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1538202320, now seen corresponding path program 1 times [2019-12-18 19:38:24,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:24,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60192824] [2019-12-18 19:38:24,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:24,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60192824] [2019-12-18 19:38:24,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:24,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:38:24,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957899110] [2019-12-18 19:38:24,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:38:24,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:24,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:38:24,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:38:24,970 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2019-12-18 19:38:25,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:25,056 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2019-12-18 19:38:25,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:38:25,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 19:38:25,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:25,101 INFO L225 Difference]: With dead ends: 4848 [2019-12-18 19:38:25,102 INFO L226 Difference]: Without dead ends: 3558 [2019-12-18 19:38:25,102 INFO L631 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 [2019-12-18 19:38:25,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2019-12-18 19:38:25,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2019-12-18 19:38:25,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2019-12-18 19:38:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2019-12-18 19:38:25,307 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2019-12-18 19:38:25,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:25,308 INFO L462 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2019-12-18 19:38:25,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:38:25,308 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2019-12-18 19:38:25,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:38:25,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:25,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:25,311 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:25,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:25,312 INFO L82 PathProgramCache]: Analyzing trace with hash 439630726, now seen corresponding path program 1 times [2019-12-18 19:38:25,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:25,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748252305] [2019-12-18 19:38:25,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:25,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:25,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748252305] [2019-12-18 19:38:25,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:25,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:38:25,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671185277] [2019-12-18 19:38:25,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:38:25,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:25,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:38:25,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:38:25,433 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 7 states. [2019-12-18 19:38:25,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:25,726 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2019-12-18 19:38:25,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:38:25,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-18 19:38:25,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:25,745 INFO L225 Difference]: With dead ends: 4417 [2019-12-18 19:38:25,745 INFO L226 Difference]: Without dead ends: 4393 [2019-12-18 19:38:25,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:38:25,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2019-12-18 19:38:25,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2019-12-18 19:38:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-12-18 19:38:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2019-12-18 19:38:25,874 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2019-12-18 19:38:25,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:25,875 INFO L462 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2019-12-18 19:38:25,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:38:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2019-12-18 19:38:25,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:38:25,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:25,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:25,877 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:25,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:25,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1784829996, now seen corresponding path program 2 times [2019-12-18 19:38:25,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:25,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586040101] [2019-12-18 19:38:25,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:25,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586040101] [2019-12-18 19:38:25,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:25,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:38:25,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003357594] [2019-12-18 19:38:25,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:38:25,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:25,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:38:25,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:38:25,944 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2019-12-18 19:38:26,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:26,122 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2019-12-18 19:38:26,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:38:26,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-18 19:38:26,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:26,145 INFO L225 Difference]: With dead ends: 4024 [2019-12-18 19:38:26,146 INFO L226 Difference]: Without dead ends: 4024 [2019-12-18 19:38:26,146 INFO L631 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 [2019-12-18 19:38:26,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2019-12-18 19:38:26,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2019-12-18 19:38:26,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2019-12-18 19:38:26,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2019-12-18 19:38:26,378 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2019-12-18 19:38:26,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:26,378 INFO L462 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2019-12-18 19:38:26,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:38:26,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2019-12-18 19:38:26,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 19:38:26,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:26,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:26,385 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:26,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:26,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2096337026, now seen corresponding path program 1 times [2019-12-18 19:38:26,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:26,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438860179] [2019-12-18 19:38:26,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:26,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438860179] [2019-12-18 19:38:26,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:26,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:38:26,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258271084] [2019-12-18 19:38:26,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:38:26,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:26,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:38:26,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:38:26,496 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 7 states. [2019-12-18 19:38:26,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:26,704 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2019-12-18 19:38:26,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:38:26,705 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-18 19:38:26,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:26,722 INFO L225 Difference]: With dead ends: 4225 [2019-12-18 19:38:26,722 INFO L226 Difference]: Without dead ends: 4129 [2019-12-18 19:38:26,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:38:26,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2019-12-18 19:38:26,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2019-12-18 19:38:26,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2019-12-18 19:38:26,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2019-12-18 19:38:26,846 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2019-12-18 19:38:26,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:26,846 INFO L462 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2019-12-18 19:38:26,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:38:26,847 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2019-12-18 19:38:26,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 19:38:26,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:26,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:26,848 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:26,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:26,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1440753652, now seen corresponding path program 2 times [2019-12-18 19:38:26,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:26,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257265350] [2019-12-18 19:38:26,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:26,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257265350] [2019-12-18 19:38:26,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:26,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:38:26,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207265304] [2019-12-18 19:38:26,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:38:26,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:26,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:38:26,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:38:26,931 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 8 states. [2019-12-18 19:38:27,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:27,266 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2019-12-18 19:38:27,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:38:27,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-12-18 19:38:27,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:27,661 INFO L225 Difference]: With dead ends: 4979 [2019-12-18 19:38:27,661 INFO L226 Difference]: Without dead ends: 4905 [2019-12-18 19:38:27,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:38:27,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2019-12-18 19:38:27,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2019-12-18 19:38:27,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2019-12-18 19:38:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2019-12-18 19:38:27,794 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2019-12-18 19:38:27,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:27,795 INFO L462 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2019-12-18 19:38:27,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:38:27,795 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2019-12-18 19:38:27,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 19:38:27,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:27,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:27,797 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:27,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:27,797 INFO L82 PathProgramCache]: Analyzing trace with hash 2054209068, now seen corresponding path program 3 times [2019-12-18 19:38:27,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:27,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745038503] [2019-12-18 19:38:27,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:27,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:27,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745038503] [2019-12-18 19:38:27,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:27,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 19:38:27,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054616679] [2019-12-18 19:38:27,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:38:27,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:27,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:38:27,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:38:27,917 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 9 states. [2019-12-18 19:38:28,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:28,349 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2019-12-18 19:38:28,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:38:28,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-12-18 19:38:28,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:28,376 INFO L225 Difference]: With dead ends: 6735 [2019-12-18 19:38:28,377 INFO L226 Difference]: Without dead ends: 6661 [2019-12-18 19:38:28,377 INFO L631 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 [2019-12-18 19:38:28,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2019-12-18 19:38:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2019-12-18 19:38:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2019-12-18 19:38:28,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2019-12-18 19:38:28,541 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2019-12-18 19:38:28,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:28,542 INFO L462 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2019-12-18 19:38:28,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:38:28,542 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2019-12-18 19:38:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 19:38:28,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:28,544 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:28,544 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:28,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:28,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1150446370, now seen corresponding path program 4 times [2019-12-18 19:38:28,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:28,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621270262] [2019-12-18 19:38:28,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:28,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:28,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621270262] [2019-12-18 19:38:28,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:28,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 19:38:28,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709875561] [2019-12-18 19:38:28,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 19:38:28,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:28,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 19:38:28,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:38:28,713 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 10 states. [2019-12-18 19:38:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:29,257 INFO L93 Difference]: Finished difference Result 5374 states and 21882 transitions. [2019-12-18 19:38:29,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:38:29,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-12-18 19:38:29,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:29,272 INFO L225 Difference]: With dead ends: 5374 [2019-12-18 19:38:29,273 INFO L226 Difference]: Without dead ends: 5300 [2019-12-18 19:38:29,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:38:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5300 states. [2019-12-18 19:38:29,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5300 to 4114. [2019-12-18 19:38:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4114 states. [2019-12-18 19:38:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4114 states to 4114 states and 16572 transitions. [2019-12-18 19:38:29,408 INFO L78 Accepts]: Start accepts. Automaton has 4114 states and 16572 transitions. Word has length 18 [2019-12-18 19:38:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:29,410 INFO L462 AbstractCegarLoop]: Abstraction has 4114 states and 16572 transitions. [2019-12-18 19:38:29,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 19:38:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4114 states and 16572 transitions. [2019-12-18 19:38:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:38:29,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:29,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:29,412 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:29,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:29,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1529508729, now seen corresponding path program 1 times [2019-12-18 19:38:29,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:29,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649278848] [2019-12-18 19:38:29,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:29,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:29,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649278848] [2019-12-18 19:38:29,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:29,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:38:29,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125991955] [2019-12-18 19:38:29,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:38:29,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:29,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:38:29,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:38:29,498 INFO L87 Difference]: Start difference. First operand 4114 states and 16572 transitions. Second operand 7 states. [2019-12-18 19:38:29,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:29,630 INFO L93 Difference]: Finished difference Result 4623 states and 18113 transitions. [2019-12-18 19:38:29,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:38:29,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 19:38:29,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:29,642 INFO L225 Difference]: With dead ends: 4623 [2019-12-18 19:38:29,642 INFO L226 Difference]: Without dead ends: 4623 [2019-12-18 19:38:29,642 INFO L631 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 [2019-12-18 19:38:29,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4623 states. [2019-12-18 19:38:29,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4623 to 4076. [2019-12-18 19:38:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4076 states. [2019-12-18 19:38:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 16430 transitions. [2019-12-18 19:38:29,758 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 16430 transitions. Word has length 19 [2019-12-18 19:38:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:29,759 INFO L462 AbstractCegarLoop]: Abstraction has 4076 states and 16430 transitions. [2019-12-18 19:38:29,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:38:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 16430 transitions. [2019-12-18 19:38:29,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:38:29,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:29,761 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:29,761 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:29,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:29,762 INFO L82 PathProgramCache]: Analyzing trace with hash 386755117, now seen corresponding path program 1 times [2019-12-18 19:38:29,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:29,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997258872] [2019-12-18 19:38:29,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:29,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997258872] [2019-12-18 19:38:29,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:29,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 19:38:29,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141465676] [2019-12-18 19:38:29,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:38:29,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:29,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:38:29,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:38:29,965 INFO L87 Difference]: Start difference. First operand 4076 states and 16430 transitions. Second operand 11 states. [2019-12-18 19:38:30,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:30,659 INFO L93 Difference]: Finished difference Result 5825 states and 24230 transitions. [2019-12-18 19:38:30,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:38:30,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-12-18 19:38:30,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:30,673 INFO L225 Difference]: With dead ends: 5825 [2019-12-18 19:38:30,674 INFO L226 Difference]: Without dead ends: 5751 [2019-12-18 19:38:30,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:38:30,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5751 states. [2019-12-18 19:38:30,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5751 to 4013. [2019-12-18 19:38:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4013 states. [2019-12-18 19:38:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 16198 transitions. [2019-12-18 19:38:30,799 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 16198 transitions. Word has length 19 [2019-12-18 19:38:30,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:30,799 INFO L462 AbstractCegarLoop]: Abstraction has 4013 states and 16198 transitions. [2019-12-18 19:38:30,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:38:30,799 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 16198 transitions. [2019-12-18 19:38:30,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 19:38:30,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:30,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:30,802 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:30,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:30,802 INFO L82 PathProgramCache]: Analyzing trace with hash 169969073, now seen corresponding path program 1 times [2019-12-18 19:38:30,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:30,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534268485] [2019-12-18 19:38:30,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:30,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534268485] [2019-12-18 19:38:30,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:30,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 19:38:30,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641967192] [2019-12-18 19:38:30,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 19:38:30,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:30,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 19:38:30,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:38:30,939 INFO L87 Difference]: Start difference. First operand 4013 states and 16198 transitions. Second operand 10 states. [2019-12-18 19:38:31,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:31,490 INFO L93 Difference]: Finished difference Result 5428 states and 21853 transitions. [2019-12-18 19:38:31,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:38:31,490 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-18 19:38:31,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:31,503 INFO L225 Difference]: With dead ends: 5428 [2019-12-18 19:38:31,503 INFO L226 Difference]: Without dead ends: 5382 [2019-12-18 19:38:31,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:38:31,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5382 states. [2019-12-18 19:38:31,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5382 to 4166. [2019-12-18 19:38:31,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4166 states. [2019-12-18 19:38:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 16924 transitions. [2019-12-18 19:38:31,663 INFO L78 Accepts]: Start accepts. Automaton has 4166 states and 16924 transitions. Word has length 20 [2019-12-18 19:38:31,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:31,664 INFO L462 AbstractCegarLoop]: Abstraction has 4166 states and 16924 transitions. [2019-12-18 19:38:31,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 19:38:31,664 INFO L276 IsEmpty]: Start isEmpty. Operand 4166 states and 16924 transitions. [2019-12-18 19:38:31,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 19:38:31,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:31,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:31,669 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:31,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:31,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1932078158, now seen corresponding path program 1 times [2019-12-18 19:38:31,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:31,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119820485] [2019-12-18 19:38:31,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:31,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119820485] [2019-12-18 19:38:31,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:31,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 19:38:31,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108949737] [2019-12-18 19:38:31,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 19:38:31,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:31,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 19:38:31,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:38:31,853 INFO L87 Difference]: Start difference. First operand 4166 states and 16924 transitions. Second operand 10 states. [2019-12-18 19:38:31,977 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2019-12-18 19:38:32,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:32,578 INFO L93 Difference]: Finished difference Result 5500 states and 22434 transitions. [2019-12-18 19:38:32,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:38:32,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-18 19:38:32,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:32,593 INFO L225 Difference]: With dead ends: 5500 [2019-12-18 19:38:32,594 INFO L226 Difference]: Without dead ends: 5454 [2019-12-18 19:38:32,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:38:32,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5454 states. [2019-12-18 19:38:32,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5454 to 4012. [2019-12-18 19:38:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4012 states. [2019-12-18 19:38:32,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4012 states to 4012 states and 16195 transitions. [2019-12-18 19:38:32,716 INFO L78 Accepts]: Start accepts. Automaton has 4012 states and 16195 transitions. Word has length 20 [2019-12-18 19:38:32,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:32,719 INFO L462 AbstractCegarLoop]: Abstraction has 4012 states and 16195 transitions. [2019-12-18 19:38:32,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 19:38:32,719 INFO L276 IsEmpty]: Start isEmpty. Operand 4012 states and 16195 transitions. [2019-12-18 19:38:32,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 19:38:32,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:32,724 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:32,724 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:32,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:32,724 INFO L82 PathProgramCache]: Analyzing trace with hash -944906415, now seen corresponding path program 2 times [2019-12-18 19:38:32,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:32,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327700599] [2019-12-18 19:38:32,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:32,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327700599] [2019-12-18 19:38:32,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:32,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 19:38:32,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599505197] [2019-12-18 19:38:32,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 19:38:32,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:32,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 19:38:32,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:38:32,956 INFO L87 Difference]: Start difference. First operand 4012 states and 16195 transitions. Second operand 10 states. [2019-12-18 19:38:33,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:33,655 INFO L93 Difference]: Finished difference Result 5781 states and 23394 transitions. [2019-12-18 19:38:33,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:38:33,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-18 19:38:33,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:33,671 INFO L225 Difference]: With dead ends: 5781 [2019-12-18 19:38:33,672 INFO L226 Difference]: Without dead ends: 5735 [2019-12-18 19:38:33,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:38:33,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5735 states. [2019-12-18 19:38:33,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5735 to 4148. [2019-12-18 19:38:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4148 states. [2019-12-18 19:38:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4148 states to 4148 states and 16836 transitions. [2019-12-18 19:38:33,794 INFO L78 Accepts]: Start accepts. Automaton has 4148 states and 16836 transitions. Word has length 20 [2019-12-18 19:38:33,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:33,794 INFO L462 AbstractCegarLoop]: Abstraction has 4148 states and 16836 transitions. [2019-12-18 19:38:33,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 19:38:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 4148 states and 16836 transitions. [2019-12-18 19:38:33,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 19:38:33,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:33,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:33,797 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:33,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:33,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1562884562, now seen corresponding path program 2 times [2019-12-18 19:38:33,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:33,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737729617] [2019-12-18 19:38:33,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:34,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737729617] [2019-12-18 19:38:34,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:34,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 19:38:34,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227906234] [2019-12-18 19:38:34,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 19:38:34,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:34,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 19:38:34,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:38:34,027 INFO L87 Difference]: Start difference. First operand 4148 states and 16836 transitions. Second operand 10 states. [2019-12-18 19:38:34,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:34,701 INFO L93 Difference]: Finished difference Result 6399 states and 26032 transitions. [2019-12-18 19:38:34,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 19:38:34,702 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-18 19:38:34,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:34,717 INFO L225 Difference]: With dead ends: 6399 [2019-12-18 19:38:34,717 INFO L226 Difference]: Without dead ends: 6353 [2019-12-18 19:38:34,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:38:34,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6353 states. [2019-12-18 19:38:34,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6353 to 3978. [2019-12-18 19:38:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3978 states. [2019-12-18 19:38:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 16074 transitions. [2019-12-18 19:38:34,825 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 16074 transitions. Word has length 20 [2019-12-18 19:38:34,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:34,826 INFO L462 AbstractCegarLoop]: Abstraction has 3978 states and 16074 transitions. [2019-12-18 19:38:34,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 19:38:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 16074 transitions. [2019-12-18 19:38:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 19:38:34,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:34,828 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:34,828 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:34,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:34,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1961766501, now seen corresponding path program 3 times [2019-12-18 19:38:34,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:34,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637413293] [2019-12-18 19:38:34,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:34,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637413293] [2019-12-18 19:38:34,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:34,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:38:34,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39524810] [2019-12-18 19:38:34,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:38:34,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:34,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:38:34,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:38:34,931 INFO L87 Difference]: Start difference. First operand 3978 states and 16074 transitions. Second operand 8 states. [2019-12-18 19:38:35,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:35,312 INFO L93 Difference]: Finished difference Result 6325 states and 25457 transitions. [2019-12-18 19:38:35,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:38:35,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-12-18 19:38:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:35,329 INFO L225 Difference]: With dead ends: 6325 [2019-12-18 19:38:35,329 INFO L226 Difference]: Without dead ends: 6279 [2019-12-18 19:38:35,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:38:35,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6279 states. [2019-12-18 19:38:35,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6279 to 3948. [2019-12-18 19:38:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2019-12-18 19:38:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 16005 transitions. [2019-12-18 19:38:35,421 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 16005 transitions. Word has length 20 [2019-12-18 19:38:35,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:35,422 INFO L462 AbstractCegarLoop]: Abstraction has 3948 states and 16005 transitions. [2019-12-18 19:38:35,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:38:35,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 16005 transitions. [2019-12-18 19:38:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:38:35,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:35,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:35,425 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:35,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:35,425 INFO L82 PathProgramCache]: Analyzing trace with hash 2117723117, now seen corresponding path program 1 times [2019-12-18 19:38:35,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:35,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758868858] [2019-12-18 19:38:35,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:35,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758868858] [2019-12-18 19:38:35,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:35,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:38:35,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901058804] [2019-12-18 19:38:35,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:38:35,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:35,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:38:35,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:38:35,476 INFO L87 Difference]: Start difference. First operand 3948 states and 16005 transitions. Second operand 7 states. [2019-12-18 19:38:35,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:35,663 INFO L93 Difference]: Finished difference Result 4727 states and 18672 transitions. [2019-12-18 19:38:35,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:38:35,664 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-12-18 19:38:35,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:35,675 INFO L225 Difference]: With dead ends: 4727 [2019-12-18 19:38:35,675 INFO L226 Difference]: Without dead ends: 4652 [2019-12-18 19:38:35,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:38:35,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4652 states. [2019-12-18 19:38:35,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4652 to 4270. [2019-12-18 19:38:35,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4270 states. [2019-12-18 19:38:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4270 states to 4270 states and 17192 transitions. [2019-12-18 19:38:35,777 INFO L78 Accepts]: Start accepts. Automaton has 4270 states and 17192 transitions. Word has length 21 [2019-12-18 19:38:35,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:35,777 INFO L462 AbstractCegarLoop]: Abstraction has 4270 states and 17192 transitions. [2019-12-18 19:38:35,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:38:35,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4270 states and 17192 transitions. [2019-12-18 19:38:35,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:38:35,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:35,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:35,782 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:35,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:35,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1335103446, now seen corresponding path program 1 times [2019-12-18 19:38:35,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:35,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408844270] [2019-12-18 19:38:35,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:35,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:35,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408844270] [2019-12-18 19:38:35,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:35,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:38:35,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642772684] [2019-12-18 19:38:35,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:38:35,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:35,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:38:35,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:38:35,914 INFO L87 Difference]: Start difference. First operand 4270 states and 17192 transitions. Second operand 8 states. [2019-12-18 19:38:36,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:36,084 INFO L93 Difference]: Finished difference Result 4820 states and 18862 transitions. [2019-12-18 19:38:36,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:38:36,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-12-18 19:38:36,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:36,096 INFO L225 Difference]: With dead ends: 4820 [2019-12-18 19:38:36,096 INFO L226 Difference]: Without dead ends: 4296 [2019-12-18 19:38:36,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:38:36,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2019-12-18 19:38:36,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 3680. [2019-12-18 19:38:36,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3680 states. [2019-12-18 19:38:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 14531 transitions. [2019-12-18 19:38:36,202 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 14531 transitions. Word has length 21 [2019-12-18 19:38:36,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:36,202 INFO L462 AbstractCegarLoop]: Abstraction has 3680 states and 14531 transitions. [2019-12-18 19:38:36,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:38:36,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 14531 transitions. [2019-12-18 19:38:36,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:38:36,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:36,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:36,206 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:36,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:36,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1959403642, now seen corresponding path program 1 times [2019-12-18 19:38:36,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:36,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612800290] [2019-12-18 19:38:36,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:36,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:36,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612800290] [2019-12-18 19:38:36,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:36,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 19:38:36,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544290777] [2019-12-18 19:38:36,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:38:36,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:36,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:38:36,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:38:36,432 INFO L87 Difference]: Start difference. First operand 3680 states and 14531 transitions. Second operand 11 states. [2019-12-18 19:38:37,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:37,034 INFO L93 Difference]: Finished difference Result 4556 states and 17623 transitions. [2019-12-18 19:38:37,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:38:37,035 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-18 19:38:37,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:37,047 INFO L225 Difference]: With dead ends: 4556 [2019-12-18 19:38:37,047 INFO L226 Difference]: Without dead ends: 4507 [2019-12-18 19:38:37,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:38:37,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2019-12-18 19:38:37,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 3330. [2019-12-18 19:38:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3330 states. [2019-12-18 19:38:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 12802 transitions. [2019-12-18 19:38:37,123 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 12802 transitions. Word has length 21 [2019-12-18 19:38:37,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:37,123 INFO L462 AbstractCegarLoop]: Abstraction has 3330 states and 12802 transitions. [2019-12-18 19:38:37,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:38:37,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 12802 transitions. [2019-12-18 19:38:37,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:38:37,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:37,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:37,125 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:37,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:37,125 INFO L82 PathProgramCache]: Analyzing trace with hash -430854838, now seen corresponding path program 1 times [2019-12-18 19:38:37,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:37,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997680106] [2019-12-18 19:38:37,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:37,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997680106] [2019-12-18 19:38:37,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:37,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 19:38:37,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063388044] [2019-12-18 19:38:37,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 19:38:37,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:37,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 19:38:37,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:38:37,414 INFO L87 Difference]: Start difference. First operand 3330 states and 12802 transitions. Second operand 12 states. [2019-12-18 19:38:37,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:37,926 INFO L93 Difference]: Finished difference Result 3991 states and 15112 transitions. [2019-12-18 19:38:37,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:38:37,926 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-18 19:38:37,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:37,937 INFO L225 Difference]: With dead ends: 3991 [2019-12-18 19:38:37,938 INFO L226 Difference]: Without dead ends: 3835 [2019-12-18 19:38:37,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:38:37,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2019-12-18 19:38:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 2831. [2019-12-18 19:38:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2019-12-18 19:38:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2019-12-18 19:38:38,006 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2019-12-18 19:38:38,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:38,007 INFO L462 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2019-12-18 19:38:38,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 19:38:38,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2019-12-18 19:38:38,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:38:38,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:38,010 INFO L411 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] [2019-12-18 19:38:38,011 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:38,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:38,011 INFO L82 PathProgramCache]: Analyzing trace with hash 641940987, now seen corresponding path program 1 times [2019-12-18 19:38:38,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:38,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780019049] [2019-12-18 19:38:38,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:38,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:38,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780019049] [2019-12-18 19:38:38,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:38,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:38:38,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133936808] [2019-12-18 19:38:38,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:38:38,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:38,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:38:38,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:38:38,125 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 8 states. [2019-12-18 19:38:38,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:38,401 INFO L93 Difference]: Finished difference Result 3550 states and 13085 transitions. [2019-12-18 19:38:38,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:38:38,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-18 19:38:38,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:38,409 INFO L225 Difference]: With dead ends: 3550 [2019-12-18 19:38:38,409 INFO L226 Difference]: Without dead ends: 3490 [2019-12-18 19:38:38,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:38:38,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2019-12-18 19:38:38,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2828. [2019-12-18 19:38:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2019-12-18 19:38:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 10620 transitions. [2019-12-18 19:38:38,497 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 10620 transitions. Word has length 22 [2019-12-18 19:38:38,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:38,498 INFO L462 AbstractCegarLoop]: Abstraction has 2828 states and 10620 transitions. [2019-12-18 19:38:38,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:38:38,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 10620 transitions. [2019-12-18 19:38:38,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:38:38,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:38,500 INFO L411 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] [2019-12-18 19:38:38,500 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:38,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:38,501 INFO L82 PathProgramCache]: Analyzing trace with hash -109833189, now seen corresponding path program 2 times [2019-12-18 19:38:38,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:38,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35436772] [2019-12-18 19:38:38,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:38,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35436772] [2019-12-18 19:38:38,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:38,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 19:38:38,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083364993] [2019-12-18 19:38:38,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:38:38,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:38,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:38:38,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:38:38,602 INFO L87 Difference]: Start difference. First operand 2828 states and 10620 transitions. Second operand 9 states. [2019-12-18 19:38:38,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:38,832 INFO L93 Difference]: Finished difference Result 3540 states and 13065 transitions. [2019-12-18 19:38:38,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:38:38,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-18 19:38:38,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:38,841 INFO L225 Difference]: With dead ends: 3540 [2019-12-18 19:38:38,841 INFO L226 Difference]: Without dead ends: 3480 [2019-12-18 19:38:38,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:38:38,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2019-12-18 19:38:38,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 2822. [2019-12-18 19:38:38,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-12-18 19:38:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2019-12-18 19:38:38,888 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2019-12-18 19:38:38,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:38,888 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2019-12-18 19:38:38,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:38:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2019-12-18 19:38:38,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:38:38,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:38,890 INFO L411 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] [2019-12-18 19:38:38,890 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:38,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:38,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1541949331, now seen corresponding path program 3 times [2019-12-18 19:38:38,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:38,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306976729] [2019-12-18 19:38:38,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:39,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306976729] [2019-12-18 19:38:39,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:39,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 19:38:39,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476731986] [2019-12-18 19:38:39,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 19:38:39,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:39,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 19:38:39,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:38:39,020 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 10 states. [2019-12-18 19:38:39,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:39,374 INFO L93 Difference]: Finished difference Result 3525 states and 13034 transitions. [2019-12-18 19:38:39,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:38:39,374 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-18 19:38:39,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:39,382 INFO L225 Difference]: With dead ends: 3525 [2019-12-18 19:38:39,382 INFO L226 Difference]: Without dead ends: 3465 [2019-12-18 19:38:39,383 INFO L631 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 [2019-12-18 19:38:39,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2019-12-18 19:38:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 2822. [2019-12-18 19:38:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-12-18 19:38:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2019-12-18 19:38:39,433 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2019-12-18 19:38:39,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:39,433 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2019-12-18 19:38:39,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 19:38:39,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2019-12-18 19:38:39,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:38:39,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:39,436 INFO L411 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] [2019-12-18 19:38:39,436 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:39,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:39,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1025373391, now seen corresponding path program 4 times [2019-12-18 19:38:39,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:39,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655797143] [2019-12-18 19:38:39,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:39,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655797143] [2019-12-18 19:38:39,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:39,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 19:38:39,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741370823] [2019-12-18 19:38:39,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:38:39,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:39,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:38:39,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:38:39,647 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 11 states. [2019-12-18 19:38:40,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:40,108 INFO L93 Difference]: Finished difference Result 3740 states and 13820 transitions. [2019-12-18 19:38:40,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:38:40,109 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-12-18 19:38:40,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:40,117 INFO L225 Difference]: With dead ends: 3740 [2019-12-18 19:38:40,117 INFO L226 Difference]: Without dead ends: 3680 [2019-12-18 19:38:40,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:38:40,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2019-12-18 19:38:40,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 2822. [2019-12-18 19:38:40,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-12-18 19:38:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10603 transitions. [2019-12-18 19:38:40,166 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10603 transitions. Word has length 22 [2019-12-18 19:38:40,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:40,167 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 10603 transitions. [2019-12-18 19:38:40,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:38:40,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10603 transitions. [2019-12-18 19:38:40,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:38:40,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:40,169 INFO L411 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] [2019-12-18 19:38:40,170 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:40,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:40,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1258119955, now seen corresponding path program 5 times [2019-12-18 19:38:40,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:40,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808838899] [2019-12-18 19:38:40,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:40,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808838899] [2019-12-18 19:38:40,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:40,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 19:38:40,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189103556] [2019-12-18 19:38:40,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 19:38:40,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:40,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 19:38:40,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:38:40,295 INFO L87 Difference]: Start difference. First operand 2822 states and 10603 transitions. Second operand 10 states. [2019-12-18 19:38:40,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:40,687 INFO L93 Difference]: Finished difference Result 4237 states and 15414 transitions. [2019-12-18 19:38:40,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:38:40,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-18 19:38:40,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:40,697 INFO L225 Difference]: With dead ends: 4237 [2019-12-18 19:38:40,697 INFO L226 Difference]: Without dead ends: 4177 [2019-12-18 19:38:40,698 INFO L631 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 [2019-12-18 19:38:40,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4177 states. [2019-12-18 19:38:40,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4177 to 2670. [2019-12-18 19:38:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2019-12-18 19:38:40,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2019-12-18 19:38:40,744 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2019-12-18 19:38:40,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:40,744 INFO L462 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2019-12-18 19:38:40,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 19:38:40,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2019-12-18 19:38:40,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:38:40,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:40,747 INFO L411 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] [2019-12-18 19:38:40,747 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:40,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:40,747 INFO L82 PathProgramCache]: Analyzing trace with hash -230669277, now seen corresponding path program 1 times [2019-12-18 19:38:40,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:40,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771990655] [2019-12-18 19:38:40,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:41,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771990655] [2019-12-18 19:38:41,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:41,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 19:38:41,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758649447] [2019-12-18 19:38:41,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 19:38:41,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:41,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 19:38:41,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:38:41,047 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2019-12-18 19:38:41,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:41,565 INFO L93 Difference]: Finished difference Result 3103 states and 11113 transitions. [2019-12-18 19:38:41,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:38:41,566 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-18 19:38:41,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:41,573 INFO L225 Difference]: With dead ends: 3103 [2019-12-18 19:38:41,573 INFO L226 Difference]: Without dead ends: 3007 [2019-12-18 19:38:41,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:38:41,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2019-12-18 19:38:41,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2170. [2019-12-18 19:38:41,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-12-18 19:38:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 7789 transitions. [2019-12-18 19:38:41,608 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 7789 transitions. Word has length 23 [2019-12-18 19:38:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:41,609 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 7789 transitions. [2019-12-18 19:38:41,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 19:38:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 7789 transitions. [2019-12-18 19:38:41,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:38:41,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:41,611 INFO L411 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] [2019-12-18 19:38:41,612 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:41,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:41,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1022800040, now seen corresponding path program 1 times [2019-12-18 19:38:41,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:41,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066378659] [2019-12-18 19:38:41,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:41,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:41,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066378659] [2019-12-18 19:38:41,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:41,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 19:38:41,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996950866] [2019-12-18 19:38:41,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:38:41,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:41,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:38:41,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:38:41,822 INFO L87 Difference]: Start difference. First operand 2170 states and 7789 transitions. Second operand 11 states. [2019-12-18 19:38:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:42,316 INFO L93 Difference]: Finished difference Result 3115 states and 11153 transitions. [2019-12-18 19:38:42,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:38:42,321 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-18 19:38:42,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:42,328 INFO L225 Difference]: With dead ends: 3115 [2019-12-18 19:38:42,328 INFO L226 Difference]: Without dead ends: 3058 [2019-12-18 19:38:42,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:38:42,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2019-12-18 19:38:42,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2130. [2019-12-18 19:38:42,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-12-18 19:38:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 7633 transitions. [2019-12-18 19:38:42,362 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 7633 transitions. Word has length 23 [2019-12-18 19:38:42,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:42,362 INFO L462 AbstractCegarLoop]: Abstraction has 2130 states and 7633 transitions. [2019-12-18 19:38:42,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:38:42,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 7633 transitions. [2019-12-18 19:38:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:38:42,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:42,365 INFO L411 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] [2019-12-18 19:38:42,365 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:42,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:42,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1539375980, now seen corresponding path program 2 times [2019-12-18 19:38:42,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:42,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036749095] [2019-12-18 19:38:42,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:42,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036749095] [2019-12-18 19:38:42,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:42,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:38:42,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804510250] [2019-12-18 19:38:42,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:38:42,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:42,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:38:42,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:38:42,598 INFO L87 Difference]: Start difference. First operand 2130 states and 7633 transitions. Second operand 13 states. [2019-12-18 19:38:43,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:43,136 INFO L93 Difference]: Finished difference Result 2799 states and 9853 transitions. [2019-12-18 19:38:43,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:38:43,136 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-12-18 19:38:43,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:43,142 INFO L225 Difference]: With dead ends: 2799 [2019-12-18 19:38:43,142 INFO L226 Difference]: Without dead ends: 2682 [2019-12-18 19:38:43,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-18 19:38:43,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2019-12-18 19:38:43,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 1794. [2019-12-18 19:38:43,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2019-12-18 19:38:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6287 transitions. [2019-12-18 19:38:43,195 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6287 transitions. Word has length 23 [2019-12-18 19:38:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:43,195 INFO L462 AbstractCegarLoop]: Abstraction has 1794 states and 6287 transitions. [2019-12-18 19:38:43,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:38:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6287 transitions. [2019-12-18 19:38:43,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 19:38:43,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:43,198 INFO L411 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] [2019-12-18 19:38:43,198 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:43,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:43,198 INFO L82 PathProgramCache]: Analyzing trace with hash -396779108, now seen corresponding path program 1 times [2019-12-18 19:38:43,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:43,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288437480] [2019-12-18 19:38:43,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:43,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:43,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288437480] [2019-12-18 19:38:43,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:43,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:38:43,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568772403] [2019-12-18 19:38:43,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:38:43,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:43,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:38:43,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:38:43,270 INFO L87 Difference]: Start difference. First operand 1794 states and 6287 transitions. Second operand 7 states. [2019-12-18 19:38:43,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:43,465 INFO L93 Difference]: Finished difference Result 2291 states and 7723 transitions. [2019-12-18 19:38:43,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:38:43,466 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-12-18 19:38:43,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:43,472 INFO L225 Difference]: With dead ends: 2291 [2019-12-18 19:38:43,472 INFO L226 Difference]: Without dead ends: 2227 [2019-12-18 19:38:43,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:38:43,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2019-12-18 19:38:43,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2106. [2019-12-18 19:38:43,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2019-12-18 19:38:43,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7279 transitions. [2019-12-18 19:38:43,502 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7279 transitions. Word has length 24 [2019-12-18 19:38:43,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:43,502 INFO L462 AbstractCegarLoop]: Abstraction has 2106 states and 7279 transitions. [2019-12-18 19:38:43,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:38:43,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7279 transitions. [2019-12-18 19:38:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 19:38:43,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:43,504 INFO L411 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] [2019-12-18 19:38:43,504 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:43,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:43,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1742211423, now seen corresponding path program 1 times [2019-12-18 19:38:43,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:43,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817444620] [2019-12-18 19:38:43,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:43,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817444620] [2019-12-18 19:38:43,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:43,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 19:38:43,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580745769] [2019-12-18 19:38:43,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:38:43,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:43,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:38:43,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:38:43,625 INFO L87 Difference]: Start difference. First operand 2106 states and 7279 transitions. Second operand 9 states. [2019-12-18 19:38:43,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:43,981 INFO L93 Difference]: Finished difference Result 2954 states and 10228 transitions. [2019-12-18 19:38:43,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:38:43,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-18 19:38:43,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:43,988 INFO L225 Difference]: With dead ends: 2954 [2019-12-18 19:38:43,988 INFO L226 Difference]: Without dead ends: 2930 [2019-12-18 19:38:43,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:38:43,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2019-12-18 19:38:44,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2105. [2019-12-18 19:38:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2019-12-18 19:38:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 7278 transitions. [2019-12-18 19:38:44,056 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 7278 transitions. Word has length 24 [2019-12-18 19:38:44,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:44,056 INFO L462 AbstractCegarLoop]: Abstraction has 2105 states and 7278 transitions. [2019-12-18 19:38:44,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:38:44,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 7278 transitions. [2019-12-18 19:38:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 19:38:44,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:44,058 INFO L411 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] [2019-12-18 19:38:44,058 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:44,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:44,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1800981697, now seen corresponding path program 2 times [2019-12-18 19:38:44,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:44,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924848515] [2019-12-18 19:38:44,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:44,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:44,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924848515] [2019-12-18 19:38:44,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:44,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 19:38:44,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248367445] [2019-12-18 19:38:44,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 19:38:44,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:44,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 19:38:44,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:38:44,264 INFO L87 Difference]: Start difference. First operand 2105 states and 7278 transitions. Second operand 10 states. [2019-12-18 19:38:44,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:44,771 INFO L93 Difference]: Finished difference Result 2941 states and 10205 transitions. [2019-12-18 19:38:44,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 19:38:44,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-12-18 19:38:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:44,778 INFO L225 Difference]: With dead ends: 2941 [2019-12-18 19:38:44,778 INFO L226 Difference]: Without dead ends: 2917 [2019-12-18 19:38:44,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:38:44,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2019-12-18 19:38:44,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2102. [2019-12-18 19:38:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2019-12-18 19:38:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7274 transitions. [2019-12-18 19:38:44,817 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7274 transitions. Word has length 24 [2019-12-18 19:38:44,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:44,817 INFO L462 AbstractCegarLoop]: Abstraction has 2102 states and 7274 transitions. [2019-12-18 19:38:44,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 19:38:44,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7274 transitions. [2019-12-18 19:38:44,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 19:38:44,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:44,819 INFO L411 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] [2019-12-18 19:38:44,819 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:44,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:44,820 INFO L82 PathProgramCache]: Analyzing trace with hash 652694931, now seen corresponding path program 3 times [2019-12-18 19:38:44,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:44,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021360329] [2019-12-18 19:38:44,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:45,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021360329] [2019-12-18 19:38:45,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:45,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 19:38:45,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570900781] [2019-12-18 19:38:45,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:38:45,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:45,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:38:45,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:38:45,023 INFO L87 Difference]: Start difference. First operand 2102 states and 7274 transitions. Second operand 11 states. [2019-12-18 19:38:45,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:45,481 INFO L93 Difference]: Finished difference Result 3197 states and 11098 transitions. [2019-12-18 19:38:45,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:38:45,482 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-12-18 19:38:45,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:45,489 INFO L225 Difference]: With dead ends: 3197 [2019-12-18 19:38:45,489 INFO L226 Difference]: Without dead ends: 3173 [2019-12-18 19:38:45,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:38:45,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3173 states. [2019-12-18 19:38:45,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3173 to 1742. [2019-12-18 19:38:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-12-18 19:38:45,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 5952 transitions. [2019-12-18 19:38:45,525 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 5952 transitions. Word has length 24 [2019-12-18 19:38:45,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:45,526 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 5952 transitions. [2019-12-18 19:38:45,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:38:45,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 5952 transitions. [2019-12-18 19:38:45,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 19:38:45,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:45,529 INFO L411 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] [2019-12-18 19:38:45,529 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:45,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:45,529 INFO L82 PathProgramCache]: Analyzing trace with hash 351528874, now seen corresponding path program 2 times [2019-12-18 19:38:45,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:45,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232064060] [2019-12-18 19:38:45,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:45,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:45,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232064060] [2019-12-18 19:38:45,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:45,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:38:45,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996907599] [2019-12-18 19:38:45,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:38:45,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:45,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:38:45,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:38:45,597 INFO L87 Difference]: Start difference. First operand 1742 states and 5952 transitions. Second operand 8 states. [2019-12-18 19:38:45,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:45,785 INFO L93 Difference]: Finished difference Result 2236 states and 7383 transitions. [2019-12-18 19:38:45,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:38:45,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-18 19:38:45,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:45,791 INFO L225 Difference]: With dead ends: 2236 [2019-12-18 19:38:45,791 INFO L226 Difference]: Without dead ends: 2172 [2019-12-18 19:38:45,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:38:45,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2019-12-18 19:38:45,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 1739. [2019-12-18 19:38:45,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2019-12-18 19:38:45,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 5947 transitions. [2019-12-18 19:38:45,816 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 5947 transitions. Word has length 24 [2019-12-18 19:38:45,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:45,817 INFO L462 AbstractCegarLoop]: Abstraction has 1739 states and 5947 transitions. [2019-12-18 19:38:45,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:38:45,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 5947 transitions. [2019-12-18 19:38:45,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 19:38:45,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:45,819 INFO L411 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] [2019-12-18 19:38:45,819 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:45,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:45,819 INFO L82 PathProgramCache]: Analyzing trace with hash -548948534, now seen corresponding path program 3 times [2019-12-18 19:38:45,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:45,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983358875] [2019-12-18 19:38:45,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:45,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983358875] [2019-12-18 19:38:45,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:45,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 19:38:45,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836636705] [2019-12-18 19:38:45,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:38:45,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:45,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:38:45,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:38:45,931 INFO L87 Difference]: Start difference. First operand 1739 states and 5947 transitions. Second operand 9 states. [2019-12-18 19:38:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:46,199 INFO L93 Difference]: Finished difference Result 2226 states and 7363 transitions. [2019-12-18 19:38:46,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:38:46,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-18 19:38:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:46,205 INFO L225 Difference]: With dead ends: 2226 [2019-12-18 19:38:46,205 INFO L226 Difference]: Without dead ends: 2162 [2019-12-18 19:38:46,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:38:46,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2019-12-18 19:38:46,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 1733. [2019-12-18 19:38:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2019-12-18 19:38:46,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 5933 transitions. [2019-12-18 19:38:46,230 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 5933 transitions. Word has length 24 [2019-12-18 19:38:46,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:46,231 INFO L462 AbstractCegarLoop]: Abstraction has 1733 states and 5933 transitions. [2019-12-18 19:38:46,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:38:46,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 5933 transitions. [2019-12-18 19:38:46,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 19:38:46,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:46,232 INFO L411 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] [2019-12-18 19:38:46,233 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:46,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:46,233 INFO L82 PathProgramCache]: Analyzing trace with hash -610918652, now seen corresponding path program 4 times [2019-12-18 19:38:46,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:46,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388634423] [2019-12-18 19:38:46,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:46,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:46,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388634423] [2019-12-18 19:38:46,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:46,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 19:38:46,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878388353] [2019-12-18 19:38:46,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:38:46,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:46,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:38:46,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:38:46,428 INFO L87 Difference]: Start difference. First operand 1733 states and 5933 transitions. Second operand 11 states. [2019-12-18 19:38:46,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:46,744 INFO L93 Difference]: Finished difference Result 2175 states and 7230 transitions. [2019-12-18 19:38:46,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:38:46,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-12-18 19:38:46,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:46,749 INFO L225 Difference]: With dead ends: 2175 [2019-12-18 19:38:46,749 INFO L226 Difference]: Without dead ends: 2111 [2019-12-18 19:38:46,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:38:46,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2019-12-18 19:38:46,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1733. [2019-12-18 19:38:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2019-12-18 19:38:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 5933 transitions. [2019-12-18 19:38:46,773 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 5933 transitions. Word has length 24 [2019-12-18 19:38:46,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:46,774 INFO L462 AbstractCegarLoop]: Abstraction has 1733 states and 5933 transitions. [2019-12-18 19:38:46,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:38:46,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 5933 transitions. [2019-12-18 19:38:46,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 19:38:46,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:46,775 INFO L411 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] [2019-12-18 19:38:46,776 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:46,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:46,776 INFO L82 PathProgramCache]: Analyzing trace with hash -847503804, now seen corresponding path program 5 times [2019-12-18 19:38:46,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:46,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143710212] [2019-12-18 19:38:46,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:47,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143710212] [2019-12-18 19:38:47,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:47,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:38:47,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211009243] [2019-12-18 19:38:47,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:38:47,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:47,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:38:47,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:38:47,015 INFO L87 Difference]: Start difference. First operand 1733 states and 5933 transitions. Second operand 13 states. [2019-12-18 19:38:47,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:47,512 INFO L93 Difference]: Finished difference Result 2400 states and 7955 transitions. [2019-12-18 19:38:47,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:38:47,512 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-12-18 19:38:47,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:47,517 INFO L225 Difference]: With dead ends: 2400 [2019-12-18 19:38:47,518 INFO L226 Difference]: Without dead ends: 2272 [2019-12-18 19:38:47,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-12-18 19:38:47,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2019-12-18 19:38:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1669. [2019-12-18 19:38:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2019-12-18 19:38:47,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 5719 transitions. [2019-12-18 19:38:47,565 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 5719 transitions. Word has length 24 [2019-12-18 19:38:47,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:47,566 INFO L462 AbstractCegarLoop]: Abstraction has 1669 states and 5719 transitions. [2019-12-18 19:38:47,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:38:47,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 5719 transitions. [2019-12-18 19:38:47,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 19:38:47,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:47,568 INFO L411 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] [2019-12-18 19:38:47,568 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:47,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:47,569 INFO L82 PathProgramCache]: Analyzing trace with hash -2037680112, now seen corresponding path program 6 times [2019-12-18 19:38:47,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:47,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274561099] [2019-12-18 19:38:47,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:47,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:47,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274561099] [2019-12-18 19:38:47,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:47,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 19:38:47,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110736034] [2019-12-18 19:38:47,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:38:47,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:47,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:38:47,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:38:47,811 INFO L87 Difference]: Start difference. First operand 1669 states and 5719 transitions. Second operand 11 states. [2019-12-18 19:38:48,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:48,166 INFO L93 Difference]: Finished difference Result 2576 states and 8317 transitions. [2019-12-18 19:38:48,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:38:48,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-12-18 19:38:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:48,172 INFO L225 Difference]: With dead ends: 2576 [2019-12-18 19:38:48,172 INFO L226 Difference]: Without dead ends: 2512 [2019-12-18 19:38:48,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:38:48,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2019-12-18 19:38:48,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 1489. [2019-12-18 19:38:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1489 states. [2019-12-18 19:38:48,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 5033 transitions. [2019-12-18 19:38:48,200 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 5033 transitions. Word has length 24 [2019-12-18 19:38:48,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:48,200 INFO L462 AbstractCegarLoop]: Abstraction has 1489 states and 5033 transitions. [2019-12-18 19:38:48,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:38:48,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 5033 transitions. [2019-12-18 19:38:48,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 19:38:48,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:48,202 INFO L411 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] [2019-12-18 19:38:48,202 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:48,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:48,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1601368368, now seen corresponding path program 1 times [2019-12-18 19:38:48,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:48,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002001645] [2019-12-18 19:38:48,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:48,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002001645] [2019-12-18 19:38:48,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:48,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 19:38:48,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436050105] [2019-12-18 19:38:48,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 19:38:48,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:48,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 19:38:48,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:38:48,350 INFO L87 Difference]: Start difference. First operand 1489 states and 5033 transitions. Second operand 10 states. [2019-12-18 19:38:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:48,755 INFO L93 Difference]: Finished difference Result 2106 states and 6852 transitions. [2019-12-18 19:38:48,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:38:48,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-12-18 19:38:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:48,760 INFO L225 Difference]: With dead ends: 2106 [2019-12-18 19:38:48,760 INFO L226 Difference]: Without dead ends: 2084 [2019-12-18 19:38:48,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:38:48,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2019-12-18 19:38:48,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 1488. [2019-12-18 19:38:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2019-12-18 19:38:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 5032 transitions. [2019-12-18 19:38:48,794 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 5032 transitions. Word has length 26 [2019-12-18 19:38:48,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:48,794 INFO L462 AbstractCegarLoop]: Abstraction has 1488 states and 5032 transitions. [2019-12-18 19:38:48,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 19:38:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 5032 transitions. [2019-12-18 19:38:48,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 19:38:48,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:48,797 INFO L411 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] [2019-12-18 19:38:48,797 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:48,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:48,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1793121520, now seen corresponding path program 2 times [2019-12-18 19:38:48,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:48,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782910054] [2019-12-18 19:38:48,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:49,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782910054] [2019-12-18 19:38:49,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:49,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 19:38:49,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942991836] [2019-12-18 19:38:49,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 19:38:49,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:49,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 19:38:49,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:38:49,097 INFO L87 Difference]: Start difference. First operand 1488 states and 5032 transitions. Second operand 10 states. [2019-12-18 19:38:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:49,626 INFO L93 Difference]: Finished difference Result 2093 states and 6829 transitions. [2019-12-18 19:38:49,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 19:38:49,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-12-18 19:38:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:49,630 INFO L225 Difference]: With dead ends: 2093 [2019-12-18 19:38:49,631 INFO L226 Difference]: Without dead ends: 2071 [2019-12-18 19:38:49,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:38:49,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2019-12-18 19:38:49,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 1485. [2019-12-18 19:38:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2019-12-18 19:38:49,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 5028 transitions. [2019-12-18 19:38:49,663 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 5028 transitions. Word has length 26 [2019-12-18 19:38:49,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:49,664 INFO L462 AbstractCegarLoop]: Abstraction has 1485 states and 5028 transitions. [2019-12-18 19:38:49,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 19:38:49,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 5028 transitions. [2019-12-18 19:38:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 19:38:49,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:49,666 INFO L411 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] [2019-12-18 19:38:49,667 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:49,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:49,667 INFO L82 PathProgramCache]: Analyzing trace with hash 304389942, now seen corresponding path program 3 times [2019-12-18 19:38:49,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:49,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395700693] [2019-12-18 19:38:49,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:49,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395700693] [2019-12-18 19:38:49,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:49,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 19:38:49,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929616629] [2019-12-18 19:38:49,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 19:38:49,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:49,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 19:38:49,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:38:49,889 INFO L87 Difference]: Start difference. First operand 1485 states and 5028 transitions. Second operand 12 states. [2019-12-18 19:38:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:50,356 INFO L93 Difference]: Finished difference Result 1538 states and 4992 transitions. [2019-12-18 19:38:50,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:38:50,357 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-12-18 19:38:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:50,361 INFO L225 Difference]: With dead ends: 1538 [2019-12-18 19:38:50,362 INFO L226 Difference]: Without dead ends: 1494 [2019-12-18 19:38:50,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:38:50,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2019-12-18 19:38:50,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 885. [2019-12-18 19:38:50,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-12-18 19:38:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2019-12-18 19:38:50,379 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2019-12-18 19:38:50,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:50,379 INFO L462 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2019-12-18 19:38:50,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 19:38:50,379 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2019-12-18 19:38:50,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 19:38:50,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:50,381 INFO L411 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] [2019-12-18 19:38:50,381 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:50,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:50,381 INFO L82 PathProgramCache]: Analyzing trace with hash -720297978, now seen corresponding path program 1 times [2019-12-18 19:38:50,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:50,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082812599] [2019-12-18 19:38:50,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:50,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082812599] [2019-12-18 19:38:50,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:50,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 19:38:50,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507716212] [2019-12-18 19:38:50,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:38:50,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:50,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:38:50,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:38:50,469 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2019-12-18 19:38:50,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:50,622 INFO L93 Difference]: Finished difference Result 885 states and 3029 transitions. [2019-12-18 19:38:50,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:38:50,623 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-18 19:38:50,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:50,625 INFO L225 Difference]: With dead ends: 885 [2019-12-18 19:38:50,626 INFO L226 Difference]: Without dead ends: 879 [2019-12-18 19:38:50,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:38:50,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-12-18 19:38:50,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2019-12-18 19:38:50,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2019-12-18 19:38:50,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3010 transitions. [2019-12-18 19:38:50,638 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3010 transitions. Word has length 41 [2019-12-18 19:38:50,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:50,638 INFO L462 AbstractCegarLoop]: Abstraction has 879 states and 3010 transitions. [2019-12-18 19:38:50,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:38:50,638 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3010 transitions. [2019-12-18 19:38:50,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 19:38:50,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:50,640 INFO L411 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] [2019-12-18 19:38:50,640 INFO L410 AbstractCegarLoop]: === Iteration 42 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:50,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:50,640 INFO L82 PathProgramCache]: Analyzing trace with hash 525302158, now seen corresponding path program 1 times [2019-12-18 19:38:50,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:50,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759753191] [2019-12-18 19:38:50,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:50,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759753191] [2019-12-18 19:38:50,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:50,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 19:38:50,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556250414] [2019-12-18 19:38:50,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:38:50,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:50,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:38:50,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:38:50,737 INFO L87 Difference]: Start difference. First operand 879 states and 3010 transitions. Second operand 8 states. [2019-12-18 19:38:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:50,891 INFO L93 Difference]: Finished difference Result 879 states and 3006 transitions. [2019-12-18 19:38:50,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:38:50,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-18 19:38:50,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:50,893 INFO L225 Difference]: With dead ends: 879 [2019-12-18 19:38:50,893 INFO L226 Difference]: Without dead ends: 819 [2019-12-18 19:38:50,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:38:50,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-12-18 19:38:50,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2019-12-18 19:38:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-12-18 19:38:50,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2784 transitions. [2019-12-18 19:38:50,909 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2784 transitions. Word has length 41 [2019-12-18 19:38:50,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:50,910 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 2784 transitions. [2019-12-18 19:38:50,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:38:50,910 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2784 transitions. [2019-12-18 19:38:50,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 19:38:50,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:50,912 INFO L411 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] [2019-12-18 19:38:50,913 INFO L410 AbstractCegarLoop]: === Iteration 43 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 19:38:50,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:50,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1075124498, now seen corresponding path program 1 times [2019-12-18 19:38:50,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:50,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983217632] [2019-12-18 19:38:50,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:38:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:38:50,982 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:38:50,982 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:38:50,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [467] [467] ULTIMATE.startENTRY-->L1123: Formula: (let ((.cse0 (store |v_#valid_113| 0 0))) (and (= |v_#NULL.offset_4| 0) (= v_~v~0.offset_23 0) (= 0 |v_#NULL.base_4|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t~0.base_18|) (= (store |v_#length_40| |v_ULTIMATE.start_main_~#t~0.base_18| 4) |v_#length_39|) (= |v_#memory_int_65| (store |v_#memory_int_66| |v_ULTIMATE.start_main_~#t~0.base_18| (store (select |v_#memory_int_66| |v_ULTIMATE.start_main_~#t~0.base_18|) |v_ULTIMATE.start_main_~#t~0.offset_14| 5))) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t~0.base_18|)) (< 0 |v_#StackHeapBarrier_22|) (= v_~v~0.base_23 0) (= |v_#valid_111| (store .cse0 |v_ULTIMATE.start_main_~#t~0.base_18| 1)) (= |v_ULTIMATE.start_main_~#t~0.offset_14| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_113|, #memory_int=|v_#memory_int_66|, #length=|v_#length_40|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_7|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_14|, ~v~0.base=v_~v~0.base_23, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~v~0.offset=v_~v~0.offset_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_13|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_65|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_18|, #length=|v_#length_39|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_19|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13, #NULL.offset, ULTIMATE.start_main_~#t~0.offset, ~v~0.base, #NULL.base, ~v~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14] because there is no mapped edge [2019-12-18 19:38:50,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [464] [464] thread0ENTRY-->L1108: Formula: (let ((.cse3 (store |v_#valid_104| |v_thread0Thread1of1ForFork3_~#t1~0.base_18| 1))) (let ((.cse1 (store .cse3 |v_thread0Thread1of1ForFork3_~#t2~0.base_17| 1))) (let ((.cse0 (store .cse1 |v_thread0Thread1of1ForFork3_~#t3~0.base_16| 1))) (let ((.cse2 (store .cse0 |v_thread0Thread1of1ForFork3_~#t4~0.base_17| 1))) (and (= 0 (select .cse0 |v_thread0Thread1of1ForFork3_~#t4~0.base_17|)) (= 0 (select .cse1 |v_thread0Thread1of1ForFork3_~#t3~0.base_16|)) (not (= 0 |v_thread0Thread1of1ForFork3_~#t4~0.base_17|)) (= (select .cse2 |v_thread0Thread1of1ForFork3_~#t5~0.base_15|) 0) (= 0 |v_thread0Thread1of1ForFork3_~#t3~0.offset_13|) (= v_thread0Thread1of1ForFork3_~arg.offset_6 |v_thread0Thread1of1ForFork3_#in~arg.offset_6|) (= 0 |v_thread0Thread1of1ForFork3_~#t2~0.offset_13|) (= |v_#length_36| (store (store (store (store (store |v_#length_38| |v_thread0Thread1of1ForFork3_~#t1~0.base_18| 4) |v_thread0Thread1of1ForFork3_~#t2~0.base_17| 4) |v_thread0Thread1of1ForFork3_~#t3~0.base_16| 4) |v_thread0Thread1of1ForFork3_~#t4~0.base_17| 4) |v_thread0Thread1of1ForFork3_~#t5~0.base_15| 4)) (= 0 |v_thread0Thread1of1ForFork3_~#t4~0.offset_14|) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t3~0.base_16|) (not (= |v_thread0Thread1of1ForFork3_~#t3~0.base_16| 0)) (not (= |v_thread0Thread1of1ForFork3_~#t1~0.base_18| 0)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t2~0.base_17|) (= (store |v_#memory_int_64| |v_thread0Thread1of1ForFork3_~#t1~0.base_18| (store (select |v_#memory_int_64| |v_thread0Thread1of1ForFork3_~#t1~0.base_18|) |v_thread0Thread1of1ForFork3_~#t1~0.offset_14| 0)) |v_#memory_int_63|) (= |v_thread0Thread1of1ForFork3_~#t5~0.offset_11| 0) (= v_thread0Thread1of1ForFork3_~arg.base_6 |v_thread0Thread1of1ForFork3_#in~arg.base_6|) (not (= 0 |v_thread0Thread1of1ForFork3_~#t2~0.base_17|)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t1~0.base_18|) (= |v_#valid_102| (store .cse2 |v_thread0Thread1of1ForFork3_~#t5~0.base_15| 1)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t5~0.base_15|) (= 0 (select .cse3 |v_thread0Thread1of1ForFork3_~#t2~0.base_17|)) (= (select |v_#valid_104| |v_thread0Thread1of1ForFork3_~#t1~0.base_18|) 0) (= 0 |v_thread0Thread1of1ForFork3_~#t1~0.offset_14|) (not (= 0 |v_thread0Thread1of1ForFork3_~#t5~0.base_15|)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t4~0.base_17|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, thread0Thread1of1ForFork3_#in~arg.offset=|v_thread0Thread1of1ForFork3_#in~arg.offset_6|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_64|, #length=|v_#length_38|, thread0Thread1of1ForFork3_#in~arg.base=|v_thread0Thread1of1ForFork3_#in~arg.base_6|} OutVars{thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_16|, thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_14|, thread0Thread1of1ForFork3_~#t2~0.offset=|v_thread0Thread1of1ForFork3_~#t2~0.offset_13|, thread0Thread1of1ForFork3_#in~arg.offset=|v_thread0Thread1of1ForFork3_#in~arg.offset_6|, thread0Thread1of1ForFork3_#in~arg.base=|v_thread0Thread1of1ForFork3_#in~arg.base_6|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_17|, thread0Thread1of1ForFork3_~arg.base=v_thread0Thread1of1ForFork3_~arg.base_6, #StackHeapBarrier=|v_#StackHeapBarrier_21|, thread0Thread1of1ForFork3_~#t3~0.offset=|v_thread0Thread1of1ForFork3_~#t3~0.offset_13|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_18|, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_63|, thread0Thread1of1ForFork3_~arg.offset=v_thread0Thread1of1ForFork3_~arg.offset_6, thread0Thread1of1ForFork3_~#t1~0.offset=|v_thread0Thread1of1ForFork3_~#t1~0.offset_14|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_17|, #length=|v_#length_36|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_15|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_11|} AuxVars[] AssignedVars[thread0Thread1of1ForFork3_~#t3~0.base, thread0Thread1of1ForFork3_~#t4~0.offset, thread0Thread1of1ForFork3_~#t2~0.offset, thread0Thread1of1ForFork3_~#t4~0.base, thread0Thread1of1ForFork3_~arg.base, thread0Thread1of1ForFork3_~#t3~0.offset, thread0Thread1of1ForFork3_~#t1~0.base, #valid, #memory_int, thread0Thread1of1ForFork3_~arg.offset, thread0Thread1of1ForFork3_~#t1~0.offset, thread0Thread1of1ForFork3_~#t2~0.base, #length, thread0Thread1of1ForFork3_~#t5~0.base, thread0Thread1of1ForFork3_~#t5~0.offset] because there is no mapped edge [2019-12-18 19:38:50,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [424] [424] L1108-1-->L1109-1: Formula: (= (select (select |v_#memory_int_40| |v_thread0Thread1of1ForFork3_~#t1~0.base_10|) |v_thread0Thread1of1ForFork3_~#t1~0.offset_9|) |v_thread0Thread1of1ForFork3_#t~mem4_27|) InVars {thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_10|, #memory_int=|v_#memory_int_40|, thread0Thread1of1ForFork3_~#t1~0.offset=|v_thread0Thread1of1ForFork3_~#t1~0.offset_9|} OutVars{thread0Thread1of1ForFork3_#t~mem4=|v_thread0Thread1of1ForFork3_#t~mem4_27|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_10|, #memory_int=|v_#memory_int_40|, thread0Thread1of1ForFork3_~#t1~0.offset=|v_thread0Thread1of1ForFork3_~#t1~0.offset_9|, thread0Thread1of1ForFork3_#t~nondet3=|v_thread0Thread1of1ForFork3_#t~nondet3_4|} AuxVars[] AssignedVars[thread0Thread1of1ForFork3_#t~mem4, thread0Thread1of1ForFork3_#t~nondet3] because there is no mapped edge [2019-12-18 19:38:50,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [428] [428] L1123-1-->L1124-1: Formula: (= (select (select |v_#memory_int_43| |v_ULTIMATE.start_main_~#t~0.base_10|) |v_ULTIMATE.start_main_~#t~0.offset_10|) |v_ULTIMATE.start_main_#t~mem14_27|) InVars {#memory_int=|v_#memory_int_43|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_10|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_10|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_10|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_10|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~mem14] because there is no mapped edge [2019-12-18 19:38:50,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [462] [462] thread1ENTRY-->thread1EXIT: Formula: (and (= 0 |v_thread1Thread1of1ForFork4_#res.base_7|) (= v_thread1Thread1of1ForFork4_~arg.offset_7 |v_thread1Thread1of1ForFork4_#in~arg.offset_7|) (not (= |v_thread1Thread1of1ForFork4_#t~malloc2.base_9| 0)) (= |v_#length_34| (store |v_#length_35| |v_thread1Thread1of1ForFork4_#t~malloc2.base_9| 1)) (= 0 (select |v_#valid_99| |v_thread1Thread1of1ForFork4_#t~malloc2.base_9|)) (= |v_thread1Thread1of1ForFork4_#t~malloc2.base_9| v_~v~0.base_22) (< |v_thread1Thread1of1ForFork4_#t~malloc2.base_9| |v_#StackHeapBarrier_20|) (= |v_#valid_98| (store |v_#valid_99| |v_thread1Thread1of1ForFork4_#t~malloc2.base_9| 1)) (= v_~v~0.offset_22 |v_thread1Thread1of1ForFork4_#t~malloc2.offset_9|) (= 0 |v_thread1Thread1of1ForFork4_#res.offset_7|) (= |v_thread1Thread1of1ForFork4_#t~malloc2.offset_9| 0) (= v_thread1Thread1of1ForFork4_~arg.base_7 |v_thread1Thread1of1ForFork4_#in~arg.base_7|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_99|, thread1Thread1of1ForFork4_#in~arg.base=|v_thread1Thread1of1ForFork4_#in~arg.base_7|, #length=|v_#length_35|, thread1Thread1of1ForFork4_#in~arg.offset=|v_thread1Thread1of1ForFork4_#in~arg.offset_7|} OutVars{thread1Thread1of1ForFork4_#res.base=|v_thread1Thread1of1ForFork4_#res.base_7|, thread1Thread1of1ForFork4_~arg.offset=v_thread1Thread1of1ForFork4_~arg.offset_7, thread1Thread1of1ForFork4_#t~malloc2.base=|v_thread1Thread1of1ForFork4_#t~malloc2.base_9|, thread1Thread1of1ForFork4_#in~arg.base=|v_thread1Thread1of1ForFork4_#in~arg.base_7|, ~v~0.base=v_~v~0.base_22, #StackHeapBarrier=|v_#StackHeapBarrier_20|, thread1Thread1of1ForFork4_~arg.base=v_thread1Thread1of1ForFork4_~arg.base_7, thread1Thread1of1ForFork4_#res.offset=|v_thread1Thread1of1ForFork4_#res.offset_7|, ~v~0.offset=v_~v~0.offset_22, #valid=|v_#valid_98|, #length=|v_#length_34|, thread1Thread1of1ForFork4_#t~malloc2.offset=|v_thread1Thread1of1ForFork4_#t~malloc2.offset_9|, thread1Thread1of1ForFork4_#in~arg.offset=|v_thread1Thread1of1ForFork4_#in~arg.offset_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork4_#res.base, thread1Thread1of1ForFork4_~arg.offset, thread1Thread1of1ForFork4_~arg.base, thread1Thread1of1ForFork4_#t~malloc2.base, thread1Thread1of1ForFork4_#res.offset, ~v~0.offset, #valid, #length, thread1Thread1of1ForFork4_#t~malloc2.offset, ~v~0.base] because there is no mapped edge [2019-12-18 19:38:50,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [443] [443] L1097-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork5_#res.offset_7| 0) (= (store |v_#memory_int_53| v_~v~0.base_13 (store (select |v_#memory_int_53| v_~v~0.base_13) v_~v~0.offset_13 88)) |v_#memory_int_52|) (= 0 |v_thread2Thread1of1ForFork5_#res.base_7|)) InVars {~v~0.offset=v_~v~0.offset_13, #memory_int=|v_#memory_int_53|, ~v~0.base=v_~v~0.base_13} OutVars{~v~0.offset=v_~v~0.offset_13, #memory_int=|v_#memory_int_52|, thread2Thread1of1ForFork5_#res.base=|v_thread2Thread1of1ForFork5_#res.base_7|, thread2Thread1of1ForFork5_#res.offset=|v_thread2Thread1of1ForFork5_#res.offset_7|, ~v~0.base=v_~v~0.base_13} AuxVars[] AssignedVars[#memory_int, thread2Thread1of1ForFork5_#res.base, thread2Thread1of1ForFork5_#res.offset] because there is no mapped edge [2019-12-18 19:38:50,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [412] [412] L1110-2-->L1111-1: Formula: (= (store |v_#memory_int_33| |v_thread0Thread1of1ForFork3_~#t3~0.base_11| (store (select |v_#memory_int_33| |v_thread0Thread1of1ForFork3_~#t3~0.base_11|) |v_thread0Thread1of1ForFork3_~#t3~0.offset_9| 2)) |v_#memory_int_32|) InVars {thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_11|, thread0Thread1of1ForFork3_~#t3~0.offset=|v_thread0Thread1of1ForFork3_~#t3~0.offset_9|, #memory_int=|v_#memory_int_33|} OutVars{thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_11|, thread0Thread1of1ForFork3_~#t3~0.offset=|v_thread0Thread1of1ForFork3_~#t3~0.offset_9|, #memory_int=|v_#memory_int_32|, thread0Thread1of1ForFork3_#t~nondet5=|v_thread0Thread1of1ForFork3_#t~nondet5_4|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork3_#t~nondet5] because there is no mapped edge [2019-12-18 19:38:50,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [417] [417] L1111-2-->L1112-1: Formula: (= (store |v_#memory_int_37| |v_thread0Thread1of1ForFork3_~#t4~0.base_10| (store (select |v_#memory_int_37| |v_thread0Thread1of1ForFork3_~#t4~0.base_10|) |v_thread0Thread1of1ForFork3_~#t4~0.offset_9| 3)) |v_#memory_int_36|) InVars {thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_9|, #memory_int=|v_#memory_int_37|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_10|} OutVars{thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_9|, #memory_int=|v_#memory_int_36|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_10|, thread0Thread1of1ForFork3_#t~nondet6=|v_thread0Thread1of1ForFork3_#t~nondet6_4|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork3_#t~nondet6] because there is no mapped edge [2019-12-18 19:38:50,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [411] [411] L1112-2-->L1113-1: Formula: (= (store |v_#memory_int_31| |v_thread0Thread1of1ForFork3_~#t5~0.base_10| (store (select |v_#memory_int_31| |v_thread0Thread1of1ForFork3_~#t5~0.base_10|) |v_thread0Thread1of1ForFork3_~#t5~0.offset_8| 4)) |v_#memory_int_30|) InVars {#memory_int=|v_#memory_int_31|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_10|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_8|} OutVars{#memory_int=|v_#memory_int_30|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_10|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_8|, thread0Thread1of1ForFork3_#t~nondet7=|v_thread0Thread1of1ForFork3_#t~nondet7_4|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork3_#t~nondet7] because there is no mapped edge [2019-12-18 19:38:50,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [435] [435] L1113-2-->L1114-1: Formula: (= (select (select |v_#memory_int_50| |v_thread0Thread1of1ForFork3_~#t2~0.base_10|) |v_thread0Thread1of1ForFork3_~#t2~0.offset_8|) |v_thread0Thread1of1ForFork3_#t~mem9_27|) InVars {thread0Thread1of1ForFork3_~#t2~0.offset=|v_thread0Thread1of1ForFork3_~#t2~0.offset_8|, #memory_int=|v_#memory_int_50|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_10|} OutVars{thread0Thread1of1ForFork3_#t~nondet8=|v_thread0Thread1of1ForFork3_#t~nondet8_4|, thread0Thread1of1ForFork3_~#t2~0.offset=|v_thread0Thread1of1ForFork3_~#t2~0.offset_8|, #memory_int=|v_#memory_int_50|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_10|, thread0Thread1of1ForFork3_#t~mem9=|v_thread0Thread1of1ForFork3_#t~mem9_27|} AuxVars[] AssignedVars[thread0Thread1of1ForFork3_#t~nondet8, thread0Thread1of1ForFork3_#t~mem9] because there is no mapped edge [2019-12-18 19:38:50,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [449] [449] L1097-->thread2EXIT: Formula: (and (= (store |v_#memory_int_59| v_~v~0.base_17 (store (select |v_#memory_int_59| v_~v~0.base_17) v_~v~0.offset_17 88)) |v_#memory_int_58|) (= |v_thread2Thread1of1ForFork2_#res.offset_7| 0) (= |v_thread2Thread1of1ForFork2_#res.base_7| 0)) InVars {~v~0.offset=v_~v~0.offset_17, #memory_int=|v_#memory_int_59|, ~v~0.base=v_~v~0.base_17} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_7|, ~v~0.offset=v_~v~0.offset_17, #memory_int=|v_#memory_int_58|, ~v~0.base=v_~v~0.base_17, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, #memory_int, thread2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 19:38:50,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [446] [446] L1097-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_7| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_7| 0) (= (store |v_#memory_int_55| v_~v~0.base_14 (store (select |v_#memory_int_55| v_~v~0.base_14) v_~v~0.offset_14 88)) |v_#memory_int_54|)) InVars {~v~0.offset=v_~v~0.offset_14, #memory_int=|v_#memory_int_55|, ~v~0.base=v_~v~0.base_14} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_7|, ~v~0.offset=v_~v~0.offset_14, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_7|, #memory_int=|v_#memory_int_54|, ~v~0.base=v_~v~0.base_14} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, #memory_int] because there is no mapped edge [2019-12-18 19:38:50,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [448] [448] L1102-->thread3EXIT: Formula: (and (= (store |v_#memory_int_57| v_~v~0.base_16 (store (select |v_#memory_int_57| v_~v~0.base_16) v_~v~0.offset_16 89)) |v_#memory_int_56|) (= |v_thread3Thread1of1ForFork0_#res.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res.base_7| 0)) InVars {~v~0.offset=v_~v~0.offset_16, #memory_int=|v_#memory_int_57|, ~v~0.base=v_~v~0.base_16} OutVars{~v~0.offset=v_~v~0.offset_16, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_7|, #memory_int=|v_#memory_int_56|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_7|, ~v~0.base=v_~v~0.base_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, #memory_int, thread3Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 19:38:51,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [470] [470] L1118-->thread0EXIT: Formula: (and (= 0 |v_thread0Thread1of1ForFork3_#res.offset_4|) (= (store (store (store (store (store |v_#valid_117| |v_thread0Thread1of1ForFork3_~#t1~0.base_22| 0) |v_thread0Thread1of1ForFork3_~#t2~0.base_21| 0) |v_thread0Thread1of1ForFork3_~#t3~0.base_20| 0) |v_thread0Thread1of1ForFork3_~#t4~0.base_21| 0) |v_thread0Thread1of1ForFork3_~#t5~0.base_19| 0) |v_#valid_116|) (= 0 |v_thread0Thread1of1ForFork3_#res.base_4|)) InVars {thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_20|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_22|, #valid=|v_#valid_117|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_21|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_19|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_21|} OutVars{thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_19|, thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_16|, thread0Thread1of1ForFork3_~#t2~0.offset=|v_thread0Thread1of1ForFork3_~#t2~0.offset_15|, thread0Thread1of1ForFork3_#res.base=|v_thread0Thread1of1ForFork3_#res.base_4|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_20|, thread0Thread1of1ForFork3_~#t3~0.offset=|v_thread0Thread1of1ForFork3_~#t3~0.offset_15|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_21|, thread0Thread1of1ForFork3_#res.offset=|v_thread0Thread1of1ForFork3_#res.offset_4|, #valid=|v_#valid_116|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_20|, thread0Thread1of1ForFork3_~#t1~0.offset=|v_thread0Thread1of1ForFork3_~#t1~0.offset_16|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_18|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_13|} AuxVars[] AssignedVars[thread0Thread1of1ForFork3_~#t3~0.base, thread0Thread1of1ForFork3_~#t4~0.offset, thread0Thread1of1ForFork3_~#t2~0.offset, thread0Thread1of1ForFork3_#res.base, thread0Thread1of1ForFork3_~#t4~0.base, thread0Thread1of1ForFork3_~#t3~0.offset, thread0Thread1of1ForFork3_~#t1~0.base, thread0Thread1of1ForFork3_#res.offset, #valid, thread0Thread1of1ForFork3_~#t2~0.base, thread0Thread1of1ForFork3_~#t1~0.offset, thread0Thread1of1ForFork3_~#t5~0.base, thread0Thread1of1ForFork3_~#t5~0.offset] because there is no mapped edge [2019-12-18 19:38:51,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [457] [457] L1125-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= |v_ULTIMATE.start_main_#t~mem15_15| 88)) (= |v_ULTIMATE.start_main_#t~mem15_15| (select (select |v_#memory_int_61| v_~v~0.base_20) v_~v~0.offset_20)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~v~0.offset=v_~v~0.offset_20, #memory_int=|v_#memory_int_61|, ~v~0.base=v_~v~0.base_20} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~v~0.offset=v_~v~0.offset_20, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_15|, ~v~0.base=v_~v~0.base_20, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~mem15, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 19:38:51,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:38:51 BasicIcfg [2019-12-18 19:38:51,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:38:51,064 INFO L168 Benchmark]: Toolchain (without parser) took 33404.42 ms. Allocated memory was 144.7 MB in the beginning and 853.5 MB in the end (delta: 708.8 MB). Free memory was 100.0 MB in the beginning and 174.0 MB in the end (delta: -74.0 MB). Peak memory consumption was 634.8 MB. Max. memory is 7.1 GB. [2019-12-18 19:38:51,065 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 19:38:51,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1030.79 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 99.6 MB in the beginning and 122.3 MB in the end (delta: -22.7 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. [2019-12-18 19:38:51,066 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.92 ms. Allocated memory is still 202.9 MB. Free memory was 122.3 MB in the beginning and 119.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 19:38:51,066 INFO L168 Benchmark]: Boogie Preprocessor took 29.12 ms. Allocated memory is still 202.9 MB. Free memory was 119.6 MB in the beginning and 118.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-12-18 19:38:51,066 INFO L168 Benchmark]: RCFGBuilder took 551.60 ms. Allocated memory is still 202.9 MB. Free memory was 118.2 MB in the beginning and 91.6 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2019-12-18 19:38:51,067 INFO L168 Benchmark]: TraceAbstraction took 31729.93 ms. Allocated memory was 202.9 MB in the beginning and 853.5 MB in the end (delta: 650.6 MB). Free memory was 90.9 MB in the beginning and 174.0 MB in the end (delta: -83.1 MB). Peak memory consumption was 567.5 MB. Max. memory is 7.1 GB. [2019-12-18 19:38:51,069 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1030.79 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 99.6 MB in the beginning and 122.3 MB in the end (delta: -22.7 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.92 ms. Allocated memory is still 202.9 MB. Free memory was 122.3 MB in the beginning and 119.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.12 ms. Allocated memory is still 202.9 MB. Free memory was 119.6 MB in the beginning and 118.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 551.60 ms. Allocated memory is still 202.9 MB. Free memory was 118.2 MB in the beginning and 91.6 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31729.93 ms. Allocated memory was 202.9 MB in the beginning and 853.5 MB in the end (delta: 650.6 MB). Free memory was 90.9 MB in the beginning and 174.0 MB in the end (delta: -83.1 MB). Peak memory consumption was 567.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.4s, 172 ProgramPointsBefore, 99 ProgramPointsAfterwards, 243 TransitionsBefore, 173 TransitionsAfterwards, 4038 CoEnabledTransitionPairs, 6 FixpointIterations, 23 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 1460 VarBasedMoverChecksPositive, 10 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2242 CheckedPairsTotal, 74 TotalNumberOfCompositions - CounterExampleResult [Line: 1088]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1123] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1108] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9:0}, v={0:0}] [L1109] 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))={1:0}, t1={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9:0}, v={1:0}] [L1110] 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))={1:0}, t1={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9:0}, v={1:0}] [L1111] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 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}, malloc(sizeof(char))={1:0}, t1={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9:0}, v={1:0}] [L1112] FCALL, FORK 1 pthread_create(&t4, 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}, malloc(sizeof(char))={1:0}, t1={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9:0}, v={1:0}] [L1113] 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))={1:0}, t1={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9:0}, v={1:0}] [L1114] 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))={1:0}, t1={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9:0}, v={1:0}] [L1115] 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))={1:0}, t1={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9:0}, v={1:0}] [L1115] 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))={1:0}, t1={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9:0}, v={1:0}] [L1116] 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))={1:0}, t1={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9:0}, v={1:0}] [L1116] 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))={1:0}, t1={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9:0}, v={1:0}] [L1117] 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))={1:0}, t1={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9:0}, v={1:0}] [L1117] 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))={1:0}, t1={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9:0}, v={1:0}] [L1124] 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))={1:0}, v={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 92 locations, 1 error locations. Result: UNSAFE, OverallTime: 31.3s, OverallIterations: 43, TraceHistogramMax: 1, AutomataDifference: 17.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4482 SDtfs, 8122 SDslu, 13555 SDs, 0 SdLazy, 8087 SolverSat, 1096 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 46 SyntacticMatches, 20 SemanticMatches, 481 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4270occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 42 MinimizatonAttempts, 39550 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 958 NumberOfCodeBlocks, 958 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 875 ConstructedInterpolants, 0 QuantifiedInterpolants, 283067 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...