/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:38:54,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:38:54,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:38:54,607 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:38:54,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:38:54,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:38:54,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:38:54,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:38:54,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:38:54,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:38:54,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:38:54,616 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:38:54,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:38:54,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:38:54,618 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:38:54,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:38:54,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:38:54,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:38:54,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:38:54,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:38:54,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:38:54,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:38:54,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:38:54,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:38:54,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:38:54,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:38:54,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:38:54,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:38:54,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:38:54,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:38:54,634 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:38:54,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:38:54,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:38:54,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:38:54,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:38:54,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:38:54,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:38:54,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:38:54,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:38:54,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:38:54,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:38:54,642 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:38:54,663 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:38:54,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:38:54,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:38:54,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:38:54,665 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:38:54,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:38:54,665 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:38:54,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:38:54,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:38:54,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:38:54,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:38:54,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:38:54,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:38:54,667 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:38:54,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:38:54,667 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:38:54,667 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:38:54,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:38:54,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:38:54,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:38:54,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:38:54,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:38:54,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:38:54,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:38:54,669 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:38:54,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:38:54,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:38:54,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:38:54,670 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:38:54,670 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:38:54,934 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:38:54,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:38:54,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:38:54,952 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:38:54,952 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:38:54,953 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc.i [2019-12-18 14:38:55,011 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/947b14614/cfc47ca875cf4372b2927e7cf6e6acf8/FLAG952de2ffb [2019-12-18 14:38:55,575 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:38:55,577 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc.i [2019-12-18 14:38:55,600 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/947b14614/cfc47ca875cf4372b2927e7cf6e6acf8/FLAG952de2ffb [2019-12-18 14:38:55,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/947b14614/cfc47ca875cf4372b2927e7cf6e6acf8 [2019-12-18 14:38:55,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:38:55,890 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:38:55,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:38:55,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:38:55,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:38:55,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:38:55" (1/1) ... [2019-12-18 14:38:55,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a4c44d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:55, skipping insertion in model container [2019-12-18 14:38:55,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:38:55" (1/1) ... [2019-12-18 14:38:55,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:38:55,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:38:56,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:38:56,436 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:38:56,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:38:56,594 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:38:56,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:56 WrapperNode [2019-12-18 14:38:56,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:38:56,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:38:56,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:38:56,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:38:56,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:56" (1/1) ... [2019-12-18 14:38:56,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:56" (1/1) ... [2019-12-18 14:38:56,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:38:56,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:38:56,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:38:56,656 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:38:56,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:56" (1/1) ... [2019-12-18 14:38:56,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:56" (1/1) ... [2019-12-18 14:38:56,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:56" (1/1) ... [2019-12-18 14:38:56,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:56" (1/1) ... [2019-12-18 14:38:56,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:56" (1/1) ... [2019-12-18 14:38:56,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:56" (1/1) ... [2019-12-18 14:38:56,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:56" (1/1) ... [2019-12-18 14:38:56,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:38:56,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:38:56,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:38:56,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:38:56,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:38:56,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:38:56,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:38:56,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:38:56,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:38:56,772 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:38:56,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:38:56,772 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:38:56,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:38:56,773 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:38:56,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:38:56,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:38:56,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:38:56,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:38:56,775 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:38:57,543 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:38:57,543 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:38:57,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:38:57 BoogieIcfgContainer [2019-12-18 14:38:57,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:38:57,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:38:57,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:38:57,550 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:38:57,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:38:55" (1/3) ... [2019-12-18 14:38:57,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5d4207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:38:57, skipping insertion in model container [2019-12-18 14:38:57,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:56" (2/3) ... [2019-12-18 14:38:57,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5d4207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:38:57, skipping insertion in model container [2019-12-18 14:38:57,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:38:57" (3/3) ... [2019-12-18 14:38:57,554 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc.i [2019-12-18 14:38:57,564 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:38:57,564 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:38:57,571 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:38:57,572 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:38:57,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,613 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,613 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,644 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,644 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,668 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,668 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,677 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,677 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,678 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,683 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,684 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,687 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,688 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:57,707 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:38:57,728 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:38:57,729 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:38:57,729 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:38:57,729 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:38:57,729 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:38:57,729 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:38:57,729 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:38:57,730 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:38:57,747 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-18 14:38:57,749 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 14:38:57,835 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 14:38:57,836 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:38:57,856 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:38:57,884 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 14:38:57,928 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 14:38:57,928 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:38:57,936 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:38:57,956 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 14:38:57,957 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:39:02,908 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-18 14:39:03,312 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 14:39:03,422 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 14:39:03,518 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66094 [2019-12-18 14:39:03,519 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 14:39:03,522 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-18 14:39:14,761 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-18 14:39:14,763 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-18 14:39:14,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:39:14,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:14,771 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:39:14,771 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:14,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:14,779 INFO L82 PathProgramCache]: Analyzing trace with hash 794637732, now seen corresponding path program 1 times [2019-12-18 14:39:14,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:14,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447878602] [2019-12-18 14:39:14,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:15,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:39:15,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447878602] [2019-12-18 14:39:15,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:15,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:39:15,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046078707] [2019-12-18 14:39:15,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:39:15,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:15,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:39:15,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:39:15,050 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-18 14:39:16,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:16,299 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-18 14:39:16,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:39:16,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:39:16,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:19,255 INFO L225 Difference]: With dead ends: 85012 [2019-12-18 14:39:19,256 INFO L226 Difference]: Without dead ends: 80140 [2019-12-18 14:39:19,257 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-18 14:39:22,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-18 14:39:24,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-18 14:39:24,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-18 14:39:24,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-18 14:39:24,955 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-18 14:39:24,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:24,955 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-18 14:39:24,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:39:24,955 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-18 14:39:24,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:39:24,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:24,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:24,964 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:24,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:24,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1795694344, now seen corresponding path program 1 times [2019-12-18 14:39:24,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:24,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748618393] [2019-12-18 14:39:24,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:39:25,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748618393] [2019-12-18 14:39:25,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:25,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:39:25,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354294453] [2019-12-18 14:39:25,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:39:25,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:25,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:39:25,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:39:25,096 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-18 14:39:29,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:29,848 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-18 14:39:29,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:39:29,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:39:29,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:30,232 INFO L225 Difference]: With dead ends: 123388 [2019-12-18 14:39:30,232 INFO L226 Difference]: Without dead ends: 123290 [2019-12-18 14:39:30,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:39:33,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-18 14:39:35,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-18 14:39:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-18 14:39:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-18 14:39:36,688 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-18 14:39:36,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:36,689 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-18 14:39:36,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:39:36,690 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-18 14:39:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:39:36,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:36,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:36,694 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:36,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:36,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1307118492, now seen corresponding path program 1 times [2019-12-18 14:39:36,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:36,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465403663] [2019-12-18 14:39:36,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:39:36,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465403663] [2019-12-18 14:39:36,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:36,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:39:36,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666094814] [2019-12-18 14:39:36,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:39:36,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:36,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:39:36,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:39:36,838 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-18 14:39:37,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:37,897 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-18 14:39:37,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:39:37,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:39:37,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:44,114 INFO L225 Difference]: With dead ends: 159677 [2019-12-18 14:39:44,114 INFO L226 Difference]: Without dead ends: 159565 [2019-12-18 14:39:44,115 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-18 14:39:47,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-18 14:39:49,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-18 14:39:49,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-18 14:39:50,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-18 14:39:50,106 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-18 14:39:50,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:50,106 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-18 14:39:50,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:39:50,106 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-18 14:39:50,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:39:50,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:50,111 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:50,111 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:50,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:50,111 INFO L82 PathProgramCache]: Analyzing trace with hash 2137171342, now seen corresponding path program 1 times [2019-12-18 14:39:50,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:50,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653073896] [2019-12-18 14:39:50,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:50,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:39:50,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653073896] [2019-12-18 14:39:50,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:50,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:39:50,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205104525] [2019-12-18 14:39:50,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:39:50,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:50,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:39:50,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:39:50,165 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 3 states. [2019-12-18 14:39:52,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:52,290 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-18 14:39:52,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:39:52,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 14:39:52,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:52,938 INFO L225 Difference]: With dead ends: 181618 [2019-12-18 14:39:52,938 INFO L226 Difference]: Without dead ends: 181618 [2019-12-18 14:39:52,939 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-18 14:40:02,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-18 14:40:05,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-18 14:40:05,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-18 14:40:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-18 14:40:06,066 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-18 14:40:06,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:06,067 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-18 14:40:06,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:40:06,067 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-18 14:40:06,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:40:06,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:06,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:40:06,070 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:06,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:06,070 INFO L82 PathProgramCache]: Analyzing trace with hash 2137037670, now seen corresponding path program 1 times [2019-12-18 14:40:06,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:06,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955307423] [2019-12-18 14:40:06,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:06,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:40:06,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955307423] [2019-12-18 14:40:06,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:06,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:40:06,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612921028] [2019-12-18 14:40:06,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:40:06,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:06,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:40:06,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:40:06,149 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 4 states. [2019-12-18 14:40:12,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:12,575 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-18 14:40:12,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:40:12,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:40:12,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:13,139 INFO L225 Difference]: With dead ends: 179622 [2019-12-18 14:40:13,139 INFO L226 Difference]: Without dead ends: 179542 [2019-12-18 14:40:13,139 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-18 14:40:16,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-18 14:40:20,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-18 14:40:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-18 14:40:20,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-18 14:40:20,725 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-18 14:40:20,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:20,725 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-18 14:40:20,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:40:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-18 14:40:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:40:20,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:20,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:40:20,730 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:20,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:20,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1997758702, now seen corresponding path program 1 times [2019-12-18 14:40:20,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:20,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114846738] [2019-12-18 14:40:20,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:40:20,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114846738] [2019-12-18 14:40:20,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:20,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:40:20,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106505461] [2019-12-18 14:40:20,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:40:20,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:20,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:40:20,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:40:20,794 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 4 states. [2019-12-18 14:40:27,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:27,736 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-18 14:40:27,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:40:27,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:40:27,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:28,314 INFO L225 Difference]: With dead ends: 189091 [2019-12-18 14:40:28,314 INFO L226 Difference]: Without dead ends: 188995 [2019-12-18 14:40:28,314 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-18 14:40:32,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-18 14:40:35,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-18 14:40:35,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-18 14:40:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-18 14:40:36,445 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-18 14:40:36,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:36,445 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-18 14:40:36,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:40:36,445 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-18 14:40:36,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 14:40:36,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:36,463 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:40:36,463 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:36,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:36,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1754746770, now seen corresponding path program 1 times [2019-12-18 14:40:36,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:36,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084431995] [2019-12-18 14:40:36,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:40:36,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084431995] [2019-12-18 14:40:36,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:36,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:40:36,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261625725] [2019-12-18 14:40:36,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:40:36,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:36,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:40:36,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:40:36,505 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-18 14:40:37,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:37,278 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-18 14:40:37,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:40:37,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 14:40:37,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:44,242 INFO L225 Difference]: With dead ends: 160940 [2019-12-18 14:40:44,242 INFO L226 Difference]: Without dead ends: 160940 [2019-12-18 14:40:44,243 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-18 14:40:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-18 14:40:50,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-18 14:40:50,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-18 14:40:51,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-18 14:40:51,068 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-18 14:40:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:51,068 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-18 14:40:51,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:40:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-18 14:40:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:40:51,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:51,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:40:51,088 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:51,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:51,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1406595818, now seen corresponding path program 1 times [2019-12-18 14:40:51,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:51,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938661447] [2019-12-18 14:40:51,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:40:51,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938661447] [2019-12-18 14:40:51,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:51,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:40:51,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239513360] [2019-12-18 14:40:51,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:40:51,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:51,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:40:51,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:40:51,144 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 4 states. [2019-12-18 14:40:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:57,366 INFO L93 Difference]: Finished difference Result 255238 states and 1058186 transitions. [2019-12-18 14:40:57,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:40:57,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 14:40:57,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:57,785 INFO L225 Difference]: With dead ends: 255238 [2019-12-18 14:40:57,785 INFO L226 Difference]: Without dead ends: 128270 [2019-12-18 14:40:57,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-18 14:41:05,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128270 states. [2019-12-18 14:41:07,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128270 to 128270. [2019-12-18 14:41:07,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128270 states. [2019-12-18 14:41:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128270 states to 128270 states and 523459 transitions. [2019-12-18 14:41:08,109 INFO L78 Accepts]: Start accepts. Automaton has 128270 states and 523459 transitions. Word has length 19 [2019-12-18 14:41:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:08,110 INFO L462 AbstractCegarLoop]: Abstraction has 128270 states and 523459 transitions. [2019-12-18 14:41:08,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:41:08,110 INFO L276 IsEmpty]: Start isEmpty. Operand 128270 states and 523459 transitions. [2019-12-18 14:41:08,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:41:08,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:08,122 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:08,122 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:08,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:08,123 INFO L82 PathProgramCache]: Analyzing trace with hash -2069277611, now seen corresponding path program 1 times [2019-12-18 14:41:08,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:08,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637017113] [2019-12-18 14:41:08,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:08,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:08,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637017113] [2019-12-18 14:41:08,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:08,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:41:08,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402332718] [2019-12-18 14:41:08,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:41:08,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:08,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:41:08,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:41:08,230 INFO L87 Difference]: Start difference. First operand 128270 states and 523459 transitions. Second operand 4 states. [2019-12-18 14:41:08,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:08,444 INFO L93 Difference]: Finished difference Result 36423 states and 125388 transitions. [2019-12-18 14:41:08,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:41:08,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 14:41:08,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:08,512 INFO L225 Difference]: With dead ends: 36423 [2019-12-18 14:41:08,512 INFO L226 Difference]: Without dead ends: 28545 [2019-12-18 14:41:08,513 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-18 14:41:08,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28545 states. [2019-12-18 14:41:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28545 to 28545. [2019-12-18 14:41:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28545 states. [2019-12-18 14:41:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28545 states to 28545 states and 94430 transitions. [2019-12-18 14:41:09,919 INFO L78 Accepts]: Start accepts. Automaton has 28545 states and 94430 transitions. Word has length 19 [2019-12-18 14:41:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:09,919 INFO L462 AbstractCegarLoop]: Abstraction has 28545 states and 94430 transitions. [2019-12-18 14:41:09,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:41:09,919 INFO L276 IsEmpty]: Start isEmpty. Operand 28545 states and 94430 transitions. [2019-12-18 14:41:09,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:41:09,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:09,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:09,925 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:09,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:09,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1918737222, now seen corresponding path program 1 times [2019-12-18 14:41:09,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:09,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378222609] [2019-12-18 14:41:09,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:09,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378222609] [2019-12-18 14:41:09,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:09,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:41:09,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298901110] [2019-12-18 14:41:09,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:41:09,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:09,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:41:09,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:41:09,983 INFO L87 Difference]: Start difference. First operand 28545 states and 94430 transitions. Second operand 5 states. [2019-12-18 14:41:10,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:10,404 INFO L93 Difference]: Finished difference Result 37265 states and 121195 transitions. [2019-12-18 14:41:10,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:41:10,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 14:41:10,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:10,465 INFO L225 Difference]: With dead ends: 37265 [2019-12-18 14:41:10,465 INFO L226 Difference]: Without dead ends: 36963 [2019-12-18 14:41:10,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:41:10,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36963 states. [2019-12-18 14:41:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36963 to 29525. [2019-12-18 14:41:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29525 states. [2019-12-18 14:41:11,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29525 states to 29525 states and 97651 transitions. [2019-12-18 14:41:11,011 INFO L78 Accepts]: Start accepts. Automaton has 29525 states and 97651 transitions. Word has length 22 [2019-12-18 14:41:11,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:11,011 INFO L462 AbstractCegarLoop]: Abstraction has 29525 states and 97651 transitions. [2019-12-18 14:41:11,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:41:11,012 INFO L276 IsEmpty]: Start isEmpty. Operand 29525 states and 97651 transitions. [2019-12-18 14:41:11,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:41:11,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:11,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:11,017 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:11,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:11,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1233781658, now seen corresponding path program 1 times [2019-12-18 14:41:11,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:11,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329198251] [2019-12-18 14:41:11,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:11,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329198251] [2019-12-18 14:41:11,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:11,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:41:11,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352874184] [2019-12-18 14:41:11,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:41:11,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:11,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:41:11,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:41:11,085 INFO L87 Difference]: Start difference. First operand 29525 states and 97651 transitions. Second operand 5 states. [2019-12-18 14:41:12,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:12,309 INFO L93 Difference]: Finished difference Result 37362 states and 121787 transitions. [2019-12-18 14:41:12,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:41:12,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 14:41:12,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:12,366 INFO L225 Difference]: With dead ends: 37362 [2019-12-18 14:41:12,366 INFO L226 Difference]: Without dead ends: 36942 [2019-12-18 14:41:12,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:41:12,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36942 states. [2019-12-18 14:41:12,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36942 to 28461. [2019-12-18 14:41:12,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28461 states. [2019-12-18 14:41:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28461 states to 28461 states and 94342 transitions. [2019-12-18 14:41:12,905 INFO L78 Accepts]: Start accepts. Automaton has 28461 states and 94342 transitions. Word has length 22 [2019-12-18 14:41:12,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:12,906 INFO L462 AbstractCegarLoop]: Abstraction has 28461 states and 94342 transitions. [2019-12-18 14:41:12,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:41:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 28461 states and 94342 transitions. [2019-12-18 14:41:12,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:41:12,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:12,914 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-18 14:41:12,914 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:12,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:12,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1628067424, now seen corresponding path program 1 times [2019-12-18 14:41:12,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:12,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440531956] [2019-12-18 14:41:12,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:12,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440531956] [2019-12-18 14:41:12,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:12,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:41:12,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337883762] [2019-12-18 14:41:12,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:41:12,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:12,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:41:12,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:41:12,979 INFO L87 Difference]: Start difference. First operand 28461 states and 94342 transitions. Second operand 5 states. [2019-12-18 14:41:13,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:13,342 INFO L93 Difference]: Finished difference Result 28874 states and 95112 transitions. [2019-12-18 14:41:13,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:41:13,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 14:41:13,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:13,411 INFO L225 Difference]: With dead ends: 28874 [2019-12-18 14:41:13,411 INFO L226 Difference]: Without dead ends: 28434 [2019-12-18 14:41:13,411 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-18 14:41:13,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28434 states. [2019-12-18 14:41:13,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28434 to 28291. [2019-12-18 14:41:13,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28291 states. [2019-12-18 14:41:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28291 states to 28291 states and 93821 transitions. [2019-12-18 14:41:16,041 INFO L78 Accepts]: Start accepts. Automaton has 28291 states and 93821 transitions. Word has length 25 [2019-12-18 14:41:16,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:16,042 INFO L462 AbstractCegarLoop]: Abstraction has 28291 states and 93821 transitions. [2019-12-18 14:41:16,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:41:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 28291 states and 93821 transitions. [2019-12-18 14:41:16,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 14:41:16,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:16,055 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] [2019-12-18 14:41:16,055 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:16,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:16,056 INFO L82 PathProgramCache]: Analyzing trace with hash -126544367, now seen corresponding path program 1 times [2019-12-18 14:41:16,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:16,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850843887] [2019-12-18 14:41:16,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:16,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850843887] [2019-12-18 14:41:16,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:16,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:41:16,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898720733] [2019-12-18 14:41:16,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:41:16,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:16,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:41:16,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:41:16,122 INFO L87 Difference]: Start difference. First operand 28291 states and 93821 transitions. Second operand 5 states. [2019-12-18 14:41:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:16,500 INFO L93 Difference]: Finished difference Result 37145 states and 121294 transitions. [2019-12-18 14:41:16,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:41:16,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 14:41:16,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:16,564 INFO L225 Difference]: With dead ends: 37145 [2019-12-18 14:41:16,564 INFO L226 Difference]: Without dead ends: 36771 [2019-12-18 14:41:16,565 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-18 14:41:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36771 states. [2019-12-18 14:41:17,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36771 to 29755. [2019-12-18 14:41:17,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29755 states. [2019-12-18 14:41:17,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29755 states to 29755 states and 98514 transitions. [2019-12-18 14:41:17,162 INFO L78 Accepts]: Start accepts. Automaton has 29755 states and 98514 transitions. Word has length 28 [2019-12-18 14:41:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:17,163 INFO L462 AbstractCegarLoop]: Abstraction has 29755 states and 98514 transitions. [2019-12-18 14:41:17,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:41:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand 29755 states and 98514 transitions. [2019-12-18 14:41:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 14:41:17,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:17,177 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] [2019-12-18 14:41:17,177 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:17,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:17,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1319845053, now seen corresponding path program 1 times [2019-12-18 14:41:17,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:17,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894704165] [2019-12-18 14:41:17,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:17,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894704165] [2019-12-18 14:41:17,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:17,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:41:17,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362436176] [2019-12-18 14:41:17,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:41:17,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:17,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:41:17,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:41:17,211 INFO L87 Difference]: Start difference. First operand 29755 states and 98514 transitions. Second operand 3 states. [2019-12-18 14:41:17,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:17,389 INFO L93 Difference]: Finished difference Result 38320 states and 126138 transitions. [2019-12-18 14:41:17,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:41:17,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-18 14:41:17,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:17,463 INFO L225 Difference]: With dead ends: 38320 [2019-12-18 14:41:17,463 INFO L226 Difference]: Without dead ends: 38320 [2019-12-18 14:41:17,463 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-18 14:41:17,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38320 states. [2019-12-18 14:41:18,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38320 to 30661. [2019-12-18 14:41:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30661 states. [2019-12-18 14:41:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30661 states to 30661 states and 100227 transitions. [2019-12-18 14:41:18,320 INFO L78 Accepts]: Start accepts. Automaton has 30661 states and 100227 transitions. Word has length 28 [2019-12-18 14:41:18,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:18,321 INFO L462 AbstractCegarLoop]: Abstraction has 30661 states and 100227 transitions. [2019-12-18 14:41:18,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:41:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand 30661 states and 100227 transitions. [2019-12-18 14:41:18,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 14:41:18,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:18,336 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] [2019-12-18 14:41:18,337 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:18,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:18,337 INFO L82 PathProgramCache]: Analyzing trace with hash 234862090, now seen corresponding path program 1 times [2019-12-18 14:41:18,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:18,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240731971] [2019-12-18 14:41:18,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:18,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:18,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240731971] [2019-12-18 14:41:18,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:18,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:41:18,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22303190] [2019-12-18 14:41:18,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:41:18,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:18,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:41:18,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:41:18,388 INFO L87 Difference]: Start difference. First operand 30661 states and 100227 transitions. Second operand 5 states. [2019-12-18 14:41:18,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:18,766 INFO L93 Difference]: Finished difference Result 39205 states and 126499 transitions. [2019-12-18 14:41:18,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:41:18,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 14:41:18,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:18,827 INFO L225 Difference]: With dead ends: 39205 [2019-12-18 14:41:18,827 INFO L226 Difference]: Without dead ends: 38811 [2019-12-18 14:41:18,828 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-18 14:41:18,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38811 states. [2019-12-18 14:41:19,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38811 to 30894. [2019-12-18 14:41:19,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30894 states. [2019-12-18 14:41:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30894 states to 30894 states and 100767 transitions. [2019-12-18 14:41:19,385 INFO L78 Accepts]: Start accepts. Automaton has 30894 states and 100767 transitions. Word has length 29 [2019-12-18 14:41:19,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:19,385 INFO L462 AbstractCegarLoop]: Abstraction has 30894 states and 100767 transitions. [2019-12-18 14:41:19,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:41:19,386 INFO L276 IsEmpty]: Start isEmpty. Operand 30894 states and 100767 transitions. [2019-12-18 14:41:19,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 14:41:19,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:19,399 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] [2019-12-18 14:41:19,399 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:19,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:19,399 INFO L82 PathProgramCache]: Analyzing trace with hash 805904020, now seen corresponding path program 1 times [2019-12-18 14:41:19,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:19,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656344557] [2019-12-18 14:41:19,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:19,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656344557] [2019-12-18 14:41:19,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:19,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:41:19,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476574328] [2019-12-18 14:41:19,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:41:19,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:19,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:41:19,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:41:19,431 INFO L87 Difference]: Start difference. First operand 30894 states and 100767 transitions. Second operand 3 states. [2019-12-18 14:41:19,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:19,836 INFO L93 Difference]: Finished difference Result 49254 states and 162311 transitions. [2019-12-18 14:41:19,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:41:19,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 14:41:19,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:19,870 INFO L225 Difference]: With dead ends: 49254 [2019-12-18 14:41:19,870 INFO L226 Difference]: Without dead ends: 21429 [2019-12-18 14:41:19,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:41:19,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21429 states. [2019-12-18 14:41:20,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21429 to 20333. [2019-12-18 14:41:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20333 states. [2019-12-18 14:41:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20333 states to 20333 states and 67715 transitions. [2019-12-18 14:41:20,226 INFO L78 Accepts]: Start accepts. Automaton has 20333 states and 67715 transitions. Word has length 29 [2019-12-18 14:41:20,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:20,226 INFO L462 AbstractCegarLoop]: Abstraction has 20333 states and 67715 transitions. [2019-12-18 14:41:20,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:41:20,227 INFO L276 IsEmpty]: Start isEmpty. Operand 20333 states and 67715 transitions. [2019-12-18 14:41:20,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 14:41:20,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:20,235 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:20,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:20,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1673459084, now seen corresponding path program 1 times [2019-12-18 14:41:20,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:20,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225332844] [2019-12-18 14:41:20,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:20,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225332844] [2019-12-18 14:41:20,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:20,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:41:20,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605715170] [2019-12-18 14:41:20,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:41:20,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:20,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:41:20,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:41:20,326 INFO L87 Difference]: Start difference. First operand 20333 states and 67715 transitions. Second operand 5 states. [2019-12-18 14:41:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:20,934 INFO L93 Difference]: Finished difference Result 34767 states and 112990 transitions. [2019-12-18 14:41:20,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:41:20,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 14:41:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:20,989 INFO L225 Difference]: With dead ends: 34767 [2019-12-18 14:41:20,989 INFO L226 Difference]: Without dead ends: 34767 [2019-12-18 14:41:20,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:41:21,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34767 states. [2019-12-18 14:41:21,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34767 to 29090. [2019-12-18 14:41:21,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29090 states. [2019-12-18 14:41:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29090 states to 29090 states and 95089 transitions. [2019-12-18 14:41:21,511 INFO L78 Accepts]: Start accepts. Automaton has 29090 states and 95089 transitions. Word has length 30 [2019-12-18 14:41:21,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:21,511 INFO L462 AbstractCegarLoop]: Abstraction has 29090 states and 95089 transitions. [2019-12-18 14:41:21,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:41:21,511 INFO L276 IsEmpty]: Start isEmpty. Operand 29090 states and 95089 transitions. [2019-12-18 14:41:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 14:41:21,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:21,524 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] [2019-12-18 14:41:21,524 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:21,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:21,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1413309470, now seen corresponding path program 1 times [2019-12-18 14:41:21,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:21,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532067210] [2019-12-18 14:41:21,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:21,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532067210] [2019-12-18 14:41:21,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:21,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:41:21,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033987692] [2019-12-18 14:41:21,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:41:21,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:21,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:41:21,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:41:21,847 INFO L87 Difference]: Start difference. First operand 29090 states and 95089 transitions. Second operand 5 states. [2019-12-18 14:41:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:21,949 INFO L93 Difference]: Finished difference Result 13178 states and 39760 transitions. [2019-12-18 14:41:21,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:41:21,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-18 14:41:21,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:21,967 INFO L225 Difference]: With dead ends: 13178 [2019-12-18 14:41:21,967 INFO L226 Difference]: Without dead ends: 11110 [2019-12-18 14:41:21,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:41:22,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11110 states. [2019-12-18 14:41:22,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11110 to 10943. [2019-12-18 14:41:22,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10943 states. [2019-12-18 14:41:22,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10943 states to 10943 states and 32777 transitions. [2019-12-18 14:41:22,119 INFO L78 Accepts]: Start accepts. Automaton has 10943 states and 32777 transitions. Word has length 31 [2019-12-18 14:41:22,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:22,119 INFO L462 AbstractCegarLoop]: Abstraction has 10943 states and 32777 transitions. [2019-12-18 14:41:22,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:41:22,120 INFO L276 IsEmpty]: Start isEmpty. Operand 10943 states and 32777 transitions. [2019-12-18 14:41:22,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:41:22,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:22,131 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-18 14:41:22,131 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:22,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:22,131 INFO L82 PathProgramCache]: Analyzing trace with hash 483024013, now seen corresponding path program 1 times [2019-12-18 14:41:22,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:22,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146038367] [2019-12-18 14:41:22,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:22,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:22,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146038367] [2019-12-18 14:41:22,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:22,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:41:22,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48892048] [2019-12-18 14:41:22,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:41:22,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:22,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:41:22,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:41:22,209 INFO L87 Difference]: Start difference. First operand 10943 states and 32777 transitions. Second operand 6 states. [2019-12-18 14:41:22,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:22,435 INFO L93 Difference]: Finished difference Result 11069 states and 33011 transitions. [2019-12-18 14:41:22,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:41:22,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 14:41:22,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:22,454 INFO L225 Difference]: With dead ends: 11069 [2019-12-18 14:41:22,454 INFO L226 Difference]: Without dead ends: 10842 [2019-12-18 14:41:22,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:41:22,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10842 states. [2019-12-18 14:41:22,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10842 to 10842. [2019-12-18 14:41:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10842 states. [2019-12-18 14:41:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10842 states to 10842 states and 32566 transitions. [2019-12-18 14:41:22,628 INFO L78 Accepts]: Start accepts. Automaton has 10842 states and 32566 transitions. Word has length 40 [2019-12-18 14:41:22,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:22,629 INFO L462 AbstractCegarLoop]: Abstraction has 10842 states and 32566 transitions. [2019-12-18 14:41:22,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:41:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 10842 states and 32566 transitions. [2019-12-18 14:41:22,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:41:22,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:22,642 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-18 14:41:22,642 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:22,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:22,643 INFO L82 PathProgramCache]: Analyzing trace with hash -891252526, now seen corresponding path program 1 times [2019-12-18 14:41:22,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:22,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119908745] [2019-12-18 14:41:22,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:22,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:22,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119908745] [2019-12-18 14:41:22,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:22,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:41:22,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996258456] [2019-12-18 14:41:22,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:41:22,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:22,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:41:22,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:41:22,721 INFO L87 Difference]: Start difference. First operand 10842 states and 32566 transitions. Second operand 6 states. [2019-12-18 14:41:23,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:23,403 INFO L93 Difference]: Finished difference Result 20964 states and 62804 transitions. [2019-12-18 14:41:23,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:41:23,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 14:41:23,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:23,434 INFO L225 Difference]: With dead ends: 20964 [2019-12-18 14:41:23,434 INFO L226 Difference]: Without dead ends: 20964 [2019-12-18 14:41:23,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:41:23,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20964 states. [2019-12-18 14:41:23,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20964 to 13761. [2019-12-18 14:41:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13761 states. [2019-12-18 14:41:23,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 41473 transitions. [2019-12-18 14:41:23,678 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 41473 transitions. Word has length 40 [2019-12-18 14:41:23,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:23,678 INFO L462 AbstractCegarLoop]: Abstraction has 13761 states and 41473 transitions. [2019-12-18 14:41:23,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:41:23,678 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 41473 transitions. [2019-12-18 14:41:23,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:41:23,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:23,697 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-18 14:41:23,697 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:23,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:23,698 INFO L82 PathProgramCache]: Analyzing trace with hash 820794198, now seen corresponding path program 2 times [2019-12-18 14:41:23,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:23,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099201442] [2019-12-18 14:41:23,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:23,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099201442] [2019-12-18 14:41:23,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:23,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:41:23,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170660850] [2019-12-18 14:41:23,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:41:23,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:23,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:41:23,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:41:23,747 INFO L87 Difference]: Start difference. First operand 13761 states and 41473 transitions. Second operand 3 states. [2019-12-18 14:41:23,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:23,791 INFO L93 Difference]: Finished difference Result 10124 states and 29791 transitions. [2019-12-18 14:41:23,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:41:23,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 14:41:23,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:23,805 INFO L225 Difference]: With dead ends: 10124 [2019-12-18 14:41:23,806 INFO L226 Difference]: Without dead ends: 10124 [2019-12-18 14:41:23,806 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-18 14:41:23,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10124 states. [2019-12-18 14:41:23,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10124 to 10086. [2019-12-18 14:41:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10086 states. [2019-12-18 14:41:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10086 states to 10086 states and 29686 transitions. [2019-12-18 14:41:23,941 INFO L78 Accepts]: Start accepts. Automaton has 10086 states and 29686 transitions. Word has length 40 [2019-12-18 14:41:23,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:23,942 INFO L462 AbstractCegarLoop]: Abstraction has 10086 states and 29686 transitions. [2019-12-18 14:41:23,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:41:23,942 INFO L276 IsEmpty]: Start isEmpty. Operand 10086 states and 29686 transitions. [2019-12-18 14:41:23,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:41:23,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:23,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:23,952 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:23,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:23,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1848652026, now seen corresponding path program 1 times [2019-12-18 14:41:23,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:23,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057236993] [2019-12-18 14:41:23,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:24,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057236993] [2019-12-18 14:41:24,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:24,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:41:24,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938724656] [2019-12-18 14:41:24,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:41:24,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:24,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:41:24,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:41:24,042 INFO L87 Difference]: Start difference. First operand 10086 states and 29686 transitions. Second operand 6 states. [2019-12-18 14:41:24,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:24,290 INFO L93 Difference]: Finished difference Result 10072 states and 29653 transitions. [2019-12-18 14:41:24,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:41:24,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 14:41:24,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:24,302 INFO L225 Difference]: With dead ends: 10072 [2019-12-18 14:41:24,302 INFO L226 Difference]: Without dead ends: 9731 [2019-12-18 14:41:24,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:41:24,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9731 states. [2019-12-18 14:41:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9731 to 9731. [2019-12-18 14:41:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9731 states. [2019-12-18 14:41:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9731 states to 9731 states and 28998 transitions. [2019-12-18 14:41:24,523 INFO L78 Accepts]: Start accepts. Automaton has 9731 states and 28998 transitions. Word has length 41 [2019-12-18 14:41:24,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:24,523 INFO L462 AbstractCegarLoop]: Abstraction has 9731 states and 28998 transitions. [2019-12-18 14:41:24,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:41:24,523 INFO L276 IsEmpty]: Start isEmpty. Operand 9731 states and 28998 transitions. [2019-12-18 14:41:24,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:41:24,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:24,534 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:24,534 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:24,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:24,534 INFO L82 PathProgramCache]: Analyzing trace with hash -55018944, now seen corresponding path program 1 times [2019-12-18 14:41:24,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:24,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192790933] [2019-12-18 14:41:24,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:24,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192790933] [2019-12-18 14:41:24,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:24,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:41:24,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721930165] [2019-12-18 14:41:24,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:41:24,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:24,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:41:24,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:41:24,617 INFO L87 Difference]: Start difference. First operand 9731 states and 28998 transitions. Second operand 6 states. [2019-12-18 14:41:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:25,275 INFO L93 Difference]: Finished difference Result 12715 states and 37116 transitions. [2019-12-18 14:41:25,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:41:25,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 14:41:25,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:25,293 INFO L225 Difference]: With dead ends: 12715 [2019-12-18 14:41:25,293 INFO L226 Difference]: Without dead ends: 12715 [2019-12-18 14:41:25,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:41:25,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12715 states. [2019-12-18 14:41:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12715 to 10179. [2019-12-18 14:41:25,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10179 states. [2019-12-18 14:41:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10179 states to 10179 states and 30296 transitions. [2019-12-18 14:41:25,447 INFO L78 Accepts]: Start accepts. Automaton has 10179 states and 30296 transitions. Word has length 41 [2019-12-18 14:41:25,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:25,447 INFO L462 AbstractCegarLoop]: Abstraction has 10179 states and 30296 transitions. [2019-12-18 14:41:25,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:41:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand 10179 states and 30296 transitions. [2019-12-18 14:41:25,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:41:25,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:25,457 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:25,457 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:25,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:25,457 INFO L82 PathProgramCache]: Analyzing trace with hash -154907136, now seen corresponding path program 2 times [2019-12-18 14:41:25,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:25,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709268941] [2019-12-18 14:41:25,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:25,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:25,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709268941] [2019-12-18 14:41:25,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:25,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:41:25,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133948952] [2019-12-18 14:41:25,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:41:25,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:25,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:41:25,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:41:25,538 INFO L87 Difference]: Start difference. First operand 10179 states and 30296 transitions. Second operand 6 states. [2019-12-18 14:41:25,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:25,634 INFO L93 Difference]: Finished difference Result 9188 states and 27748 transitions. [2019-12-18 14:41:25,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:41:25,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 14:41:25,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:25,649 INFO L225 Difference]: With dead ends: 9188 [2019-12-18 14:41:25,650 INFO L226 Difference]: Without dead ends: 9032 [2019-12-18 14:41:25,650 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-18 14:41:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9032 states. [2019-12-18 14:41:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9032 to 8630. [2019-12-18 14:41:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8630 states. [2019-12-18 14:41:25,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8630 states to 8630 states and 26283 transitions. [2019-12-18 14:41:25,861 INFO L78 Accepts]: Start accepts. Automaton has 8630 states and 26283 transitions. Word has length 41 [2019-12-18 14:41:25,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:25,862 INFO L462 AbstractCegarLoop]: Abstraction has 8630 states and 26283 transitions. [2019-12-18 14:41:25,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:41:25,862 INFO L276 IsEmpty]: Start isEmpty. Operand 8630 states and 26283 transitions. [2019-12-18 14:41:25,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:41:25,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:25,879 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] [2019-12-18 14:41:25,879 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:25,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:25,880 INFO L82 PathProgramCache]: Analyzing trace with hash 2029475721, now seen corresponding path program 1 times [2019-12-18 14:41:25,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:25,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708546098] [2019-12-18 14:41:25,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:26,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:26,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708546098] [2019-12-18 14:41:26,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:26,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 14:41:26,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163278690] [2019-12-18 14:41:26,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 14:41:26,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:26,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 14:41:26,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:41:26,527 INFO L87 Difference]: Start difference. First operand 8630 states and 26283 transitions. Second operand 14 states. [2019-12-18 14:41:29,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:29,828 INFO L93 Difference]: Finished difference Result 22185 states and 66033 transitions. [2019-12-18 14:41:29,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-18 14:41:29,828 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-12-18 14:41:29,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:29,846 INFO L225 Difference]: With dead ends: 22185 [2019-12-18 14:41:29,847 INFO L226 Difference]: Without dead ends: 12328 [2019-12-18 14:41:29,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=472, Invalid=2284, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 14:41:29,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12328 states. [2019-12-18 14:41:29,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12328 to 10637. [2019-12-18 14:41:29,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10637 states. [2019-12-18 14:41:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10637 states to 10637 states and 31448 transitions. [2019-12-18 14:41:30,005 INFO L78 Accepts]: Start accepts. Automaton has 10637 states and 31448 transitions. Word has length 55 [2019-12-18 14:41:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:30,005 INFO L462 AbstractCegarLoop]: Abstraction has 10637 states and 31448 transitions. [2019-12-18 14:41:30,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 14:41:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 10637 states and 31448 transitions. [2019-12-18 14:41:30,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:41:30,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:30,016 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] [2019-12-18 14:41:30,016 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:30,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:30,016 INFO L82 PathProgramCache]: Analyzing trace with hash -271996499, now seen corresponding path program 2 times [2019-12-18 14:41:30,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:30,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063988075] [2019-12-18 14:41:30,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:30,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063988075] [2019-12-18 14:41:30,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:30,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:41:30,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846352853] [2019-12-18 14:41:30,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:41:30,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:30,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:41:30,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:41:30,369 INFO L87 Difference]: Start difference. First operand 10637 states and 31448 transitions. Second operand 15 states. [2019-12-18 14:41:33,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:33,170 INFO L93 Difference]: Finished difference Result 15994 states and 46437 transitions. [2019-12-18 14:41:33,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 14:41:33,171 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-18 14:41:33,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:33,189 INFO L225 Difference]: With dead ends: 15994 [2019-12-18 14:41:33,190 INFO L226 Difference]: Without dead ends: 12642 [2019-12-18 14:41:33,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2019-12-18 14:41:33,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12642 states. [2019-12-18 14:41:33,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12642 to 10631. [2019-12-18 14:41:33,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10631 states. [2019-12-18 14:41:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10631 states to 10631 states and 31370 transitions. [2019-12-18 14:41:33,355 INFO L78 Accepts]: Start accepts. Automaton has 10631 states and 31370 transitions. Word has length 55 [2019-12-18 14:41:33,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:33,355 INFO L462 AbstractCegarLoop]: Abstraction has 10631 states and 31370 transitions. [2019-12-18 14:41:33,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:41:33,355 INFO L276 IsEmpty]: Start isEmpty. Operand 10631 states and 31370 transitions. [2019-12-18 14:41:33,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:41:33,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:33,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:33,365 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:33,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:33,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1400891447, now seen corresponding path program 3 times [2019-12-18 14:41:33,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:33,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238835938] [2019-12-18 14:41:33,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:33,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238835938] [2019-12-18 14:41:33,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:33,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:41:33,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785225336] [2019-12-18 14:41:33,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:41:33,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:33,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:41:33,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:41:33,879 INFO L87 Difference]: Start difference. First operand 10631 states and 31370 transitions. Second operand 16 states. [2019-12-18 14:41:35,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:35,967 INFO L93 Difference]: Finished difference Result 15449 states and 44557 transitions. [2019-12-18 14:41:35,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 14:41:35,968 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-18 14:41:35,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:35,987 INFO L225 Difference]: With dead ends: 15449 [2019-12-18 14:41:35,987 INFO L226 Difference]: Without dead ends: 13891 [2019-12-18 14:41:35,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 14:41:36,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13891 states. [2019-12-18 14:41:36,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13891 to 10759. [2019-12-18 14:41:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10759 states. [2019-12-18 14:41:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10759 states to 10759 states and 31695 transitions. [2019-12-18 14:41:36,153 INFO L78 Accepts]: Start accepts. Automaton has 10759 states and 31695 transitions. Word has length 55 [2019-12-18 14:41:36,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:36,153 INFO L462 AbstractCegarLoop]: Abstraction has 10759 states and 31695 transitions. [2019-12-18 14:41:36,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:41:36,153 INFO L276 IsEmpty]: Start isEmpty. Operand 10759 states and 31695 transitions. [2019-12-18 14:41:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:41:36,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:36,164 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] [2019-12-18 14:41:36,164 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:36,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:36,164 INFO L82 PathProgramCache]: Analyzing trace with hash 32561879, now seen corresponding path program 4 times [2019-12-18 14:41:36,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:36,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489463070] [2019-12-18 14:41:36,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:36,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:36,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489463070] [2019-12-18 14:41:36,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:36,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:41:36,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789652487] [2019-12-18 14:41:36,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:41:36,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:36,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:41:36,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:41:36,607 INFO L87 Difference]: Start difference. First operand 10759 states and 31695 transitions. Second operand 16 states. [2019-12-18 14:41:40,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:40,524 INFO L93 Difference]: Finished difference Result 17200 states and 49699 transitions. [2019-12-18 14:41:40,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-18 14:41:40,524 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-18 14:41:40,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:40,543 INFO L225 Difference]: With dead ends: 17200 [2019-12-18 14:41:40,543 INFO L226 Difference]: Without dead ends: 12585 [2019-12-18 14:41:40,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=558, Invalid=3348, Unknown=0, NotChecked=0, Total=3906 [2019-12-18 14:41:40,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12585 states. [2019-12-18 14:41:40,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12585 to 10589. [2019-12-18 14:41:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10589 states. [2019-12-18 14:41:40,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10589 states to 10589 states and 31244 transitions. [2019-12-18 14:41:40,703 INFO L78 Accepts]: Start accepts. Automaton has 10589 states and 31244 transitions. Word has length 55 [2019-12-18 14:41:40,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:40,703 INFO L462 AbstractCegarLoop]: Abstraction has 10589 states and 31244 transitions. [2019-12-18 14:41:40,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:41:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 10589 states and 31244 transitions. [2019-12-18 14:41:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:41:40,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:40,713 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] [2019-12-18 14:41:40,714 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:40,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:40,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1814057143, now seen corresponding path program 5 times [2019-12-18 14:41:40,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:40,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879592863] [2019-12-18 14:41:40,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:41,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:41,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879592863] [2019-12-18 14:41:41,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:41,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:41:41,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367710152] [2019-12-18 14:41:41,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:41:41,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:41,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:41:41,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:41:41,011 INFO L87 Difference]: Start difference. First operand 10589 states and 31244 transitions. Second operand 10 states. [2019-12-18 14:41:42,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:42,560 INFO L93 Difference]: Finished difference Result 17592 states and 50709 transitions. [2019-12-18 14:41:42,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 14:41:42,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-18 14:41:42,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:42,583 INFO L225 Difference]: With dead ends: 17592 [2019-12-18 14:41:42,584 INFO L226 Difference]: Without dead ends: 17592 [2019-12-18 14:41:42,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:41:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17592 states. [2019-12-18 14:41:42,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17592 to 11218. [2019-12-18 14:41:42,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11218 states. [2019-12-18 14:41:42,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11218 states to 11218 states and 33031 transitions. [2019-12-18 14:41:42,775 INFO L78 Accepts]: Start accepts. Automaton has 11218 states and 33031 transitions. Word has length 55 [2019-12-18 14:41:42,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:42,775 INFO L462 AbstractCegarLoop]: Abstraction has 11218 states and 33031 transitions. [2019-12-18 14:41:42,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:41:42,776 INFO L276 IsEmpty]: Start isEmpty. Operand 11218 states and 33031 transitions. [2019-12-18 14:41:42,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:41:42,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:42,787 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] [2019-12-18 14:41:42,787 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:42,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:42,787 INFO L82 PathProgramCache]: Analyzing trace with hash -2130553833, now seen corresponding path program 6 times [2019-12-18 14:41:42,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:42,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187364185] [2019-12-18 14:41:42,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:43,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187364185] [2019-12-18 14:41:43,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:43,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:41:43,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154434586] [2019-12-18 14:41:43,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:41:43,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:43,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:41:43,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:41:43,219 INFO L87 Difference]: Start difference. First operand 11218 states and 33031 transitions. Second operand 16 states. [2019-12-18 14:41:45,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:45,215 INFO L93 Difference]: Finished difference Result 12183 states and 35568 transitions. [2019-12-18 14:41:45,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 14:41:45,215 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-18 14:41:45,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:45,233 INFO L225 Difference]: With dead ends: 12183 [2019-12-18 14:41:45,233 INFO L226 Difference]: Without dead ends: 11675 [2019-12-18 14:41:45,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 14:41:45,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11675 states. [2019-12-18 14:41:45,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11675 to 11218. [2019-12-18 14:41:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11218 states. [2019-12-18 14:41:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11218 states to 11218 states and 33019 transitions. [2019-12-18 14:41:45,396 INFO L78 Accepts]: Start accepts. Automaton has 11218 states and 33019 transitions. Word has length 55 [2019-12-18 14:41:45,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:45,396 INFO L462 AbstractCegarLoop]: Abstraction has 11218 states and 33019 transitions. [2019-12-18 14:41:45,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:41:45,396 INFO L276 IsEmpty]: Start isEmpty. Operand 11218 states and 33019 transitions. [2019-12-18 14:41:45,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:41:45,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:45,407 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] [2019-12-18 14:41:45,408 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:45,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:45,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1154257009, now seen corresponding path program 7 times [2019-12-18 14:41:45,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:45,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85133891] [2019-12-18 14:41:45,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:45,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85133891] [2019-12-18 14:41:45,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:45,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 14:41:45,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848475631] [2019-12-18 14:41:45,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 14:41:45,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:45,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 14:41:45,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:41:45,862 INFO L87 Difference]: Start difference. First operand 11218 states and 33019 transitions. Second operand 17 states. [2019-12-18 14:41:46,676 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2019-12-18 14:41:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:48,304 INFO L93 Difference]: Finished difference Result 12718 states and 37016 transitions. [2019-12-18 14:41:48,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 14:41:48,306 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-12-18 14:41:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:48,324 INFO L225 Difference]: With dead ends: 12718 [2019-12-18 14:41:48,324 INFO L226 Difference]: Without dead ends: 12148 [2019-12-18 14:41:48,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=238, Invalid=1484, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 14:41:48,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12148 states. [2019-12-18 14:41:48,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12148 to 11266. [2019-12-18 14:41:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11266 states. [2019-12-18 14:41:48,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11266 states to 11266 states and 33123 transitions. [2019-12-18 14:41:48,510 INFO L78 Accepts]: Start accepts. Automaton has 11266 states and 33123 transitions. Word has length 55 [2019-12-18 14:41:48,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:48,510 INFO L462 AbstractCegarLoop]: Abstraction has 11266 states and 33123 transitions. [2019-12-18 14:41:48,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 14:41:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 11266 states and 33123 transitions. [2019-12-18 14:41:48,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:41:48,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:48,523 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] [2019-12-18 14:41:48,524 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:48,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:48,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1064222443, now seen corresponding path program 8 times [2019-12-18 14:41:48,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:48,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627250655] [2019-12-18 14:41:48,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:48,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627250655] [2019-12-18 14:41:48,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:48,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:41:48,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700123899] [2019-12-18 14:41:48,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:41:48,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:48,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:41:48,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:41:48,584 INFO L87 Difference]: Start difference. First operand 11266 states and 33123 transitions. Second operand 3 states. [2019-12-18 14:41:48,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:48,631 INFO L93 Difference]: Finished difference Result 11264 states and 33118 transitions. [2019-12-18 14:41:48,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:41:48,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 14:41:48,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:48,649 INFO L225 Difference]: With dead ends: 11264 [2019-12-18 14:41:48,649 INFO L226 Difference]: Without dead ends: 11264 [2019-12-18 14:41:48,649 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-18 14:41:48,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11264 states. [2019-12-18 14:41:48,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11264 to 9175. [2019-12-18 14:41:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9175 states. [2019-12-18 14:41:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9175 states to 9175 states and 27330 transitions. [2019-12-18 14:41:48,810 INFO L78 Accepts]: Start accepts. Automaton has 9175 states and 27330 transitions. Word has length 55 [2019-12-18 14:41:48,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:48,810 INFO L462 AbstractCegarLoop]: Abstraction has 9175 states and 27330 transitions. [2019-12-18 14:41:48,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:41:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 9175 states and 27330 transitions. [2019-12-18 14:41:48,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:41:48,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:48,821 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] [2019-12-18 14:41:48,821 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:48,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:48,822 INFO L82 PathProgramCache]: Analyzing trace with hash 2142837189, now seen corresponding path program 1 times [2019-12-18 14:41:48,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:48,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057213133] [2019-12-18 14:41:48,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:48,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:48,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057213133] [2019-12-18 14:41:48,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:48,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:41:48,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809097947] [2019-12-18 14:41:48,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:41:48,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:48,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:41:48,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:41:48,958 INFO L87 Difference]: Start difference. First operand 9175 states and 27330 transitions. Second operand 11 states. [2019-12-18 14:41:49,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:49,703 INFO L93 Difference]: Finished difference Result 14057 states and 41474 transitions. [2019-12-18 14:41:49,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 14:41:49,704 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 14:41:49,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:49,718 INFO L225 Difference]: With dead ends: 14057 [2019-12-18 14:41:49,718 INFO L226 Difference]: Without dead ends: 9476 [2019-12-18 14:41:49,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2019-12-18 14:41:49,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9476 states. [2019-12-18 14:41:49,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9476 to 8576. [2019-12-18 14:41:49,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8576 states. [2019-12-18 14:41:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8576 states to 8576 states and 25739 transitions. [2019-12-18 14:41:49,846 INFO L78 Accepts]: Start accepts. Automaton has 8576 states and 25739 transitions. Word has length 56 [2019-12-18 14:41:49,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:49,846 INFO L462 AbstractCegarLoop]: Abstraction has 8576 states and 25739 transitions. [2019-12-18 14:41:49,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:41:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 8576 states and 25739 transitions. [2019-12-18 14:41:49,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:41:49,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:49,854 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] [2019-12-18 14:41:49,855 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:49,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:49,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1734091201, now seen corresponding path program 2 times [2019-12-18 14:41:49,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:49,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202107459] [2019-12-18 14:41:49,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:41:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:41:49,974 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:41:49,974 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:41:49,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_cnt~0_95) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2073~0.base_30|) (= 0 v_~x~0_240) (= v_~x$r_buff1_thd0~0_309 0) (= v_~weak$$choice2~0_201 0) (= 0 v_~x$w_buff1_used~0_624) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~y~0_226 0) (= v_~z~0_95 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$r_buff0_thd3~0_148) (= 0 v_~x$w_buff1~0_328) (= 0 v_~x$r_buff0_thd2~0_323) (= v_~x$flush_delayed~0_62 0) (= 0 v_~x$w_buff0_used~0_913) (= 0 |v_#NULL.base_4|) (= 0 v_~x$read_delayed~0_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t2073~0.base_30|) 0) (= v_~x$r_buff0_thd1~0_362 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2073~0.base_30| 4)) (= 0 v_~weak$$choice0~0_37) (= v_~main$tmp_guard1~0_53 0) (= v_~main$tmp_guard0~0_42 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2073~0.base_30| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2073~0.base_30|) |v_ULTIMATE.start_main_~#t2073~0.offset_22| 0))) (= 0 v_~__unbuffered_p2_EAX~0_68) (= |v_#NULL.offset_4| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_267) (= v_~x$mem_tmp~0_40 0) (= v_~x$r_buff1_thd1~0_428 0) (= 0 v_~x$w_buff0~0_403) (= v_~x$r_buff0_thd0~0_156 0) (= |v_ULTIMATE.start_main_~#t2073~0.offset_22| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2073~0.base_30| 1) |v_#valid_64|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_403, ~x$flush_delayed~0=v_~x$flush_delayed~0_62, ULTIMATE.start_main_~#t2075~0.base=|v_ULTIMATE.start_main_~#t2075~0.base_23|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_428, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_148, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_68, ULTIMATE.start_main_~#t2074~0.offset=|v_ULTIMATE.start_main_~#t2074~0.offset_22|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~x$w_buff1~0=v_~x$w_buff1~0_328, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_624, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ULTIMATE.start_main_~#t2074~0.base=|v_ULTIMATE.start_main_~#t2074~0.base_31|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t2073~0.offset=|v_ULTIMATE.start_main_~#t2073~0.offset_22|, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~x~0=v_~x~0_240, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_362, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_114|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_267, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_53, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_~#t2075~0.offset=|v_ULTIMATE.start_main_~#t2075~0.offset_14|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2073~0.base=|v_ULTIMATE.start_main_~#t2073~0.base_30|, ~y~0=v_~y~0_226, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_309, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_323, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_62|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_201, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2075~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2075~0.offset, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2073~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2074~0.offset, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2074~0.base, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_~#t2073~0.offset, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 14:41:49,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2074~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2074~0.base_10|) |v_ULTIMATE.start_main_~#t2074~0.offset_9| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t2074~0.offset_9| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2074~0.base_10|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2074~0.base_10|) 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2074~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2074~0.base_10|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2074~0.base_10| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2074~0.offset=|v_ULTIMATE.start_main_~#t2074~0.offset_9|, ULTIMATE.start_main_~#t2074~0.base=|v_ULTIMATE.start_main_~#t2074~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2074~0.offset, ULTIMATE.start_main_~#t2074~0.base] because there is no mapped edge [2019-12-18 14:41:49,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_19) (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= 0 (mod v_~x$w_buff1_used~0_52 256)) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff1_used~0_52 v_~x$w_buff0_used~0_98) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0_used~0_97) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~x$w_buff1~0=v_~x$w_buff1~0_19, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 14:41:49,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2075~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2075~0.base_11|) |v_ULTIMATE.start_main_~#t2075~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2075~0.base_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2075~0.base_11| 1)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2075~0.base_11|)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2075~0.base_11| 4) |v_#length_13|) (= |v_ULTIMATE.start_main_~#t2075~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t2075~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2075~0.base=|v_ULTIMATE.start_main_~#t2075~0.base_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t2075~0.offset=|v_ULTIMATE.start_main_~#t2075~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2075~0.base, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2075~0.offset] because there is no mapped edge [2019-12-18 14:41:49,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1518241095 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In1518241095 256) 0))) (or (and (= ~x$w_buff1~0_In1518241095 |P2Thread1of1ForFork1_#t~ite32_Out1518241095|) (not .cse0) (not .cse1)) (and (= ~x~0_In1518241095 |P2Thread1of1ForFork1_#t~ite32_Out1518241095|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1518241095, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1518241095, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1518241095, ~x~0=~x~0_In1518241095} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1518241095|, ~x$w_buff1~0=~x$w_buff1~0_In1518241095, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1518241095, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1518241095, ~x~0=~x~0_In1518241095} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 14:41:49,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_10|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_10|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 14:41:49,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In25165293 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In25165293 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In25165293 |P2Thread1of1ForFork1_#t~ite34_Out25165293|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out25165293|) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In25165293, ~x$w_buff0_used~0=~x$w_buff0_used~0_In25165293} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out25165293|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In25165293, ~x$w_buff0_used~0=~x$w_buff0_used~0_In25165293} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 14:41:49,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In107474161 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In107474161 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out107474161|) (not .cse1)) (and (= ~x$w_buff0_used~0_In107474161 |P1Thread1of1ForFork0_#t~ite28_Out107474161|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In107474161, ~x$w_buff0_used~0=~x$w_buff0_used~0_In107474161} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In107474161, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out107474161|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In107474161} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 14:41:49,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In925064539 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In925064539 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In925064539 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In925064539 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out925064539|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In925064539 |P1Thread1of1ForFork0_#t~ite29_Out925064539|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In925064539, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In925064539, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In925064539, ~x$w_buff0_used~0=~x$w_buff0_used~0_In925064539} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In925064539, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In925064539, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In925064539, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out925064539|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In925064539} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 14:41:49,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1656492571 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1656492571 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In1656492571 ~x$r_buff0_thd2~0_Out1656492571)) (and (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out1656492571) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1656492571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1656492571} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1656492571|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1656492571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1656492571} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:41:49,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-580785170 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-580785170 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-580785170 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-580785170 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-580785170|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd2~0_In-580785170 |P1Thread1of1ForFork0_#t~ite31_Out-580785170|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-580785170, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-580785170, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-580785170, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-580785170} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-580785170|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-580785170, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-580785170, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-580785170, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-580785170} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 14:41:49,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 14:41:49,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-875144340 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite9_Out-875144340| |P0Thread1of1ForFork2_#t~ite8_Out-875144340|) .cse0 (= |P0Thread1of1ForFork2_#t~ite8_Out-875144340| ~x$w_buff0~0_In-875144340) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-875144340 256)))) (or (= (mod ~x$w_buff0_used~0_In-875144340 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-875144340 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-875144340 256)))))) (and (= |P0Thread1of1ForFork2_#t~ite9_Out-875144340| ~x$w_buff0~0_In-875144340) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite8_In-875144340| |P0Thread1of1ForFork2_#t~ite8_Out-875144340|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-875144340, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-875144340, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-875144340|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-875144340, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-875144340, ~weak$$choice2~0=~weak$$choice2~0_In-875144340, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-875144340} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-875144340, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-875144340, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-875144340|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-875144340, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-875144340|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-875144340, ~weak$$choice2~0=~weak$$choice2~0_In-875144340, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-875144340} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 14:41:49,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-186276122 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-186276122 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-186276122 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-186276122 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite35_Out-186276122| ~x$w_buff1_used~0_In-186276122)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out-186276122| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-186276122, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-186276122, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-186276122, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-186276122} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-186276122|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-186276122, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-186276122, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-186276122, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-186276122} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 14:41:49,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In839038920 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In839038920 256)))) (or (and (= ~x$r_buff0_thd3~0_In839038920 |P2Thread1of1ForFork1_#t~ite36_Out839038920|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork1_#t~ite36_Out839038920|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In839038920, ~x$w_buff0_used~0=~x$w_buff0_used~0_In839038920} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out839038920|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In839038920, ~x$w_buff0_used~0=~x$w_buff0_used~0_In839038920} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 14:41:49,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1982605477 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1982605477 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-1982605477 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-1982605477 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-1982605477|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out-1982605477| ~x$r_buff1_thd3~0_In-1982605477) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1982605477, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1982605477, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1982605477, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1982605477} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1982605477|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1982605477, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1982605477, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1982605477, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1982605477} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:41:49,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork1_#t~ite37_30|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 14:41:49,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1174968529 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_In1174968529| |P0Thread1of1ForFork2_#t~ite17_Out1174968529|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite18_Out1174968529| ~x$w_buff1_used~0_In1174968529)) (and (= |P0Thread1of1ForFork2_#t~ite18_Out1174968529| |P0Thread1of1ForFork2_#t~ite17_Out1174968529|) (= ~x$w_buff1_used~0_In1174968529 |P0Thread1of1ForFork2_#t~ite17_Out1174968529|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1174968529 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1174968529 256) 0)) (and (= 0 (mod ~x$w_buff1_used~0_In1174968529 256)) .cse1) (= (mod ~x$w_buff0_used~0_In1174968529 256) 0))) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1174968529, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1174968529|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1174968529, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1174968529, ~weak$$choice2~0=~weak$$choice2~0_In1174968529, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1174968529} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1174968529, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1174968529|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1174968529|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1174968529, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1174968529, ~weak$$choice2~0=~weak$$choice2~0_In1174968529, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1174968529} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 14:41:49,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_101 v_~x$r_buff0_thd1~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_100, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 14:41:49,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-936173586 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite23_Out-936173586| |P0Thread1of1ForFork2_#t~ite24_Out-936173586|) (= |P0Thread1of1ForFork2_#t~ite23_Out-936173586| ~x$r_buff1_thd1~0_In-936173586) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-936173586 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-936173586 256)) (and (= (mod ~x$r_buff1_thd1~0_In-936173586 256) 0) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In-936173586 256)) .cse1)))) (and (= |P0Thread1of1ForFork2_#t~ite23_In-936173586| |P0Thread1of1ForFork2_#t~ite23_Out-936173586|) (= |P0Thread1of1ForFork2_#t~ite24_Out-936173586| ~x$r_buff1_thd1~0_In-936173586) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-936173586, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-936173586, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-936173586, ~weak$$choice2~0=~weak$$choice2~0_In-936173586, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-936173586|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-936173586} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-936173586, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-936173586, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-936173586, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-936173586|, ~weak$$choice2~0=~weak$$choice2~0_In-936173586, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-936173586|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-936173586} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 14:41:49,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x~0_34 v_~x$mem_tmp~0_10) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_34} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 14:41:49,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_158 256)) (= 0 (mod v_~x$r_buff0_thd0~0_26 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:41:49,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1700900858 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1700900858 256) 0))) (or (and (= ~x$w_buff1~0_In-1700900858 |ULTIMATE.start_main_#t~ite41_Out-1700900858|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-1700900858| ~x~0_In-1700900858)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1700900858, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1700900858, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1700900858, ~x~0=~x~0_In-1700900858} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1700900858|, ~x$w_buff1~0=~x$w_buff1~0_In-1700900858, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1700900858, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1700900858, ~x~0=~x~0_In-1700900858} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 14:41:49,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 14:41:49,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-727129665 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-727129665 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-727129665| ~x$w_buff0_used~0_In-727129665) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out-727129665|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-727129665, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-727129665} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-727129665, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-727129665|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-727129665} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 14:41:49,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In-806007129 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-806007129 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-806007129 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-806007129 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-806007129 |ULTIMATE.start_main_#t~ite44_Out-806007129|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-806007129|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-806007129, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-806007129, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-806007129, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-806007129} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-806007129, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-806007129, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-806007129, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-806007129|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-806007129} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 14:41:49,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In973424429 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In973424429 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out973424429|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In973424429 |ULTIMATE.start_main_#t~ite45_Out973424429|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In973424429, ~x$w_buff0_used~0=~x$w_buff0_used~0_In973424429} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In973424429, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out973424429|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In973424429} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 14:41:49,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In2147164383 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In2147164383 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In2147164383 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2147164383 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In2147164383 |ULTIMATE.start_main_#t~ite46_Out2147164383|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite46_Out2147164383|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2147164383, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2147164383, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2147164383, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2147164383} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2147164383, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out2147164383|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2147164383, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2147164383, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2147164383} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 14:41:49,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_60 2) (= v_~main$tmp_guard1~0_25 0) (= 1 v_~__unbuffered_p2_EAX~0_35) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= v_~x$r_buff1_thd0~0_277 |v_ULTIMATE.start_main_#t~ite46_60|) (= 0 v_~__unbuffered_p0_EAX~0_54) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_25 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_59|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_277, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:41:50,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:41:50 BasicIcfg [2019-12-18 14:41:50,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:41:50,105 INFO L168 Benchmark]: Toolchain (without parser) took 174215.48 ms. Allocated memory was 138.4 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 101.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 14:41:50,106 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 14:41:50,106 INFO L168 Benchmark]: CACSL2BoogieTranslator took 704.45 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.3 MB in the beginning and 156.4 MB in the end (delta: -55.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-12-18 14:41:50,106 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.98 ms. Allocated memory is still 202.4 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:41:50,107 INFO L168 Benchmark]: Boogie Preprocessor took 57.19 ms. Allocated memory is still 202.4 MB. Free memory was 153.7 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:41:50,107 INFO L168 Benchmark]: RCFGBuilder took 831.78 ms. Allocated memory is still 202.4 MB. Free memory was 151.7 MB in the beginning and 104.9 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:41:50,107 INFO L168 Benchmark]: TraceAbstraction took 172556.49 ms. Allocated memory was 202.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 104.9 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 14:41:50,109 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 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 704.45 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.3 MB in the beginning and 156.4 MB in the end (delta: -55.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.98 ms. Allocated memory is still 202.4 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.19 ms. Allocated memory is still 202.4 MB. Free memory was 153.7 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 831.78 ms. Allocated memory is still 202.4 MB. Free memory was 151.7 MB in the beginning and 104.9 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 172556.49 ms. Allocated memory was 202.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 104.9 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 6709 VarBasedMoverChecksPositive, 292 VarBasedMoverChecksNegative, 116 SemBasedMoverChecksPositive, 259 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 66094 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2073, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2074, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2075, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 172.2s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 74.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5349 SDtfs, 8212 SDslu, 18486 SDs, 0 SdLazy, 18522 SolverSat, 447 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 480 GetRequests, 50 SyntacticMatches, 25 SemanticMatches, 405 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3549 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161868occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 74.8s AutomataMinimizationTime, 33 MinimizatonAttempts, 186326 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1168 NumberOfCodeBlocks, 1168 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1079 ConstructedInterpolants, 0 QuantifiedInterpolants, 241583 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...