/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:37:47,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:37:47,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:37:47,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:37:47,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:37:47,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:37:47,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:37:47,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:37:47,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:37:47,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:37:47,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:37:47,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:37:47,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:37:47,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:37:47,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:37:47,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:37:47,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:37:47,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:37:47,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:37:47,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:37:47,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:37:47,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:37:47,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:37:47,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:37:47,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:37:47,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:37:47,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:37:47,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:37:47,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:37:47,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:37:47,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:37:47,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:37:47,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:37:47,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:37:47,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:37:47,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:37:47,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:37:47,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:37:47,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:37:47,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:37:47,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:37:47,383 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-SemanticLbe.epf [2019-12-27 02:37:47,398 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:37:47,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:37:47,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:37:47,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:37:47,400 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:37:47,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:37:47,400 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:37:47,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:37:47,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:37:47,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:37:47,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:37:47,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:37:47,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:37:47,402 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:37:47,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:37:47,402 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:37:47,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:37:47,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:37:47,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:37:47,403 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:37:47,403 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:37:47,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:37:47,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:37:47,404 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:37:47,404 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:37:47,404 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:37:47,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:37:47,404 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:37:47,405 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:37:47,682 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:37:47,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:37:47,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:37:47,700 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:37:47,700 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:37:47,701 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_pso.oepc.i [2019-12-27 02:37:47,774 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60000d7a0/dcff48f9cd1040738b9f06b81463bd5d/FLAGe95a1cbc1 [2019-12-27 02:37:48,306 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:37:48,307 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_pso.oepc.i [2019-12-27 02:37:48,322 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60000d7a0/dcff48f9cd1040738b9f06b81463bd5d/FLAGe95a1cbc1 [2019-12-27 02:37:48,640 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60000d7a0/dcff48f9cd1040738b9f06b81463bd5d [2019-12-27 02:37:48,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:37:48,651 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:37:48,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:37:48,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:37:48,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:37:48,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:37:48" (1/1) ... [2019-12-27 02:37:48,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e211ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:48, skipping insertion in model container [2019-12-27 02:37:48,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:37:48" (1/1) ... [2019-12-27 02:37:48,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:37:48,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:37:49,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:37:49,327 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:37:49,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:37:49,536 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:37:49,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:49 WrapperNode [2019-12-27 02:37:49,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:37:49,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:37:49,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:37:49,538 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:37:49,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:49" (1/1) ... [2019-12-27 02:37:49,567 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:49" (1/1) ... [2019-12-27 02:37:49,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:37:49,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:37:49,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:37:49,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:37:49,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:49" (1/1) ... [2019-12-27 02:37:49,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:49" (1/1) ... [2019-12-27 02:37:49,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:49" (1/1) ... [2019-12-27 02:37:49,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:49" (1/1) ... [2019-12-27 02:37:49,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:49" (1/1) ... [2019-12-27 02:37:49,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:49" (1/1) ... [2019-12-27 02:37:49,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:49" (1/1) ... [2019-12-27 02:37:49,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:37:49,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:37:49,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:37:49,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:37:49,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:49" (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-27 02:37:49,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:37:49,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:37:49,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:37:49,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:37:49,721 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:37:49,721 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:37:49,722 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:37:49,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:37:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:37:49,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:37:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:37:49,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:37:49,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:37:49,730 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:37:50,517 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:37:50,518 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:37:50,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:37:50 BoogieIcfgContainer [2019-12-27 02:37:50,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:37:50,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:37:50,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:37:50,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:37:50,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:37:48" (1/3) ... [2019-12-27 02:37:50,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2866ce6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:37:50, skipping insertion in model container [2019-12-27 02:37:50,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:49" (2/3) ... [2019-12-27 02:37:50,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2866ce6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:37:50, skipping insertion in model container [2019-12-27 02:37:50,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:37:50" (3/3) ... [2019-12-27 02:37:50,528 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_pso.oepc.i [2019-12-27 02:37:50,539 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:37:50,539 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:37:50,547 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:37:50,548 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:37:50,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,593 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,593 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,594 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,594 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,595 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,603 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,603 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,629 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,629 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,657 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,659 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,666 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,666 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,667 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,673 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,673 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:50,692 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:37:50,712 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:37:50,712 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:37:50,713 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:37:50,713 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:37:50,713 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:37:50,713 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:37:50,713 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:37:50,713 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:37:50,731 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 02:37:50,733 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 02:37:50,841 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 02:37:50,841 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:37:50,857 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:37:50,882 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 02:37:50,937 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 02:37:50,937 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:37:50,945 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:37:50,966 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 02:37:50,967 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:37:54,599 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-12-27 02:37:56,372 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 02:37:56,511 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 02:37:56,547 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81673 [2019-12-27 02:37:56,547 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 02:37:56,551 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-27 02:38:16,406 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 117422 states. [2019-12-27 02:38:16,408 INFO L276 IsEmpty]: Start isEmpty. Operand 117422 states. [2019-12-27 02:38:16,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:38:16,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:16,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:38:16,413 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:38:16,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:16,418 INFO L82 PathProgramCache]: Analyzing trace with hash 914906, now seen corresponding path program 1 times [2019-12-27 02:38:16,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:16,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584223747] [2019-12-27 02:38:16,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:16,672 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-27 02:38:16,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584223747] [2019-12-27 02:38:16,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:16,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:38:16,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719586947] [2019-12-27 02:38:16,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:38:16,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:16,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:38:16,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:38:16,696 INFO L87 Difference]: Start difference. First operand 117422 states. Second operand 3 states. [2019-12-27 02:38:19,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:19,827 INFO L93 Difference]: Finished difference Result 116592 states and 500276 transitions. [2019-12-27 02:38:19,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:38:19,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:38:19,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:20,459 INFO L225 Difference]: With dead ends: 116592 [2019-12-27 02:38:20,459 INFO L226 Difference]: Without dead ends: 109832 [2019-12-27 02:38:20,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-27 02:38:25,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109832 states. [2019-12-27 02:38:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109832 to 109832. [2019-12-27 02:38:27,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109832 states. [2019-12-27 02:38:32,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109832 states to 109832 states and 470688 transitions. [2019-12-27 02:38:32,276 INFO L78 Accepts]: Start accepts. Automaton has 109832 states and 470688 transitions. Word has length 3 [2019-12-27 02:38:32,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:32,277 INFO L462 AbstractCegarLoop]: Abstraction has 109832 states and 470688 transitions. [2019-12-27 02:38:32,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:38:32,277 INFO L276 IsEmpty]: Start isEmpty. Operand 109832 states and 470688 transitions. [2019-12-27 02:38:32,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:38:32,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:32,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:32,282 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:38:32,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:32,282 INFO L82 PathProgramCache]: Analyzing trace with hash -406604938, now seen corresponding path program 1 times [2019-12-27 02:38:32,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:32,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754506877] [2019-12-27 02:38:32,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:32,384 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-27 02:38:32,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754506877] [2019-12-27 02:38:32,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:32,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:38:32,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704827546] [2019-12-27 02:38:32,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:38:32,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:32,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:38:32,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:38:32,389 INFO L87 Difference]: Start difference. First operand 109832 states and 470688 transitions. Second operand 4 states. [2019-12-27 02:38:38,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:38,561 INFO L93 Difference]: Finished difference Result 175346 states and 720050 transitions. [2019-12-27 02:38:38,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:38:38,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:38:38,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:39,192 INFO L225 Difference]: With dead ends: 175346 [2019-12-27 02:38:39,192 INFO L226 Difference]: Without dead ends: 175297 [2019-12-27 02:38:39,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:38:45,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175297 states. [2019-12-27 02:38:49,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175297 to 159417. [2019-12-27 02:38:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159417 states. [2019-12-27 02:38:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159417 states to 159417 states and 663570 transitions. [2019-12-27 02:38:49,531 INFO L78 Accepts]: Start accepts. Automaton has 159417 states and 663570 transitions. Word has length 11 [2019-12-27 02:38:49,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:49,531 INFO L462 AbstractCegarLoop]: Abstraction has 159417 states and 663570 transitions. [2019-12-27 02:38:49,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:38:49,532 INFO L276 IsEmpty]: Start isEmpty. Operand 159417 states and 663570 transitions. [2019-12-27 02:38:49,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:38:49,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:49,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:49,540 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:38:49,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:49,540 INFO L82 PathProgramCache]: Analyzing trace with hash 901712968, now seen corresponding path program 1 times [2019-12-27 02:38:49,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:49,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475890704] [2019-12-27 02:38:49,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:49,630 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-27 02:38:49,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475890704] [2019-12-27 02:38:49,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:49,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:38:49,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795155637] [2019-12-27 02:38:49,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:38:49,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:49,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:38:49,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:38:49,632 INFO L87 Difference]: Start difference. First operand 159417 states and 663570 transitions. Second operand 4 states. [2019-12-27 02:38:55,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:55,973 INFO L93 Difference]: Finished difference Result 224613 states and 913627 transitions. [2019-12-27 02:38:55,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:38:55,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 02:38:55,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:56,707 INFO L225 Difference]: With dead ends: 224613 [2019-12-27 02:38:56,707 INFO L226 Difference]: Without dead ends: 224557 [2019-12-27 02:38:56,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:39:04,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224557 states. [2019-12-27 02:39:08,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224557 to 189220. [2019-12-27 02:39:08,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189220 states. [2019-12-27 02:39:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189220 states to 189220 states and 783364 transitions. [2019-12-27 02:39:19,081 INFO L78 Accepts]: Start accepts. Automaton has 189220 states and 783364 transitions. Word has length 13 [2019-12-27 02:39:19,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:39:19,083 INFO L462 AbstractCegarLoop]: Abstraction has 189220 states and 783364 transitions. [2019-12-27 02:39:19,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:39:19,083 INFO L276 IsEmpty]: Start isEmpty. Operand 189220 states and 783364 transitions. [2019-12-27 02:39:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:39:19,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:39:19,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:39:19,093 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:39:19,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:39:19,093 INFO L82 PathProgramCache]: Analyzing trace with hash -100341528, now seen corresponding path program 1 times [2019-12-27 02:39:19,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:39:19,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660234258] [2019-12-27 02:39:19,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:39:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:39:19,213 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-27 02:39:19,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660234258] [2019-12-27 02:39:19,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:39:19,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:39:19,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379448425] [2019-12-27 02:39:19,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:39:19,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:39:19,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:39:19,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:39:19,215 INFO L87 Difference]: Start difference. First operand 189220 states and 783364 transitions. Second operand 5 states. [2019-12-27 02:39:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:39:27,718 INFO L93 Difference]: Finished difference Result 258403 states and 1058469 transitions. [2019-12-27 02:39:27,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:39:27,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 02:39:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:39:28,502 INFO L225 Difference]: With dead ends: 258403 [2019-12-27 02:39:28,502 INFO L226 Difference]: Without dead ends: 258403 [2019-12-27 02:39:28,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:39:36,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258403 states. [2019-12-27 02:39:40,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258403 to 213814. [2019-12-27 02:39:40,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213814 states. [2019-12-27 02:39:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213814 states to 213814 states and 884433 transitions. [2019-12-27 02:39:41,122 INFO L78 Accepts]: Start accepts. Automaton has 213814 states and 884433 transitions. Word has length 16 [2019-12-27 02:39:41,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:39:41,123 INFO L462 AbstractCegarLoop]: Abstraction has 213814 states and 884433 transitions. [2019-12-27 02:39:41,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:39:41,123 INFO L276 IsEmpty]: Start isEmpty. Operand 213814 states and 884433 transitions. [2019-12-27 02:39:41,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 02:39:41,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:39:41,139 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-27 02:39:41,139 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:39:41,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:39:41,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1671186354, now seen corresponding path program 1 times [2019-12-27 02:39:41,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:39:41,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824884867] [2019-12-27 02:39:41,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:39:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:39:41,208 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-27 02:39:41,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824884867] [2019-12-27 02:39:41,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:39:41,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:39:41,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503738574] [2019-12-27 02:39:41,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:39:41,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:39:41,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:39:41,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:39:41,211 INFO L87 Difference]: Start difference. First operand 213814 states and 884433 transitions. Second operand 3 states. [2019-12-27 02:39:47,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:39:47,803 INFO L93 Difference]: Finished difference Result 213628 states and 883659 transitions. [2019-12-27 02:39:47,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:39:47,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 02:39:47,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:39:49,293 INFO L225 Difference]: With dead ends: 213628 [2019-12-27 02:39:49,293 INFO L226 Difference]: Without dead ends: 213628 [2019-12-27 02:39:49,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-27 02:40:00,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213628 states. [2019-12-27 02:40:04,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213628 to 213628. [2019-12-27 02:40:04,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213628 states. [2019-12-27 02:40:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213628 states to 213628 states and 883659 transitions. [2019-12-27 02:40:06,214 INFO L78 Accepts]: Start accepts. Automaton has 213628 states and 883659 transitions. Word has length 18 [2019-12-27 02:40:06,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:40:06,215 INFO L462 AbstractCegarLoop]: Abstraction has 213628 states and 883659 transitions. [2019-12-27 02:40:06,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:40:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 213628 states and 883659 transitions. [2019-12-27 02:40:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 02:40:06,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:40:06,235 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-27 02:40:06,235 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:40:06,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:40:06,235 INFO L82 PathProgramCache]: Analyzing trace with hash 519654589, now seen corresponding path program 1 times [2019-12-27 02:40:06,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:40:06,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725258210] [2019-12-27 02:40:06,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:40:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:40:06,317 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-27 02:40:06,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725258210] [2019-12-27 02:40:06,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:40:06,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:40:06,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250690053] [2019-12-27 02:40:06,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:40:06,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:40:06,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:40:06,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:40:06,320 INFO L87 Difference]: Start difference. First operand 213628 states and 883659 transitions. Second operand 3 states. [2019-12-27 02:40:15,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:40:15,486 INFO L93 Difference]: Finished difference Result 350444 states and 1444264 transitions. [2019-12-27 02:40:15,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:40:15,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-27 02:40:15,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:40:16,104 INFO L225 Difference]: With dead ends: 350444 [2019-12-27 02:40:16,104 INFO L226 Difference]: Without dead ends: 198218 [2019-12-27 02:40:16,105 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-27 02:40:22,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198218 states. [2019-12-27 02:40:25,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198218 to 187353. [2019-12-27 02:40:25,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187353 states. [2019-12-27 02:40:27,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187353 states to 187353 states and 763221 transitions. [2019-12-27 02:40:27,145 INFO L78 Accepts]: Start accepts. Automaton has 187353 states and 763221 transitions. Word has length 19 [2019-12-27 02:40:27,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:40:27,146 INFO L462 AbstractCegarLoop]: Abstraction has 187353 states and 763221 transitions. [2019-12-27 02:40:27,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:40:27,146 INFO L276 IsEmpty]: Start isEmpty. Operand 187353 states and 763221 transitions. [2019-12-27 02:40:27,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 02:40:27,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:40:27,161 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-27 02:40:27,162 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:40:27,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:40:27,162 INFO L82 PathProgramCache]: Analyzing trace with hash 2110977068, now seen corresponding path program 1 times [2019-12-27 02:40:27,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:40:27,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133793036] [2019-12-27 02:40:27,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:40:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:40:27,212 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-27 02:40:27,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133793036] [2019-12-27 02:40:27,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:40:27,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:40:27,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480338611] [2019-12-27 02:40:27,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:40:27,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:40:27,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:40:27,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:40:27,215 INFO L87 Difference]: Start difference. First operand 187353 states and 763221 transitions. Second operand 3 states. [2019-12-27 02:40:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:40:35,374 INFO L93 Difference]: Finished difference Result 318374 states and 1295663 transitions. [2019-12-27 02:40:35,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:40:35,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-27 02:40:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:40:35,867 INFO L225 Difference]: With dead ends: 318374 [2019-12-27 02:40:35,867 INFO L226 Difference]: Without dead ends: 167121 [2019-12-27 02:40:35,868 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-27 02:40:42,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167121 states. [2019-12-27 02:40:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167121 to 165648. [2019-12-27 02:40:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165648 states. [2019-12-27 02:40:45,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165648 states to 165648 states and 662466 transitions. [2019-12-27 02:40:45,224 INFO L78 Accepts]: Start accepts. Automaton has 165648 states and 662466 transitions. Word has length 19 [2019-12-27 02:40:45,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:40:45,225 INFO L462 AbstractCegarLoop]: Abstraction has 165648 states and 662466 transitions. [2019-12-27 02:40:45,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:40:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 165648 states and 662466 transitions. [2019-12-27 02:40:45,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 02:40:45,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:40:45,237 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-27 02:40:45,238 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:40:45,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:40:45,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1254967176, now seen corresponding path program 1 times [2019-12-27 02:40:45,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:40:45,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944494245] [2019-12-27 02:40:45,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:40:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:40:45,346 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-27 02:40:45,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944494245] [2019-12-27 02:40:45,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:40:45,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:40:45,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072613514] [2019-12-27 02:40:45,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:40:45,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:40:45,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:40:45,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:40:45,348 INFO L87 Difference]: Start difference. First operand 165648 states and 662466 transitions. Second operand 4 states. [2019-12-27 02:40:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:40:49,951 INFO L93 Difference]: Finished difference Result 35790 states and 119539 transitions. [2019-12-27 02:40:49,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:40:49,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 02:40:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:40:50,023 INFO L225 Difference]: With dead ends: 35790 [2019-12-27 02:40:50,024 INFO L226 Difference]: Without dead ends: 28955 [2019-12-27 02:40:50,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:40:50,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28955 states. [2019-12-27 02:40:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28955 to 28002. [2019-12-27 02:40:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28002 states. [2019-12-27 02:40:50,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28002 states to 28002 states and 89704 transitions. [2019-12-27 02:40:50,601 INFO L78 Accepts]: Start accepts. Automaton has 28002 states and 89704 transitions. Word has length 19 [2019-12-27 02:40:50,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:40:50,602 INFO L462 AbstractCegarLoop]: Abstraction has 28002 states and 89704 transitions. [2019-12-27 02:40:50,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:40:50,602 INFO L276 IsEmpty]: Start isEmpty. Operand 28002 states and 89704 transitions. [2019-12-27 02:40:50,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:40:50,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:40:50,607 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-27 02:40:50,607 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:40:50,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:40:50,607 INFO L82 PathProgramCache]: Analyzing trace with hash -914144456, now seen corresponding path program 1 times [2019-12-27 02:40:50,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:40:50,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513544683] [2019-12-27 02:40:50,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:40:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:40:50,676 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-27 02:40:50,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513544683] [2019-12-27 02:40:50,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:40:50,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:40:50,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940098491] [2019-12-27 02:40:50,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:40:50,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:40:50,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:40:50,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:40:50,678 INFO L87 Difference]: Start difference. First operand 28002 states and 89704 transitions. Second operand 6 states. [2019-12-27 02:40:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:40:51,462 INFO L93 Difference]: Finished difference Result 31352 states and 96550 transitions. [2019-12-27 02:40:51,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:40:51,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 02:40:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:40:51,514 INFO L225 Difference]: With dead ends: 31352 [2019-12-27 02:40:51,514 INFO L226 Difference]: Without dead ends: 31254 [2019-12-27 02:40:51,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:40:51,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31254 states. [2019-12-27 02:40:52,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31254 to 26660. [2019-12-27 02:40:52,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26660 states. [2019-12-27 02:40:52,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26660 states to 26660 states and 84926 transitions. [2019-12-27 02:40:52,347 INFO L78 Accepts]: Start accepts. Automaton has 26660 states and 84926 transitions. Word has length 22 [2019-12-27 02:40:52,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:40:52,348 INFO L462 AbstractCegarLoop]: Abstraction has 26660 states and 84926 transitions. [2019-12-27 02:40:52,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:40:52,348 INFO L276 IsEmpty]: Start isEmpty. Operand 26660 states and 84926 transitions. [2019-12-27 02:40:52,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:40:52,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:40:52,356 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] [2019-12-27 02:40:52,356 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:40:52,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:40:52,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1197302566, now seen corresponding path program 1 times [2019-12-27 02:40:52,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:40:52,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480521144] [2019-12-27 02:40:52,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:40:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:40:52,443 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-27 02:40:52,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480521144] [2019-12-27 02:40:52,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:40:52,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:40:52,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248478855] [2019-12-27 02:40:52,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:40:52,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:40:52,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:40:52,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:40:52,446 INFO L87 Difference]: Start difference. First operand 26660 states and 84926 transitions. Second operand 5 states. [2019-12-27 02:40:52,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:40:52,943 INFO L93 Difference]: Finished difference Result 29361 states and 91137 transitions. [2019-12-27 02:40:52,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:40:52,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 02:40:52,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:40:53,013 INFO L225 Difference]: With dead ends: 29361 [2019-12-27 02:40:53,013 INFO L226 Difference]: Without dead ends: 29149 [2019-12-27 02:40:53,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:40:53,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29149 states. [2019-12-27 02:40:53,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29149 to 27711. [2019-12-27 02:40:53,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27711 states. [2019-12-27 02:40:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27711 states to 27711 states and 87591 transitions. [2019-12-27 02:40:53,788 INFO L78 Accepts]: Start accepts. Automaton has 27711 states and 87591 transitions. Word has length 25 [2019-12-27 02:40:53,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:40:53,788 INFO L462 AbstractCegarLoop]: Abstraction has 27711 states and 87591 transitions. [2019-12-27 02:40:53,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:40:53,789 INFO L276 IsEmpty]: Start isEmpty. Operand 27711 states and 87591 transitions. [2019-12-27 02:40:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:40:53,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:40:53,799 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] [2019-12-27 02:40:53,799 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:40:53,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:40:53,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1712753165, now seen corresponding path program 1 times [2019-12-27 02:40:53,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:40:53,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794082007] [2019-12-27 02:40:53,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:40:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:40:53,865 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-27 02:40:53,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794082007] [2019-12-27 02:40:53,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:40:53,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:40:53,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314801926] [2019-12-27 02:40:53,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:40:53,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:40:53,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:40:53,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:40:53,867 INFO L87 Difference]: Start difference. First operand 27711 states and 87591 transitions. Second operand 6 states. [2019-12-27 02:40:54,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:40:54,419 INFO L93 Difference]: Finished difference Result 31580 states and 96673 transitions. [2019-12-27 02:40:54,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:40:54,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 02:40:54,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:40:54,468 INFO L225 Difference]: With dead ends: 31580 [2019-12-27 02:40:54,468 INFO L226 Difference]: Without dead ends: 30973 [2019-12-27 02:40:54,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:40:54,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30973 states. [2019-12-27 02:40:55,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30973 to 28537. [2019-12-27 02:40:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28537 states. [2019-12-27 02:40:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28537 states to 28537 states and 89337 transitions. [2019-12-27 02:40:55,218 INFO L78 Accepts]: Start accepts. Automaton has 28537 states and 89337 transitions. Word has length 27 [2019-12-27 02:40:55,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:40:55,219 INFO L462 AbstractCegarLoop]: Abstraction has 28537 states and 89337 transitions. [2019-12-27 02:40:55,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:40:55,219 INFO L276 IsEmpty]: Start isEmpty. Operand 28537 states and 89337 transitions. [2019-12-27 02:40:55,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 02:40:55,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:40:55,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, 1, 1, 1, 1, 1, 1] [2019-12-27 02:40:55,232 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:40:55,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:40:55,233 INFO L82 PathProgramCache]: Analyzing trace with hash -449184387, now seen corresponding path program 1 times [2019-12-27 02:40:55,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:40:55,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306116501] [2019-12-27 02:40:55,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:40:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:40:55,338 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-27 02:40:55,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306116501] [2019-12-27 02:40:55,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:40:55,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:40:55,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647789399] [2019-12-27 02:40:55,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:40:55,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:40:55,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:40:55,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:40:55,341 INFO L87 Difference]: Start difference. First operand 28537 states and 89337 transitions. Second operand 5 states. [2019-12-27 02:40:55,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:40:55,444 INFO L93 Difference]: Finished difference Result 12259 states and 36322 transitions. [2019-12-27 02:40:55,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:40:55,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 02:40:55,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:40:55,465 INFO L225 Difference]: With dead ends: 12259 [2019-12-27 02:40:55,465 INFO L226 Difference]: Without dead ends: 10954 [2019-12-27 02:40:55,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:40:55,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10954 states. [2019-12-27 02:40:55,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10954 to 10264. [2019-12-27 02:40:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10264 states. [2019-12-27 02:40:55,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10264 states to 10264 states and 30610 transitions. [2019-12-27 02:40:55,650 INFO L78 Accepts]: Start accepts. Automaton has 10264 states and 30610 transitions. Word has length 30 [2019-12-27 02:40:55,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:40:55,650 INFO L462 AbstractCegarLoop]: Abstraction has 10264 states and 30610 transitions. [2019-12-27 02:40:55,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:40:55,651 INFO L276 IsEmpty]: Start isEmpty. Operand 10264 states and 30610 transitions. [2019-12-27 02:40:55,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:40:55,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:40:55,662 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] [2019-12-27 02:40:55,663 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:40:55,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:40:55,663 INFO L82 PathProgramCache]: Analyzing trace with hash 2004852157, now seen corresponding path program 1 times [2019-12-27 02:40:55,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:40:55,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160557419] [2019-12-27 02:40:55,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:40:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:40:55,742 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-27 02:40:55,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160557419] [2019-12-27 02:40:55,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:40:55,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:40:55,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444337594] [2019-12-27 02:40:55,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:40:55,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:40:55,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:40:55,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:40:55,745 INFO L87 Difference]: Start difference. First operand 10264 states and 30610 transitions. Second operand 7 states. [2019-12-27 02:40:56,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:40:56,490 INFO L93 Difference]: Finished difference Result 11498 states and 33383 transitions. [2019-12-27 02:40:56,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:40:56,490 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 02:40:56,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:40:56,512 INFO L225 Difference]: With dead ends: 11498 [2019-12-27 02:40:56,512 INFO L226 Difference]: Without dead ends: 10837 [2019-12-27 02:40:56,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:40:56,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10837 states. [2019-12-27 02:40:56,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10837 to 9151. [2019-12-27 02:40:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9151 states. [2019-12-27 02:40:56,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9151 states to 9151 states and 27027 transitions. [2019-12-27 02:40:56,691 INFO L78 Accepts]: Start accepts. Automaton has 9151 states and 27027 transitions. Word has length 33 [2019-12-27 02:40:56,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:40:56,691 INFO L462 AbstractCegarLoop]: Abstraction has 9151 states and 27027 transitions. [2019-12-27 02:40:56,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:40:56,691 INFO L276 IsEmpty]: Start isEmpty. Operand 9151 states and 27027 transitions. [2019-12-27 02:40:56,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:40:56,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:40:56,704 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] [2019-12-27 02:40:56,704 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:40:56,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:40:56,704 INFO L82 PathProgramCache]: Analyzing trace with hash -237460982, now seen corresponding path program 1 times [2019-12-27 02:40:56,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:40:56,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162911618] [2019-12-27 02:40:56,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:40:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:40:56,789 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-27 02:40:56,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162911618] [2019-12-27 02:40:56,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:40:56,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:40:56,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861988211] [2019-12-27 02:40:56,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:40:56,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:40:56,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:40:56,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:40:56,792 INFO L87 Difference]: Start difference. First operand 9151 states and 27027 transitions. Second operand 5 states. [2019-12-27 02:40:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:40:57,478 INFO L93 Difference]: Finished difference Result 15880 states and 46246 transitions. [2019-12-27 02:40:57,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:40:57,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 02:40:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:40:57,503 INFO L225 Difference]: With dead ends: 15880 [2019-12-27 02:40:57,503 INFO L226 Difference]: Without dead ends: 15880 [2019-12-27 02:40:57,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:40:57,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15880 states. [2019-12-27 02:40:57,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15880 to 14433. [2019-12-27 02:40:57,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14433 states. [2019-12-27 02:40:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14433 states to 14433 states and 42528 transitions. [2019-12-27 02:40:57,836 INFO L78 Accepts]: Start accepts. Automaton has 14433 states and 42528 transitions. Word has length 40 [2019-12-27 02:40:57,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:40:57,836 INFO L462 AbstractCegarLoop]: Abstraction has 14433 states and 42528 transitions. [2019-12-27 02:40:57,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:40:57,837 INFO L276 IsEmpty]: Start isEmpty. Operand 14433 states and 42528 transitions. [2019-12-27 02:40:57,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:40:57,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:40:57,860 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] [2019-12-27 02:40:57,860 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:40:57,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:40:57,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1997709430, now seen corresponding path program 2 times [2019-12-27 02:40:57,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:40:57,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482784227] [2019-12-27 02:40:57,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:40:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:40:57,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-27 02:40:57,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482784227] [2019-12-27 02:40:57,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:40:57,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:40:57,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101623250] [2019-12-27 02:40:57,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:40:57,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:40:57,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:40:57,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:40:57,931 INFO L87 Difference]: Start difference. First operand 14433 states and 42528 transitions. Second operand 3 states. [2019-12-27 02:40:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:40:58,004 INFO L93 Difference]: Finished difference Result 14370 states and 42323 transitions. [2019-12-27 02:40:58,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:40:58,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 02:40:58,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:40:58,032 INFO L225 Difference]: With dead ends: 14370 [2019-12-27 02:40:58,033 INFO L226 Difference]: Without dead ends: 14370 [2019-12-27 02:40:58,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:40:58,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14370 states. [2019-12-27 02:40:58,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14370 to 12867. [2019-12-27 02:40:58,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12867 states. [2019-12-27 02:40:58,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12867 states to 12867 states and 38431 transitions. [2019-12-27 02:40:58,355 INFO L78 Accepts]: Start accepts. Automaton has 12867 states and 38431 transitions. Word has length 40 [2019-12-27 02:40:58,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:40:58,355 INFO L462 AbstractCegarLoop]: Abstraction has 12867 states and 38431 transitions. [2019-12-27 02:40:58,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:40:58,356 INFO L276 IsEmpty]: Start isEmpty. Operand 12867 states and 38431 transitions. [2019-12-27 02:40:58,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 02:40:58,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:40:58,380 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-27 02:40:58,380 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:40:58,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:40:58,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1807729966, now seen corresponding path program 1 times [2019-12-27 02:40:58,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:40:58,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120101495] [2019-12-27 02:40:58,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:40:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:40:58,519 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-27 02:40:58,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120101495] [2019-12-27 02:40:58,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:40:58,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:40:58,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888301296] [2019-12-27 02:40:58,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:40:58,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:40:58,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:40:58,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:40:58,521 INFO L87 Difference]: Start difference. First operand 12867 states and 38431 transitions. Second operand 6 states. [2019-12-27 02:40:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:40:58,638 INFO L93 Difference]: Finished difference Result 12020 states and 36555 transitions. [2019-12-27 02:40:58,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:40:58,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 02:40:58,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:40:58,658 INFO L225 Difference]: With dead ends: 12020 [2019-12-27 02:40:58,658 INFO L226 Difference]: Without dead ends: 9698 [2019-12-27 02:40:58,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:40:58,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9698 states. [2019-12-27 02:40:58,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9698 to 9698. [2019-12-27 02:40:58,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9698 states. [2019-12-27 02:40:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9698 states to 9698 states and 31114 transitions. [2019-12-27 02:40:58,881 INFO L78 Accepts]: Start accepts. Automaton has 9698 states and 31114 transitions. Word has length 41 [2019-12-27 02:40:58,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:40:58,881 INFO L462 AbstractCegarLoop]: Abstraction has 9698 states and 31114 transitions. [2019-12-27 02:40:58,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:40:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 9698 states and 31114 transitions. [2019-12-27 02:40:58,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:40:58,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:40:58,893 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, 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-27 02:40:58,893 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:40:58,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:40:58,893 INFO L82 PathProgramCache]: Analyzing trace with hash 619107838, now seen corresponding path program 1 times [2019-12-27 02:40:58,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:40:58,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362042397] [2019-12-27 02:40:58,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:40:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:40:58,939 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-27 02:40:58,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362042397] [2019-12-27 02:40:58,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:40:58,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:40:58,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152663788] [2019-12-27 02:40:58,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:40:58,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:40:58,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:40:58,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:40:58,941 INFO L87 Difference]: Start difference. First operand 9698 states and 31114 transitions. Second operand 3 states. [2019-12-27 02:40:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:40:59,039 INFO L93 Difference]: Finished difference Result 13593 states and 42955 transitions. [2019-12-27 02:40:59,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:40:59,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:40:59,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:40:59,066 INFO L225 Difference]: With dead ends: 13593 [2019-12-27 02:40:59,066 INFO L226 Difference]: Without dead ends: 13593 [2019-12-27 02:40:59,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:40:59,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13593 states. [2019-12-27 02:40:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13593 to 10787. [2019-12-27 02:40:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10787 states. [2019-12-27 02:40:59,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10787 states to 10787 states and 34340 transitions. [2019-12-27 02:40:59,285 INFO L78 Accepts]: Start accepts. Automaton has 10787 states and 34340 transitions. Word has length 65 [2019-12-27 02:40:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:40:59,286 INFO L462 AbstractCegarLoop]: Abstraction has 10787 states and 34340 transitions. [2019-12-27 02:40:59,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:40:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 10787 states and 34340 transitions. [2019-12-27 02:40:59,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:40:59,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:40:59,300 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, 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-27 02:40:59,300 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:40:59,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:40:59,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1786467348, now seen corresponding path program 1 times [2019-12-27 02:40:59,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:40:59,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999391242] [2019-12-27 02:40:59,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:40:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:40:59,385 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-27 02:40:59,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999391242] [2019-12-27 02:40:59,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:40:59,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:40:59,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876904508] [2019-12-27 02:40:59,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:40:59,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:40:59,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:40:59,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:40:59,387 INFO L87 Difference]: Start difference. First operand 10787 states and 34340 transitions. Second operand 7 states. [2019-12-27 02:40:59,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:40:59,679 INFO L93 Difference]: Finished difference Result 20853 states and 65016 transitions. [2019-12-27 02:40:59,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:40:59,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 02:40:59,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:40:59,706 INFO L225 Difference]: With dead ends: 20853 [2019-12-27 02:40:59,707 INFO L226 Difference]: Without dead ends: 14946 [2019-12-27 02:40:59,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:40:59,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14946 states. [2019-12-27 02:40:59,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14946 to 12831. [2019-12-27 02:40:59,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12831 states. [2019-12-27 02:41:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12831 states to 12831 states and 40420 transitions. [2019-12-27 02:41:00,088 INFO L78 Accepts]: Start accepts. Automaton has 12831 states and 40420 transitions. Word has length 65 [2019-12-27 02:41:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:41:00,088 INFO L462 AbstractCegarLoop]: Abstraction has 12831 states and 40420 transitions. [2019-12-27 02:41:00,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:41:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 12831 states and 40420 transitions. [2019-12-27 02:41:00,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:41:00,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:41:00,108 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, 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-27 02:41:00,108 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:41:00,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:41:00,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1338323988, now seen corresponding path program 2 times [2019-12-27 02:41:00,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:41:00,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249204539] [2019-12-27 02:41:00,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:41:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:41:00,195 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-27 02:41:00,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249204539] [2019-12-27 02:41:00,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:41:00,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:41:00,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232075367] [2019-12-27 02:41:00,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:41:00,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:41:00,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:41:00,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:41:00,197 INFO L87 Difference]: Start difference. First operand 12831 states and 40420 transitions. Second operand 7 states. [2019-12-27 02:41:00,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:41:00,515 INFO L93 Difference]: Finished difference Result 23298 states and 72356 transitions. [2019-12-27 02:41:00,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:41:00,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 02:41:00,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:41:00,549 INFO L225 Difference]: With dead ends: 23298 [2019-12-27 02:41:00,549 INFO L226 Difference]: Without dead ends: 16924 [2019-12-27 02:41:00,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:41:00,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16924 states. [2019-12-27 02:41:00,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16924 to 14385. [2019-12-27 02:41:00,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14385 states. [2019-12-27 02:41:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14385 states to 14385 states and 45032 transitions. [2019-12-27 02:41:00,809 INFO L78 Accepts]: Start accepts. Automaton has 14385 states and 45032 transitions. Word has length 65 [2019-12-27 02:41:00,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:41:00,809 INFO L462 AbstractCegarLoop]: Abstraction has 14385 states and 45032 transitions. [2019-12-27 02:41:00,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:41:00,809 INFO L276 IsEmpty]: Start isEmpty. Operand 14385 states and 45032 transitions. [2019-12-27 02:41:00,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:41:00,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:41:00,825 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, 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-27 02:41:00,825 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:41:00,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:41:00,825 INFO L82 PathProgramCache]: Analyzing trace with hash -791639180, now seen corresponding path program 3 times [2019-12-27 02:41:00,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:41:00,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783298857] [2019-12-27 02:41:00,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:41:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:41:00,923 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-27 02:41:00,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783298857] [2019-12-27 02:41:00,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:41:00,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:41:00,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390088751] [2019-12-27 02:41:00,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:41:00,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:41:00,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:41:00,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:41:00,925 INFO L87 Difference]: Start difference. First operand 14385 states and 45032 transitions. Second operand 8 states. [2019-12-27 02:41:01,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:41:01,828 INFO L93 Difference]: Finished difference Result 36689 states and 111419 transitions. [2019-12-27 02:41:01,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:41:01,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 02:41:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:41:01,870 INFO L225 Difference]: With dead ends: 36689 [2019-12-27 02:41:01,870 INFO L226 Difference]: Without dead ends: 30461 [2019-12-27 02:41:01,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-27 02:41:01,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30461 states. [2019-12-27 02:41:02,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30461 to 14438. [2019-12-27 02:41:02,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14438 states. [2019-12-27 02:41:02,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14438 states to 14438 states and 45080 transitions. [2019-12-27 02:41:02,229 INFO L78 Accepts]: Start accepts. Automaton has 14438 states and 45080 transitions. Word has length 65 [2019-12-27 02:41:02,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:41:02,229 INFO L462 AbstractCegarLoop]: Abstraction has 14438 states and 45080 transitions. [2019-12-27 02:41:02,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:41:02,229 INFO L276 IsEmpty]: Start isEmpty. Operand 14438 states and 45080 transitions. [2019-12-27 02:41:02,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:41:02,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:41:02,247 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, 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-27 02:41:02,247 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:41:02,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:41:02,247 INFO L82 PathProgramCache]: Analyzing trace with hash 858040942, now seen corresponding path program 1 times [2019-12-27 02:41:02,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:41:02,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097850318] [2019-12-27 02:41:02,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:41:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:41:02,290 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-27 02:41:02,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097850318] [2019-12-27 02:41:02,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:41:02,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:41:02,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288609526] [2019-12-27 02:41:02,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:41:02,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:41:02,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:41:02,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:41:02,292 INFO L87 Difference]: Start difference. First operand 14438 states and 45080 transitions. Second operand 3 states. [2019-12-27 02:41:02,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:41:02,410 INFO L93 Difference]: Finished difference Result 17644 states and 53899 transitions. [2019-12-27 02:41:02,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:41:02,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:41:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:41:02,450 INFO L225 Difference]: With dead ends: 17644 [2019-12-27 02:41:02,451 INFO L226 Difference]: Without dead ends: 17644 [2019-12-27 02:41:02,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:41:02,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17644 states. Received shutdown request... [2019-12-27 02:41:02,864 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 02:41:02,868 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 02:41:02,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:41:02 BasicIcfg [2019-12-27 02:41:02,870 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:41:02,877 INFO L168 Benchmark]: Toolchain (without parser) took 194221.08 ms. Allocated memory was 145.2 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 100.5 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 02:41:02,883 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 02:41:02,883 INFO L168 Benchmark]: CACSL2BoogieTranslator took 883.38 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 155.5 MB in the end (delta: -55.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:41:02,884 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.49 ms. Allocated memory is still 202.4 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:41:02,884 INFO L168 Benchmark]: Boogie Preprocessor took 42.85 ms. Allocated memory is still 202.4 MB. Free memory was 152.8 MB in the beginning and 150.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:41:02,887 INFO L168 Benchmark]: RCFGBuilder took 872.43 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 100.5 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-27 02:41:02,889 INFO L168 Benchmark]: TraceAbstraction took 192348.90 ms. Allocated memory was 202.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 99.9 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 02:41:02,892 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.22 ms. Allocated memory is still 145.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 883.38 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 155.5 MB in the end (delta: -55.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.49 ms. Allocated memory is still 202.4 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.85 ms. Allocated memory is still 202.4 MB. Free memory was 152.8 MB in the beginning and 150.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 872.43 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 100.5 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192348.90 ms. Allocated memory was 202.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 99.9 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 31 ChoiceCompositions, 7291 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 34 SemBasedMoverChecksPositive, 267 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 81673 CheckedPairsTotal, 115 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: TIMEOUT, OverallTime: 192.1s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 63.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3776 SDtfs, 4707 SDslu, 7653 SDs, 0 SdLazy, 3684 SolverSat, 223 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213814occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 100.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 146374 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 701 NumberOfCodeBlocks, 701 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 680 ConstructedInterpolants, 0 QuantifiedInterpolants, 80900 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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 could not prove your program: Timeout Completed graceful shutdown