/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/safe024_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:59:31,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:59:31,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:59:31,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:59:31,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:59:31,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:59:31,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:59:31,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:59:31,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:59:31,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:59:31,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:59:31,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:59:31,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:59:31,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:59:31,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:59:31,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:59:31,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:59:31,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:59:31,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:59:31,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:59:31,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:59:31,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:59:31,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:59:31,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:59:31,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:59:31,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:59:31,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:59:31,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:59:31,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:59:31,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:59:31,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:59:31,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:59:31,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:59:31,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:59:31,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:59:31,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:59:31,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:59:31,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:59:31,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:59:31,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:59:31,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:59:31,506 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:59:31,520 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:59:31,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:59:31,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:59:31,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:59:31,522 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:59:31,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:59:31,522 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:59:31,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:59:31,523 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:59:31,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:59:31,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:59:31,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:59:31,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:59:31,524 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:59:31,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:59:31,524 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:59:31,524 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:59:31,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:59:31,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:59:31,525 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:59:31,525 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:59:31,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:59:31,526 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:59:31,526 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:59:31,526 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:59:31,526 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:59:31,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:59:31,527 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:59:31,527 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:59:31,527 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:59:31,856 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:59:31,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:59:31,886 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:59:31,887 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:59:31,888 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:59:31,889 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_rmo.opt.i [2019-12-18 14:59:31,951 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/517164579/70c141c146d94d04ad0f5ae586ea5daf/FLAG2cd13a7f5 [2019-12-18 14:59:32,454 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:59:32,454 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_rmo.opt.i [2019-12-18 14:59:32,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/517164579/70c141c146d94d04ad0f5ae586ea5daf/FLAG2cd13a7f5 [2019-12-18 14:59:32,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/517164579/70c141c146d94d04ad0f5ae586ea5daf [2019-12-18 14:59:32,810 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:59:32,812 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:59:32,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:59:32,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:59:32,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:59:32,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:59:32" (1/1) ... [2019-12-18 14:59:32,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:59:32, skipping insertion in model container [2019-12-18 14:59:32,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:59:32" (1/1) ... [2019-12-18 14:59:32,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:59:32,889 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:59:33,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:59:33,483 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:59:33,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:59:33,642 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:59:33,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:59:33 WrapperNode [2019-12-18 14:59:33,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:59:33,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:59:33,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:59:33,644 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:59:33,653 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:59:33" (1/1) ... [2019-12-18 14:59:33,674 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:59:33" (1/1) ... [2019-12-18 14:59:33,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:59:33,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:59:33,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:59:33,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:59:33,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:59:33" (1/1) ... [2019-12-18 14:59:33,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:59:33" (1/1) ... [2019-12-18 14:59:33,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:59:33" (1/1) ... [2019-12-18 14:59:33,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:59:33" (1/1) ... [2019-12-18 14:59:33,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:59:33" (1/1) ... [2019-12-18 14:59:33,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:59:33" (1/1) ... [2019-12-18 14:59:33,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:59:33" (1/1) ... [2019-12-18 14:59:33,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:59:33,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:59:33,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:59:33,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:59:33,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:59:33" (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:59:33,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:59:33,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:59:33,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:59:33,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:59:33,829 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:59:33,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:59:33,829 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:59:33,830 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:59:33,830 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:59:33,830 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:59:33,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:59:33,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:59:33,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:59:33,832 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:59:34,615 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:59:34,615 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:59:34,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:59:34 BoogieIcfgContainer [2019-12-18 14:59:34,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:59:34,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:59:34,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:59:34,622 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:59:34,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:59:32" (1/3) ... [2019-12-18 14:59:34,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d7185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:59:34, skipping insertion in model container [2019-12-18 14:59:34,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:59:33" (2/3) ... [2019-12-18 14:59:34,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d7185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:59:34, skipping insertion in model container [2019-12-18 14:59:34,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:59:34" (3/3) ... [2019-12-18 14:59:34,626 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_rmo.opt.i [2019-12-18 14:59:34,635 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:59:34,636 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:59:34,642 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:59:34,643 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:59:34,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,684 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,685 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,709 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,709 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,709 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,710 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,710 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,717 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,717 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,728 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,728 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,728 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,734 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,735 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,738 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,739 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:59:34,777 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:59:34,798 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:59:34,798 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:59:34,798 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:59:34,798 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:59:34,798 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:59:34,799 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:59:34,799 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:59:34,799 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:59:34,816 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 14:59:34,818 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 14:59:34,903 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 14:59:34,903 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:59:34,921 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:59:34,946 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 14:59:34,996 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 14:59:34,997 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:59:35,008 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:59:35,029 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 14:59:35,031 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:59:40,577 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 14:59:40,745 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 14:59:40,770 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-18 14:59:40,770 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 14:59:40,774 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-18 14:59:54,263 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-18 14:59:54,265 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-18 14:59:54,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:59:54,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:59:54,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:59:54,273 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:59:54,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:59:54,278 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-18 14:59:54,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:59:54,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251707952] [2019-12-18 14:59:54,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:59:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:59:54,585 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:59:54,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251707952] [2019-12-18 14:59:54,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:59:54,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:59:54,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132938171] [2019-12-18 14:59:54,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:59:54,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:59:54,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:59:54,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:59:54,610 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-18 14:59:55,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:59:55,619 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-18 14:59:55,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:59:55,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:59:55,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:59:58,719 INFO L225 Difference]: With dead ends: 87834 [2019-12-18 14:59:58,719 INFO L226 Difference]: Without dead ends: 82738 [2019-12-18 14:59:58,721 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 15:00:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-18 15:00:04,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-18 15:00:04,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-18 15:00:04,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-18 15:00:04,858 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-18 15:00:04,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:04,858 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-18 15:00:04,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:00:04,858 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-18 15:00:04,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:00:04,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:04,873 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:00:04,873 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 15:00:04,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:04,874 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-18 15:00:04,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:04,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390394007] [2019-12-18 15:00:04,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:05,063 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 15:00:05,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390394007] [2019-12-18 15:00:05,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:05,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:00:05,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021652946] [2019-12-18 15:00:05,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:00:05,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:05,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:00:05,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:00:05,068 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-18 15:00:08,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:08,835 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-18 15:00:08,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:00:08,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 15:00:08,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:09,311 INFO L225 Difference]: With dead ends: 127286 [2019-12-18 15:00:09,311 INFO L226 Difference]: Without dead ends: 127202 [2019-12-18 15:00:09,312 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 15:00:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-18 15:00:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-18 15:00:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-18 15:00:21,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-18 15:00:21,563 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-18 15:00:21,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:21,565 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-18 15:00:21,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:00:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-18 15:00:21,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:00:21,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:21,569 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:00:21,569 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 15:00:21,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:21,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-18 15:00:21,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:21,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705463845] [2019-12-18 15:00:21,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:21,631 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 15:00:21,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705463845] [2019-12-18 15:00:21,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:21,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:00:21,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196512948] [2019-12-18 15:00:21,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:00:21,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:21,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:00:21,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:00:21,636 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-18 15:00:21,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:21,766 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-18 15:00:21,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:00:21,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 15:00:21,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:21,839 INFO L225 Difference]: With dead ends: 28492 [2019-12-18 15:00:21,839 INFO L226 Difference]: Without dead ends: 28492 [2019-12-18 15:00:21,840 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 15:00:22,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-18 15:00:22,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-18 15:00:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-18 15:00:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-18 15:00:22,636 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-18 15:00:22,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:22,637 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-18 15:00:22,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:00:22,637 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-18 15:00:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 15:00:22,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:22,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:00:22,640 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 15:00:22,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:22,640 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-18 15:00:22,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:22,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818455872] [2019-12-18 15:00:22,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:22,737 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 15:00:22,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818455872] [2019-12-18 15:00:22,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:22,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:00:22,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811973172] [2019-12-18 15:00:22,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:00:22,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:22,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:00:22,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:00:22,747 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-18 15:00:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:23,217 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-18 15:00:23,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:00:23,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 15:00:23,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:25,312 INFO L225 Difference]: With dead ends: 41156 [2019-12-18 15:00:25,313 INFO L226 Difference]: Without dead ends: 41141 [2019-12-18 15:00:25,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:00:25,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-18 15:00:26,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-18 15:00:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-18 15:00:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-18 15:00:26,270 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-18 15:00:26,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:26,270 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-18 15:00:26,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:00:26,271 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-18 15:00:26,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:00:26,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:26,283 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 15:00:26,283 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 15:00:26,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:26,283 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-18 15:00:26,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:26,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625500156] [2019-12-18 15:00:26,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:26,433 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 15:00:26,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625500156] [2019-12-18 15:00:26,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:26,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:00:26,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914278156] [2019-12-18 15:00:26,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:00:26,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:26,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:00:26,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:00:26,435 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-18 15:00:27,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:27,372 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-18 15:00:27,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:00:27,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 15:00:27,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:27,497 INFO L225 Difference]: With dead ends: 48363 [2019-12-18 15:00:27,497 INFO L226 Difference]: Without dead ends: 48336 [2019-12-18 15:00:27,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:00:27,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-18 15:00:28,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-18 15:00:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-18 15:00:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-18 15:00:28,513 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-18 15:00:28,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:28,513 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-18 15:00:28,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:00:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-18 15:00:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:00:28,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:28,537 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 15:00:28,538 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 15:00:28,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:28,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-18 15:00:28,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:28,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909603070] [2019-12-18 15:00:28,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:28,588 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 15:00:28,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909603070] [2019-12-18 15:00:28,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:28,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:00:28,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678539766] [2019-12-18 15:00:28,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:00:28,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:28,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:00:28,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:00:28,590 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 4 states. [2019-12-18 15:00:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:28,661 INFO L93 Difference]: Finished difference Result 12861 states and 39176 transitions. [2019-12-18 15:00:28,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:00:28,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 15:00:28,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:28,687 INFO L225 Difference]: With dead ends: 12861 [2019-12-18 15:00:28,687 INFO L226 Difference]: Without dead ends: 12861 [2019-12-18 15:00:28,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:00:28,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-18 15:00:28,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12721. [2019-12-18 15:00:28,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12721 states. [2019-12-18 15:00:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12721 states to 12721 states and 38766 transitions. [2019-12-18 15:00:28,905 INFO L78 Accepts]: Start accepts. Automaton has 12721 states and 38766 transitions. Word has length 25 [2019-12-18 15:00:28,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:28,905 INFO L462 AbstractCegarLoop]: Abstraction has 12721 states and 38766 transitions. [2019-12-18 15:00:28,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:00:28,905 INFO L276 IsEmpty]: Start isEmpty. Operand 12721 states and 38766 transitions. [2019-12-18 15:00:28,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 15:00:28,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:28,927 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] [2019-12-18 15:00:28,927 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 15:00:28,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:28,928 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-18 15:00:28,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:28,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478761177] [2019-12-18 15:00:28,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:29,000 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 15:00:29,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478761177] [2019-12-18 15:00:29,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:29,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:00:29,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108837583] [2019-12-18 15:00:29,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:00:29,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:29,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:00:29,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:00:29,002 INFO L87 Difference]: Start difference. First operand 12721 states and 38766 transitions. Second operand 5 states. [2019-12-18 15:00:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:29,077 INFO L93 Difference]: Finished difference Result 11425 states and 35436 transitions. [2019-12-18 15:00:29,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:00:29,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 15:00:29,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:29,098 INFO L225 Difference]: With dead ends: 11425 [2019-12-18 15:00:29,099 INFO L226 Difference]: Without dead ends: 11425 [2019-12-18 15:00:29,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:00:29,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11425 states. [2019-12-18 15:00:29,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11425 to 10977. [2019-12-18 15:00:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10977 states. [2019-12-18 15:00:29,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 34172 transitions. [2019-12-18 15:00:29,281 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 34172 transitions. Word has length 39 [2019-12-18 15:00:29,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:29,282 INFO L462 AbstractCegarLoop]: Abstraction has 10977 states and 34172 transitions. [2019-12-18 15:00:29,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:00:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 34172 transitions. [2019-12-18 15:00:29,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 15:00:29,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:29,299 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] [2019-12-18 15:00:29,300 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 15:00:29,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:29,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-18 15:00:29,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:29,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34862764] [2019-12-18 15:00:29,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:29,382 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 15:00:29,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34862764] [2019-12-18 15:00:29,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:29,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:00:29,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307258523] [2019-12-18 15:00:29,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:00:29,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:29,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:00:29,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:00:29,384 INFO L87 Difference]: Start difference. First operand 10977 states and 34172 transitions. Second operand 4 states. [2019-12-18 15:00:29,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:29,461 INFO L93 Difference]: Finished difference Result 20009 states and 62260 transitions. [2019-12-18 15:00:29,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:00:29,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-18 15:00:29,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:29,475 INFO L225 Difference]: With dead ends: 20009 [2019-12-18 15:00:29,475 INFO L226 Difference]: Without dead ends: 9365 [2019-12-18 15:00:29,476 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 15:00:29,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9365 states. [2019-12-18 15:00:29,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9365 to 9365. [2019-12-18 15:00:29,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9365 states. [2019-12-18 15:00:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 29013 transitions. [2019-12-18 15:00:29,627 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 29013 transitions. Word has length 53 [2019-12-18 15:00:29,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:29,627 INFO L462 AbstractCegarLoop]: Abstraction has 9365 states and 29013 transitions. [2019-12-18 15:00:29,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:00:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 29013 transitions. [2019-12-18 15:00:29,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 15:00:29,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:29,641 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] [2019-12-18 15:00:29,642 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 15:00:29,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:29,642 INFO L82 PathProgramCache]: Analyzing trace with hash 383407097, now seen corresponding path program 2 times [2019-12-18 15:00:29,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:29,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654674901] [2019-12-18 15:00:29,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:00:29,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654674901] [2019-12-18 15:00:29,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:29,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:00:29,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246364953] [2019-12-18 15:00:29,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:00:29,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:29,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:00:29,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:00:29,737 INFO L87 Difference]: Start difference. First operand 9365 states and 29013 transitions. Second operand 7 states. [2019-12-18 15:00:30,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:30,101 INFO L93 Difference]: Finished difference Result 23182 states and 71788 transitions. [2019-12-18 15:00:30,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:00:30,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 15:00:30,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:30,129 INFO L225 Difference]: With dead ends: 23182 [2019-12-18 15:00:30,130 INFO L226 Difference]: Without dead ends: 18276 [2019-12-18 15:00:30,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:00:30,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18276 states. [2019-12-18 15:00:30,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18276 to 11162. [2019-12-18 15:00:30,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11162 states. [2019-12-18 15:00:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11162 states to 11162 states and 34879 transitions. [2019-12-18 15:00:30,501 INFO L78 Accepts]: Start accepts. Automaton has 11162 states and 34879 transitions. Word has length 53 [2019-12-18 15:00:30,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:30,501 INFO L462 AbstractCegarLoop]: Abstraction has 11162 states and 34879 transitions. [2019-12-18 15:00:30,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:00:30,501 INFO L276 IsEmpty]: Start isEmpty. Operand 11162 states and 34879 transitions. [2019-12-18 15:00:30,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 15:00:30,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:30,517 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] [2019-12-18 15:00:30,518 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 15:00:30,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:30,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1401815865, now seen corresponding path program 3 times [2019-12-18 15:00:30,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:30,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944129597] [2019-12-18 15:00:30,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:30,618 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 15:00:30,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944129597] [2019-12-18 15:00:30,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:30,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:00:30,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190504426] [2019-12-18 15:00:30,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:00:30,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:30,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:00:30,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:00:30,622 INFO L87 Difference]: Start difference. First operand 11162 states and 34879 transitions. Second operand 7 states. [2019-12-18 15:00:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:31,073 INFO L93 Difference]: Finished difference Result 27840 states and 85084 transitions. [2019-12-18 15:00:31,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:00:31,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 15:00:31,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:31,115 INFO L225 Difference]: With dead ends: 27840 [2019-12-18 15:00:31,115 INFO L226 Difference]: Without dead ends: 19924 [2019-12-18 15:00:31,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:00:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19924 states. [2019-12-18 15:00:31,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19924 to 13020. [2019-12-18 15:00:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13020 states. [2019-12-18 15:00:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 40574 transitions. [2019-12-18 15:00:31,403 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 40574 transitions. Word has length 53 [2019-12-18 15:00:31,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:31,404 INFO L462 AbstractCegarLoop]: Abstraction has 13020 states and 40574 transitions. [2019-12-18 15:00:31,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:00:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 40574 transitions. [2019-12-18 15:00:31,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 15:00:31,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:31,424 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] [2019-12-18 15:00:31,424 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 15:00:31,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:31,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1901485579, now seen corresponding path program 4 times [2019-12-18 15:00:31,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:31,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101148230] [2019-12-18 15:00:31,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:31,506 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 15:00:31,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101148230] [2019-12-18 15:00:31,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:31,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:00:31,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069927313] [2019-12-18 15:00:31,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:00:31,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:31,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:00:31,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:00:31,509 INFO L87 Difference]: Start difference. First operand 13020 states and 40574 transitions. Second operand 7 states. [2019-12-18 15:00:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:31,917 INFO L93 Difference]: Finished difference Result 25803 states and 80188 transitions. [2019-12-18 15:00:31,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 15:00:31,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 15:00:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:31,953 INFO L225 Difference]: With dead ends: 25803 [2019-12-18 15:00:31,954 INFO L226 Difference]: Without dead ends: 23832 [2019-12-18 15:00:31,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:00:32,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23832 states. [2019-12-18 15:00:32,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23832 to 13086. [2019-12-18 15:00:32,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13086 states. [2019-12-18 15:00:32,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13086 states to 13086 states and 40859 transitions. [2019-12-18 15:00:32,255 INFO L78 Accepts]: Start accepts. Automaton has 13086 states and 40859 transitions. Word has length 53 [2019-12-18 15:00:32,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:32,255 INFO L462 AbstractCegarLoop]: Abstraction has 13086 states and 40859 transitions. [2019-12-18 15:00:32,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:00:32,255 INFO L276 IsEmpty]: Start isEmpty. Operand 13086 states and 40859 transitions. [2019-12-18 15:00:32,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 15:00:32,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:32,273 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] [2019-12-18 15:00:32,273 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 15:00:32,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:32,273 INFO L82 PathProgramCache]: Analyzing trace with hash -9451933, now seen corresponding path program 1 times [2019-12-18 15:00:32,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:32,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944537975] [2019-12-18 15:00:32,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:32,331 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 15:00:32,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944537975] [2019-12-18 15:00:32,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:32,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:00:32,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355241413] [2019-12-18 15:00:32,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:00:32,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:32,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:00:32,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:00:32,333 INFO L87 Difference]: Start difference. First operand 13086 states and 40859 transitions. Second operand 3 states. [2019-12-18 15:00:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:32,440 INFO L93 Difference]: Finished difference Result 18737 states and 58738 transitions. [2019-12-18 15:00:32,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:00:32,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 15:00:32,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:32,467 INFO L225 Difference]: With dead ends: 18737 [2019-12-18 15:00:32,467 INFO L226 Difference]: Without dead ends: 18737 [2019-12-18 15:00:32,468 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 15:00:32,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18737 states. [2019-12-18 15:00:32,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18737 to 16909. [2019-12-18 15:00:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16909 states. [2019-12-18 15:00:32,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16909 states to 16909 states and 53533 transitions. [2019-12-18 15:00:32,751 INFO L78 Accepts]: Start accepts. Automaton has 16909 states and 53533 transitions. Word has length 53 [2019-12-18 15:00:32,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:32,751 INFO L462 AbstractCegarLoop]: Abstraction has 16909 states and 53533 transitions. [2019-12-18 15:00:32,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:00:32,751 INFO L276 IsEmpty]: Start isEmpty. Operand 16909 states and 53533 transitions. [2019-12-18 15:00:32,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 15:00:32,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:32,771 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] [2019-12-18 15:00:32,771 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 15:00:32,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:32,772 INFO L82 PathProgramCache]: Analyzing trace with hash 2081547793, now seen corresponding path program 5 times [2019-12-18 15:00:32,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:32,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081543179] [2019-12-18 15:00:32,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:32,873 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 15:00:32,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081543179] [2019-12-18 15:00:32,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:32,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:00:32,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384977554] [2019-12-18 15:00:32,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:00:32,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:32,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:00:32,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:00:32,875 INFO L87 Difference]: Start difference. First operand 16909 states and 53533 transitions. Second operand 6 states. [2019-12-18 15:00:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:33,660 INFO L93 Difference]: Finished difference Result 31543 states and 97867 transitions. [2019-12-18 15:00:33,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:00:33,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-18 15:00:33,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:33,711 INFO L225 Difference]: With dead ends: 31543 [2019-12-18 15:00:33,711 INFO L226 Difference]: Without dead ends: 31459 [2019-12-18 15:00:33,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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 15:00:33,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31459 states. [2019-12-18 15:00:34,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31459 to 19853. [2019-12-18 15:00:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19853 states. [2019-12-18 15:00:34,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19853 states to 19853 states and 62091 transitions. [2019-12-18 15:00:34,112 INFO L78 Accepts]: Start accepts. Automaton has 19853 states and 62091 transitions. Word has length 53 [2019-12-18 15:00:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:34,113 INFO L462 AbstractCegarLoop]: Abstraction has 19853 states and 62091 transitions. [2019-12-18 15:00:34,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:00:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 19853 states and 62091 transitions. [2019-12-18 15:00:34,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 15:00:34,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:34,147 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] [2019-12-18 15:00:34,147 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 15:00:34,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:34,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1629843107, now seen corresponding path program 6 times [2019-12-18 15:00:34,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:34,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174290437] [2019-12-18 15:00:34,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:34,254 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 15:00:34,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174290437] [2019-12-18 15:00:34,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:34,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:00:34,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615594138] [2019-12-18 15:00:34,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:00:34,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:34,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:00:34,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:00:34,256 INFO L87 Difference]: Start difference. First operand 19853 states and 62091 transitions. Second operand 7 states. [2019-12-18 15:00:35,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:35,181 INFO L93 Difference]: Finished difference Result 31464 states and 95079 transitions. [2019-12-18 15:00:35,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 15:00:35,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 15:00:35,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:35,228 INFO L225 Difference]: With dead ends: 31464 [2019-12-18 15:00:35,228 INFO L226 Difference]: Without dead ends: 31342 [2019-12-18 15:00:35,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:00:35,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31342 states. [2019-12-18 15:00:35,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31342 to 25003. [2019-12-18 15:00:35,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25003 states. [2019-12-18 15:00:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25003 states to 25003 states and 77213 transitions. [2019-12-18 15:00:35,685 INFO L78 Accepts]: Start accepts. Automaton has 25003 states and 77213 transitions. Word has length 53 [2019-12-18 15:00:35,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:35,686 INFO L462 AbstractCegarLoop]: Abstraction has 25003 states and 77213 transitions. [2019-12-18 15:00:35,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:00:35,686 INFO L276 IsEmpty]: Start isEmpty. Operand 25003 states and 77213 transitions. [2019-12-18 15:00:35,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 15:00:35,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:35,717 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] [2019-12-18 15:00:35,717 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 15:00:35,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:35,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1109995221, now seen corresponding path program 7 times [2019-12-18 15:00:35,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:35,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315576464] [2019-12-18 15:00:35,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:35,845 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 15:00:35,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315576464] [2019-12-18 15:00:35,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:35,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:00:35,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708273886] [2019-12-18 15:00:35,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:00:35,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:35,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:00:35,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:00:35,847 INFO L87 Difference]: Start difference. First operand 25003 states and 77213 transitions. Second operand 9 states. [2019-12-18 15:00:37,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:37,817 INFO L93 Difference]: Finished difference Result 41056 states and 124508 transitions. [2019-12-18 15:00:37,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 15:00:37,817 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 15:00:37,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:37,875 INFO L225 Difference]: With dead ends: 41056 [2019-12-18 15:00:37,875 INFO L226 Difference]: Without dead ends: 41056 [2019-12-18 15:00:37,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-18 15:00:37,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41056 states. [2019-12-18 15:00:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41056 to 23556. [2019-12-18 15:00:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23556 states. [2019-12-18 15:00:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23556 states to 23556 states and 73044 transitions. [2019-12-18 15:00:38,366 INFO L78 Accepts]: Start accepts. Automaton has 23556 states and 73044 transitions. Word has length 53 [2019-12-18 15:00:38,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:38,367 INFO L462 AbstractCegarLoop]: Abstraction has 23556 states and 73044 transitions. [2019-12-18 15:00:38,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:00:38,367 INFO L276 IsEmpty]: Start isEmpty. Operand 23556 states and 73044 transitions. [2019-12-18 15:00:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 15:00:38,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:38,392 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] [2019-12-18 15:00:38,393 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 15:00:38,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:38,393 INFO L82 PathProgramCache]: Analyzing trace with hash 2099294685, now seen corresponding path program 8 times [2019-12-18 15:00:38,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:38,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811326483] [2019-12-18 15:00:38,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:38,462 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 15:00:38,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811326483] [2019-12-18 15:00:38,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:38,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:00:38,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585464775] [2019-12-18 15:00:38,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:00:38,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:38,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:00:38,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:00:38,464 INFO L87 Difference]: Start difference. First operand 23556 states and 73044 transitions. Second operand 3 states. [2019-12-18 15:00:38,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:38,552 INFO L93 Difference]: Finished difference Result 17418 states and 53184 transitions. [2019-12-18 15:00:38,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:00:38,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 15:00:38,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:38,589 INFO L225 Difference]: With dead ends: 17418 [2019-12-18 15:00:38,589 INFO L226 Difference]: Without dead ends: 17418 [2019-12-18 15:00:38,590 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 15:00:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17418 states. [2019-12-18 15:00:38,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17418 to 16845. [2019-12-18 15:00:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16845 states. [2019-12-18 15:00:39,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16845 states to 16845 states and 51304 transitions. [2019-12-18 15:00:39,013 INFO L78 Accepts]: Start accepts. Automaton has 16845 states and 51304 transitions. Word has length 53 [2019-12-18 15:00:39,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:39,013 INFO L462 AbstractCegarLoop]: Abstraction has 16845 states and 51304 transitions. [2019-12-18 15:00:39,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:00:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 16845 states and 51304 transitions. [2019-12-18 15:00:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:00:39,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:39,041 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] [2019-12-18 15:00:39,041 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 15:00:39,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:39,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2130494140, now seen corresponding path program 1 times [2019-12-18 15:00:39,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:39,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645214478] [2019-12-18 15:00:39,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:39,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:00:39,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645214478] [2019-12-18 15:00:39,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:39,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:00:39,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099463757] [2019-12-18 15:00:39,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:00:39,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:39,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:00:39,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:00:39,164 INFO L87 Difference]: Start difference. First operand 16845 states and 51304 transitions. Second operand 7 states. [2019-12-18 15:00:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:40,007 INFO L93 Difference]: Finished difference Result 23352 states and 69676 transitions. [2019-12-18 15:00:40,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 15:00:40,008 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 15:00:40,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:40,039 INFO L225 Difference]: With dead ends: 23352 [2019-12-18 15:00:40,039 INFO L226 Difference]: Without dead ends: 23216 [2019-12-18 15:00:40,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:00:40,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23216 states. [2019-12-18 15:00:40,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23216 to 18293. [2019-12-18 15:00:40,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18293 states. [2019-12-18 15:00:40,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18293 states to 18293 states and 55408 transitions. [2019-12-18 15:00:40,352 INFO L78 Accepts]: Start accepts. Automaton has 18293 states and 55408 transitions. Word has length 54 [2019-12-18 15:00:40,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:40,353 INFO L462 AbstractCegarLoop]: Abstraction has 18293 states and 55408 transitions. [2019-12-18 15:00:40,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:00:40,353 INFO L276 IsEmpty]: Start isEmpty. Operand 18293 states and 55408 transitions. [2019-12-18 15:00:40,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:00:40,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:40,373 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] [2019-12-18 15:00:40,373 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 15:00:40,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:40,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1027069858, now seen corresponding path program 2 times [2019-12-18 15:00:40,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:40,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989939268] [2019-12-18 15:00:40,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:40,515 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 15:00:40,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989939268] [2019-12-18 15:00:40,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:40,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:00:40,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177669580] [2019-12-18 15:00:40,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:00:40,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:40,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:00:40,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:00:40,517 INFO L87 Difference]: Start difference. First operand 18293 states and 55408 transitions. Second operand 9 states. [2019-12-18 15:00:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:42,645 INFO L93 Difference]: Finished difference Result 23511 states and 69927 transitions. [2019-12-18 15:00:42,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 15:00:42,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 15:00:42,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:42,678 INFO L225 Difference]: With dead ends: 23511 [2019-12-18 15:00:42,678 INFO L226 Difference]: Without dead ends: 23511 [2019-12-18 15:00:42,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=988, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 15:00:42,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23511 states. [2019-12-18 15:00:42,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23511 to 16096. [2019-12-18 15:00:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16096 states. [2019-12-18 15:00:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16096 states to 16096 states and 49156 transitions. [2019-12-18 15:00:42,983 INFO L78 Accepts]: Start accepts. Automaton has 16096 states and 49156 transitions. Word has length 54 [2019-12-18 15:00:42,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:42,984 INFO L462 AbstractCegarLoop]: Abstraction has 16096 states and 49156 transitions. [2019-12-18 15:00:42,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:00:42,984 INFO L276 IsEmpty]: Start isEmpty. Operand 16096 states and 49156 transitions. [2019-12-18 15:00:43,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:00:43,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:43,001 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] [2019-12-18 15:00:43,001 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 15:00:43,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:43,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1391330862, now seen corresponding path program 3 times [2019-12-18 15:00:43,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:43,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288857080] [2019-12-18 15:00:43,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:43,106 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 15:00:43,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288857080] [2019-12-18 15:00:43,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:43,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 15:00:43,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019797637] [2019-12-18 15:00:43,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:00:43,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:43,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:00:43,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:00:43,108 INFO L87 Difference]: Start difference. First operand 16096 states and 49156 transitions. Second operand 9 states. [2019-12-18 15:00:44,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:44,324 INFO L93 Difference]: Finished difference Result 30201 states and 91855 transitions. [2019-12-18 15:00:44,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 15:00:44,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 15:00:44,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:44,359 INFO L225 Difference]: With dead ends: 30201 [2019-12-18 15:00:44,359 INFO L226 Difference]: Without dead ends: 23426 [2019-12-18 15:00:44,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:00:44,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23426 states. [2019-12-18 15:00:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23426 to 16553. [2019-12-18 15:00:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16553 states. [2019-12-18 15:00:44,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16553 states to 16553 states and 50075 transitions. [2019-12-18 15:00:44,663 INFO L78 Accepts]: Start accepts. Automaton has 16553 states and 50075 transitions. Word has length 54 [2019-12-18 15:00:44,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:44,663 INFO L462 AbstractCegarLoop]: Abstraction has 16553 states and 50075 transitions. [2019-12-18 15:00:44,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:00:44,663 INFO L276 IsEmpty]: Start isEmpty. Operand 16553 states and 50075 transitions. [2019-12-18 15:00:44,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:00:44,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:44,681 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] [2019-12-18 15:00:44,681 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 15:00:44,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:44,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1496564564, now seen corresponding path program 4 times [2019-12-18 15:00:44,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:44,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320732788] [2019-12-18 15:00:44,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:44,830 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 15:00:44,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320732788] [2019-12-18 15:00:44,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:44,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:00:44,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129586000] [2019-12-18 15:00:44,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:00:44,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:44,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:00:44,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:00:44,832 INFO L87 Difference]: Start difference. First operand 16553 states and 50075 transitions. Second operand 11 states. [2019-12-18 15:00:45,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:45,908 INFO L93 Difference]: Finished difference Result 32000 states and 96391 transitions. [2019-12-18 15:00:45,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 15:00:45,908 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-18 15:00:45,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:45,956 INFO L225 Difference]: With dead ends: 32000 [2019-12-18 15:00:45,956 INFO L226 Difference]: Without dead ends: 30902 [2019-12-18 15:00:45,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:00:46,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30902 states. [2019-12-18 15:00:46,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30902 to 18971. [2019-12-18 15:00:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18971 states. [2019-12-18 15:00:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18971 states to 18971 states and 57155 transitions. [2019-12-18 15:00:46,555 INFO L78 Accepts]: Start accepts. Automaton has 18971 states and 57155 transitions. Word has length 54 [2019-12-18 15:00:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:46,555 INFO L462 AbstractCegarLoop]: Abstraction has 18971 states and 57155 transitions. [2019-12-18 15:00:46,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:00:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 18971 states and 57155 transitions. [2019-12-18 15:00:46,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:00:46,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:46,577 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] [2019-12-18 15:00:46,577 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 15:00:46,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:46,577 INFO L82 PathProgramCache]: Analyzing trace with hash 845727880, now seen corresponding path program 5 times [2019-12-18 15:00:46,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:46,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071426160] [2019-12-18 15:00:46,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:46,766 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 15:00:46,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071426160] [2019-12-18 15:00:46,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:46,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:00:46,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077499303] [2019-12-18 15:00:46,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:00:46,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:46,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:00:46,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:00:46,768 INFO L87 Difference]: Start difference. First operand 18971 states and 57155 transitions. Second operand 11 states. [2019-12-18 15:00:47,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:47,672 INFO L93 Difference]: Finished difference Result 31387 states and 94014 transitions. [2019-12-18 15:00:47,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 15:00:47,672 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-18 15:00:47,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:47,710 INFO L225 Difference]: With dead ends: 31387 [2019-12-18 15:00:47,710 INFO L226 Difference]: Without dead ends: 25808 [2019-12-18 15:00:47,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 15:00:47,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25808 states. [2019-12-18 15:00:47,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25808 to 15801. [2019-12-18 15:00:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15801 states. [2019-12-18 15:00:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15801 states to 15801 states and 47745 transitions. [2019-12-18 15:00:48,028 INFO L78 Accepts]: Start accepts. Automaton has 15801 states and 47745 transitions. Word has length 54 [2019-12-18 15:00:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:48,028 INFO L462 AbstractCegarLoop]: Abstraction has 15801 states and 47745 transitions. [2019-12-18 15:00:48,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:00:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 15801 states and 47745 transitions. [2019-12-18 15:00:48,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:00:48,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:48,046 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] [2019-12-18 15:00:48,046 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 15:00:48,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:48,046 INFO L82 PathProgramCache]: Analyzing trace with hash -139497916, now seen corresponding path program 6 times [2019-12-18 15:00:48,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:48,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691864281] [2019-12-18 15:00:48,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:48,104 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 15:00:48,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691864281] [2019-12-18 15:00:48,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:48,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:00:48,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108948749] [2019-12-18 15:00:48,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:00:48,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:48,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:00:48,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:00:48,106 INFO L87 Difference]: Start difference. First operand 15801 states and 47745 transitions. Second operand 3 states. [2019-12-18 15:00:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:48,178 INFO L93 Difference]: Finished difference Result 15799 states and 47740 transitions. [2019-12-18 15:00:48,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:00:48,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 15:00:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:48,209 INFO L225 Difference]: With dead ends: 15799 [2019-12-18 15:00:48,209 INFO L226 Difference]: Without dead ends: 15799 [2019-12-18 15:00:48,210 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 15:00:48,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15799 states. [2019-12-18 15:00:48,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15799 to 14369. [2019-12-18 15:00:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14369 states. [2019-12-18 15:00:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14369 states to 14369 states and 43776 transitions. [2019-12-18 15:00:48,700 INFO L78 Accepts]: Start accepts. Automaton has 14369 states and 43776 transitions. Word has length 54 [2019-12-18 15:00:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:48,700 INFO L462 AbstractCegarLoop]: Abstraction has 14369 states and 43776 transitions. [2019-12-18 15:00:48,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:00:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 14369 states and 43776 transitions. [2019-12-18 15:00:48,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 15:00:48,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:48,729 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 15:00:48,729 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 15:00:48,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:48,730 INFO L82 PathProgramCache]: Analyzing trace with hash -2043347127, now seen corresponding path program 1 times [2019-12-18 15:00:48,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:48,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208293736] [2019-12-18 15:00:48,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:49,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 15:00:49,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208293736] [2019-12-18 15:00:49,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:49,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:00:49,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820707578] [2019-12-18 15:00:49,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:00:49,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:49,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:00:49,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:00:49,212 INFO L87 Difference]: Start difference. First operand 14369 states and 43776 transitions. Second operand 15 states. [2019-12-18 15:00:52,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:52,304 INFO L93 Difference]: Finished difference Result 24874 states and 74945 transitions. [2019-12-18 15:00:52,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 15:00:52,309 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-18 15:00:52,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:52,344 INFO L225 Difference]: With dead ends: 24874 [2019-12-18 15:00:52,344 INFO L226 Difference]: Without dead ends: 24526 [2019-12-18 15:00:52,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=420, Invalid=2130, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 15:00:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24526 states. [2019-12-18 15:00:52,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24526 to 14223. [2019-12-18 15:00:52,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14223 states. [2019-12-18 15:00:52,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14223 states to 14223 states and 43434 transitions. [2019-12-18 15:00:52,762 INFO L78 Accepts]: Start accepts. Automaton has 14223 states and 43434 transitions. Word has length 55 [2019-12-18 15:00:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:00:52,762 INFO L462 AbstractCegarLoop]: Abstraction has 14223 states and 43434 transitions. [2019-12-18 15:00:52,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:00:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 14223 states and 43434 transitions. [2019-12-18 15:00:52,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 15:00:52,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:52,778 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 15:00:52,778 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 15:00:52,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:52,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 2 times [2019-12-18 15:00:52,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:52,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770365755] [2019-12-18 15:00:52,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:00:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:00:52,888 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:00:52,888 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:00:52,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2360~0.base_24| 4) |v_#length_23|) (= 0 v_~x$w_buff1_used~0_531) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2360~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2360~0.base_24|) |v_ULTIMATE.start_main_~#t2360~0.offset_18| 0)) |v_#memory_int_23|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2360~0.base_24|)) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2360~0.base_24|) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 |v_ULTIMATE.start_main_~#t2360~0.offset_18|) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2360~0.base_24| 1)) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ULTIMATE.start_main_~#t2362~0.offset=|v_ULTIMATE.start_main_~#t2362~0.offset_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t2360~0.base=|v_ULTIMATE.start_main_~#t2360~0.base_24|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_~#t2361~0.base=|v_ULTIMATE.start_main_~#t2361~0.base_26|, ULTIMATE.start_main_~#t2361~0.offset=|v_ULTIMATE.start_main_~#t2361~0.offset_19|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t2362~0.base=|v_ULTIMATE.start_main_~#t2362~0.base_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2360~0.offset=|v_ULTIMATE.start_main_~#t2360~0.offset_18|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2362~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2360~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_~#t2361~0.base, ULTIMATE.start_main_~#t2361~0.offset, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2362~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ULTIMATE.start_main_~#t2360~0.offset, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 15:00:52,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2361~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t2361~0.offset_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2361~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2361~0.base_13|) |v_ULTIMATE.start_main_~#t2361~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2361~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2361~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t2361~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2361~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2361~0.base=|v_ULTIMATE.start_main_~#t2361~0.base_13|, ULTIMATE.start_main_~#t2361~0.offset=|v_ULTIMATE.start_main_~#t2361~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2361~0.base, ULTIMATE.start_main_~#t2361~0.offset] because there is no mapped edge [2019-12-18 15:00:52,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2362~0.base_13| 1) |v_#valid_38|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2362~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t2362~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2362~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t2362~0.offset_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2362~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2362~0.base_13|) |v_ULTIMATE.start_main_~#t2362~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2362~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2362~0.offset=|v_ULTIMATE.start_main_~#t2362~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2362~0.base=|v_ULTIMATE.start_main_~#t2362~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2362~0.offset, ULTIMATE.start_main_~#t2362~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 15:00:52,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= 0 (mod ~x$w_buff1_used~0_Out-2117284021 256)) (= P1Thread1of1ForFork0_~arg.offset_Out-2117284021 |P1Thread1of1ForFork0_#in~arg.offset_In-2117284021|) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2117284021| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-2117284021) (= 1 |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2117284021|) (= 1 ~x$w_buff0~0_Out-2117284021) (= ~x$w_buff0~0_In-2117284021 ~x$w_buff1~0_Out-2117284021) (= 1 ~x$w_buff0_used~0_Out-2117284021) (= |P1Thread1of1ForFork0_#in~arg.base_In-2117284021| P1Thread1of1ForFork0_~arg.base_Out-2117284021) (= ~x$w_buff1_used~0_Out-2117284021 ~x$w_buff0_used~0_In-2117284021)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-2117284021, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-2117284021|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-2117284021|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2117284021} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-2117284021, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-2117284021, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-2117284021, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-2117284021, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2117284021|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-2117284021|, ~x$w_buff1~0=~x$w_buff1~0_Out-2117284021, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-2117284021|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-2117284021, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-2117284021} 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 15:00:52,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In960216490 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In960216490 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In960216490 |P2Thread1of1ForFork1_#t~ite32_Out960216490|) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In960216490 |P2Thread1of1ForFork1_#t~ite32_Out960216490|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In960216490, ~x$w_buff1_used~0=~x$w_buff1_used~0_In960216490, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In960216490, ~x~0=~x~0_In960216490} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out960216490|, ~x$w_buff1~0=~x$w_buff1~0_In960216490, ~x$w_buff1_used~0=~x$w_buff1_used~0_In960216490, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In960216490, ~x~0=~x~0_In960216490} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 15:00:52,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_29|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 15:00:52,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1378680829 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1378680829 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1378680829|)) (and (= ~x$w_buff0_used~0_In1378680829 |P2Thread1of1ForFork1_#t~ite34_Out1378680829|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1378680829, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1378680829} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1378680829|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1378680829, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1378680829} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 15:00:52,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1226149322 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1226149322 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out1226149322| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out1226149322| ~x$w_buff0_used~0_In1226149322)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1226149322, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1226149322} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1226149322, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1226149322|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1226149322} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 15:00:52,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-760205016 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-760205016 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-760205016 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-760205016 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out-760205016| ~x$w_buff1_used~0_In-760205016) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite29_Out-760205016| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-760205016, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-760205016, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-760205016, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-760205016} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-760205016, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-760205016, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-760205016, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-760205016|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-760205016} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 15:00:52,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In195529679 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In195529679 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out195529679 ~x$r_buff0_thd2~0_In195529679)) (and (not .cse0) (= ~x$r_buff0_thd2~0_Out195529679 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In195529679, ~x$w_buff0_used~0=~x$w_buff0_used~0_In195529679} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out195529679|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out195529679, ~x$w_buff0_used~0=~x$w_buff0_used~0_In195529679} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 15:00:52,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-239758123 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-239758123 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-239758123 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-239758123 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-239758123 |P1Thread1of1ForFork0_#t~ite31_Out-239758123|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-239758123|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-239758123, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-239758123, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-239758123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-239758123} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-239758123|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-239758123, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-239758123, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-239758123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-239758123} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 15:00:52,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, 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 15:00:52,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1584682997 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In-1584682997| |P0Thread1of1ForFork2_#t~ite11_Out-1584682997|) (= ~x$w_buff1~0_In-1584682997 |P0Thread1of1ForFork2_#t~ite12_Out-1584682997|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1584682997 256)))) (or (= (mod ~x$w_buff0_used~0_In-1584682997 256) 0) (and (= 0 (mod ~x$w_buff1_used~0_In-1584682997 256)) .cse1) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1584682997 256) 0)))) .cse0 (= |P0Thread1of1ForFork2_#t~ite12_Out-1584682997| |P0Thread1of1ForFork2_#t~ite11_Out-1584682997|) (= ~x$w_buff1~0_In-1584682997 |P0Thread1of1ForFork2_#t~ite11_Out-1584682997|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1584682997, ~x$w_buff1~0=~x$w_buff1~0_In-1584682997, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1584682997, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1584682997, ~weak$$choice2~0=~weak$$choice2~0_In-1584682997, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1584682997|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1584682997} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1584682997, ~x$w_buff1~0=~x$w_buff1~0_In-1584682997, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1584682997, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1584682997, ~weak$$choice2~0=~weak$$choice2~0_In-1584682997, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1584682997|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1584682997|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1584682997} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 15:00:52,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-270468560 256) 0))) (or (and .cse0 (= ~x$w_buff0_used~0_In-270468560 |P0Thread1of1ForFork2_#t~ite14_Out-270468560|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-270468560 256)))) (or (= (mod ~x$w_buff0_used~0_In-270468560 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-270468560 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In-270468560 256) 0)))) (= |P0Thread1of1ForFork2_#t~ite15_Out-270468560| |P0Thread1of1ForFork2_#t~ite14_Out-270468560|)) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In-270468560| |P0Thread1of1ForFork2_#t~ite14_Out-270468560|) (= |P0Thread1of1ForFork2_#t~ite15_Out-270468560| ~x$w_buff0_used~0_In-270468560)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-270468560, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-270468560, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-270468560, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-270468560|, ~weak$$choice2~0=~weak$$choice2~0_In-270468560, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-270468560} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-270468560, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-270468560, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-270468560|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-270468560, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-270468560|, ~weak$$choice2~0=~weak$$choice2~0_In-270468560, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-270468560} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 15:00:52,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In257542034 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite18_Out257542034| |P0Thread1of1ForFork2_#t~ite17_Out257542034|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In257542034 256)))) (or (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In257542034 256))) (= 0 (mod ~x$w_buff0_used~0_In257542034 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In257542034 256)) .cse0))) (= |P0Thread1of1ForFork2_#t~ite17_Out257542034| ~x$w_buff1_used~0_In257542034) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite17_In257542034| |P0Thread1of1ForFork2_#t~ite17_Out257542034|) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite18_Out257542034| ~x$w_buff1_used~0_In257542034)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In257542034, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In257542034|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In257542034, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In257542034, ~weak$$choice2~0=~weak$$choice2~0_In257542034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In257542034} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In257542034, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out257542034|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out257542034|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In257542034, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In257542034, ~weak$$choice2~0=~weak$$choice2~0_In257542034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In257542034} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 15:00:52,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite23_39| |v_P0Thread1of1ForFork2_#t~ite23_40|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_35|) (not (= 0 (mod v_~weak$$choice2~0_142 256))) (= |v_P0Thread1of1ForFork2_#t~ite22_36| |v_P0Thread1of1ForFork2_#t~ite22_35|)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_40|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_36|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_35|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_39|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_35|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 15:00:52,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 15:00:52,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In2115237606 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2115237606 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In2115237606 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In2115237606 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In2115237606 |P2Thread1of1ForFork1_#t~ite35_Out2115237606|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out2115237606|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2115237606, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2115237606, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2115237606, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2115237606} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out2115237606|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2115237606, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2115237606, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2115237606, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2115237606} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 15:00:52,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1363277609 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1363277609 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out1363277609|) (not .cse1)) (and (= ~x$r_buff0_thd3~0_In1363277609 |P2Thread1of1ForFork1_#t~ite36_Out1363277609|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1363277609, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1363277609} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1363277609|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1363277609, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1363277609} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 15:00:52,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-376520527 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-376520527 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-376520527 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-376520527 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-376520527|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite37_Out-376520527| ~x$r_buff1_thd3~0_In-376520527) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-376520527, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-376520527, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-376520527, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-376520527} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-376520527|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-376520527, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-376520527, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-376520527, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-376520527} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 15:00:52,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_40|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_39|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, 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 15:00:52,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= 3 v_~__unbuffered_cnt~0_39) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 15:00:52,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-102096705 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-102096705 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-102096705 |ULTIMATE.start_main_#t~ite41_Out-102096705|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out-102096705| ~x~0_In-102096705) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-102096705, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-102096705, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-102096705, ~x~0=~x~0_In-102096705} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-102096705|, ~x$w_buff1~0=~x$w_buff1~0_In-102096705, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-102096705, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-102096705, ~x~0=~x~0_In-102096705} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 15:00:52,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 15:00:52,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-487626149 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-487626149 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-487626149| ~x$w_buff0_used~0_In-487626149) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out-487626149| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-487626149, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-487626149} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-487626149, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-487626149|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-487626149} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 15:00:52,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In-1725964012 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1725964012 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1725964012 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1725964012 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1725964012|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1725964012 |ULTIMATE.start_main_#t~ite44_Out-1725964012|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1725964012, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1725964012, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1725964012, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1725964012} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1725964012, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1725964012, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1725964012, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1725964012|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1725964012} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 15:00:52,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In513739135 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In513739135 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out513739135|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In513739135 |ULTIMATE.start_main_#t~ite45_Out513739135|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In513739135, ~x$w_buff0_used~0=~x$w_buff0_used~0_In513739135} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In513739135, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out513739135|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In513739135} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 15:00:52,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-575986187 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-575986187 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-575986187 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-575986187 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-575986187| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite46_Out-575986187| ~x$r_buff1_thd0~0_In-575986187) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-575986187, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-575986187, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-575986187, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-575986187} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-575986187, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-575986187|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-575986187, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-575986187, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-575986187} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 15:00:52,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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 15:00:53,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:00:53 BasicIcfg [2019-12-18 15:00:53,019 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:00:53,021 INFO L168 Benchmark]: Toolchain (without parser) took 80209.74 ms. Allocated memory was 134.2 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 96.9 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 593.3 MB. Max. memory is 7.1 GB. [2019-12-18 15:00:53,021 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 134.2 MB. Free memory was 117.4 MB in the beginning and 117.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 15:00:53,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 830.69 ms. Allocated memory was 134.2 MB in the beginning and 199.2 MB in the end (delta: 65.0 MB). Free memory was 96.7 MB in the beginning and 152.4 MB in the end (delta: -55.6 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 15:00:53,022 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.07 ms. Allocated memory is still 199.2 MB. Free memory was 152.4 MB in the beginning and 150.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-18 15:00:53,023 INFO L168 Benchmark]: Boogie Preprocessor took 50.39 ms. Allocated memory is still 199.2 MB. Free memory was 150.1 MB in the beginning and 147.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-18 15:00:53,023 INFO L168 Benchmark]: RCFGBuilder took 860.41 ms. Allocated memory is still 199.2 MB. Free memory was 147.9 MB in the beginning and 100.5 MB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 7.1 GB. [2019-12-18 15:00:53,024 INFO L168 Benchmark]: TraceAbstraction took 78400.70 ms. Allocated memory was 199.2 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 100.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 531.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:00:53,031 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.49 ms. Allocated memory is still 134.2 MB. Free memory was 117.4 MB in the beginning and 117.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 830.69 ms. Allocated memory was 134.2 MB in the beginning and 199.2 MB in the end (delta: 65.0 MB). Free memory was 96.7 MB in the beginning and 152.4 MB in the end (delta: -55.6 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.07 ms. Allocated memory is still 199.2 MB. Free memory was 152.4 MB in the beginning and 150.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.39 ms. Allocated memory is still 199.2 MB. Free memory was 150.1 MB in the beginning and 147.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 860.41 ms. Allocated memory is still 199.2 MB. Free memory was 147.9 MB in the beginning and 100.5 MB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 78400.70 ms. Allocated memory was 199.2 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 100.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 531.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2360, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L822] FCALL, FORK 0 pthread_create(&t2361, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L777] 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, __unbuffered_p2_EBX=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] [L824] FCALL, FORK 0 pthread_create(&t2362, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=0] [L797] 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, __unbuffered_p2_EBX=0, 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=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1] [L741] 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, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1] [L777] 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) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 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 [L741] 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) [L742] EXPR 1 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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))=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=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=1] [L742] 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)) [L743] 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)) [L744] 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)) [L745] 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)) [L747] 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)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=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=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 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 [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, 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=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 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 [L833] 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, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 78.0s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 27.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4966 SDtfs, 6125 SDslu, 16904 SDs, 0 SdLazy, 10579 SolverSat, 300 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 62 SyntacticMatches, 20 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1645 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 27.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 151906 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1042 NumberOfCodeBlocks, 1042 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 964 ConstructedInterpolants, 0 QuantifiedInterpolants, 182969 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...