/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:40:02,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:40:02,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:40:02,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:40:02,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:40:02,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:40:02,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:40:02,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:40:02,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:40:02,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:40:02,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:40:02,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:40:02,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:40:02,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:40:02,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:40:02,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:40:02,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:40:02,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:40:02,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:40:02,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:40:02,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:40:02,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:40:02,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:40:02,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:40:02,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:40:02,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:40:02,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:40:02,606 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:40:02,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:40:02,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:40:02,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:40:02,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:40:02,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:40:02,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:40:02,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:40:02,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:40:02,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:40:02,612 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:40:02,612 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:40:02,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:40:02,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:40:02,615 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:40:02,629 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:40:02,629 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:40:02,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:40:02,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:40:02,631 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:40:02,631 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:40:02,631 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:40:02,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:40:02,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:40:02,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:40:02,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:40:02,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:40:02,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:40:02,632 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:40:02,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:40:02,633 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:40:02,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:40:02,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:40:02,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:40:02,633 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:40:02,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:40:02,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:40:02,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:40:02,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:40:02,634 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:40:02,635 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:40:02,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:40:02,635 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:40:02,635 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:40:02,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:40:02,957 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:40:02,960 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:40:02,962 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:40:02,962 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:40:02,963 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_pso.opt.i [2019-12-27 03:40:03,040 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d486f0ec/ae44dfdddab34d4d9669120b2c0cada1/FLAG3031ba46e [2019-12-27 03:40:03,660 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:40:03,660 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_pso.opt.i [2019-12-27 03:40:03,676 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d486f0ec/ae44dfdddab34d4d9669120b2c0cada1/FLAG3031ba46e [2019-12-27 03:40:03,889 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d486f0ec/ae44dfdddab34d4d9669120b2c0cada1 [2019-12-27 03:40:03,898 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:40:03,900 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:40:03,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:40:03,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:40:03,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:40:03,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:40:03" (1/1) ... [2019-12-27 03:40:03,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a7d84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:03, skipping insertion in model container [2019-12-27 03:40:03,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:40:03" (1/1) ... [2019-12-27 03:40:03,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:40:03,993 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:40:04,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:40:04,597 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:40:04,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:40:04,759 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:40:04,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:04 WrapperNode [2019-12-27 03:40:04,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:40:04,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:40:04,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:40:04,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:40:04,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:04" (1/1) ... [2019-12-27 03:40:04,792 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:04" (1/1) ... [2019-12-27 03:40:04,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:40:04,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:40:04,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:40:04,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:40:04,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:04" (1/1) ... [2019-12-27 03:40:04,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:04" (1/1) ... [2019-12-27 03:40:04,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:04" (1/1) ... [2019-12-27 03:40:04,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:04" (1/1) ... [2019-12-27 03:40:04,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:04" (1/1) ... [2019-12-27 03:40:04,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:04" (1/1) ... [2019-12-27 03:40:04,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:04" (1/1) ... [2019-12-27 03:40:04,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:40:04,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:40:04,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:40:04,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:40:04,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:40:04,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:40:04,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:40:04,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:40:04,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:40:04,958 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:40:04,959 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:40:04,960 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:40:04,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:40:04,961 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:40:04,961 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:40:04,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:40:04,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:40:04,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:40:04,967 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:40:05,839 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:40:05,839 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:40:05,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:40:05 BoogieIcfgContainer [2019-12-27 03:40:05,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:40:05,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:40:05,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:40:05,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:40:05,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:40:03" (1/3) ... [2019-12-27 03:40:05,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b144aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:40:05, skipping insertion in model container [2019-12-27 03:40:05,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:04" (2/3) ... [2019-12-27 03:40:05,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b144aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:40:05, skipping insertion in model container [2019-12-27 03:40:05,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:40:05" (3/3) ... [2019-12-27 03:40:05,850 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_pso.opt.i [2019-12-27 03:40:05,860 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:40:05,861 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:40:05,872 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:40:05,874 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:40:05,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,926 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,927 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,980 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,980 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,980 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,981 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,982 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:05,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,000 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,000 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,009 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,009 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,009 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,015 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,016 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,021 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,021 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:06,040 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:40:06,061 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:40:06,061 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:40:06,061 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:40:06,061 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:40:06,062 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:40:06,062 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:40:06,062 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:40:06,062 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:40:06,078 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 03:40:06,080 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 03:40:06,213 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 03:40:06,214 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:40:06,231 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:40:06,250 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 03:40:06,305 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 03:40:06,305 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:40:06,316 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:40:06,339 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 03:40:06,341 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:40:11,831 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-27 03:40:12,287 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 03:40:12,417 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 03:40:12,525 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66094 [2019-12-27 03:40:12,525 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 03:40:12,529 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-27 03:40:23,764 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-27 03:40:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-27 03:40:23,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:40:23,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:40:23,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:40:23,774 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-27 03:40:23,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:40:23,782 INFO L82 PathProgramCache]: Analyzing trace with hash 794637732, now seen corresponding path program 1 times [2019-12-27 03:40:23,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:40:23,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928789683] [2019-12-27 03:40:23,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:40:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:40:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:40:24,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928789683] [2019-12-27 03:40:24,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:40:24,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:40:24,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251174784] [2019-12-27 03:40:24,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:40:24,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:40:24,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:40:24,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:40:24,105 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-27 03:40:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:40:27,451 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-27 03:40:27,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:40:27,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:40:27,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:40:28,022 INFO L225 Difference]: With dead ends: 85012 [2019-12-27 03:40:28,022 INFO L226 Difference]: Without dead ends: 80140 [2019-12-27 03:40:28,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:40:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-27 03:40:35,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-27 03:40:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-27 03:40:35,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-27 03:40:35,678 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-27 03:40:35,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:40:35,678 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-27 03:40:35,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:40:35,678 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-27 03:40:35,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:40:35,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:40:35,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:40:35,689 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-27 03:40:35,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:40:35,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1795694344, now seen corresponding path program 1 times [2019-12-27 03:40:35,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:40:35,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818601479] [2019-12-27 03:40:35,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:40:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:40:35,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:40:35,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818601479] [2019-12-27 03:40:35,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:40:35,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:40:35,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072929511] [2019-12-27 03:40:35,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:40:35,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:40:35,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:40:35,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:40:35,797 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-27 03:40:40,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:40:40,228 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-27 03:40:40,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:40:40,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:40:40,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:40:40,619 INFO L225 Difference]: With dead ends: 123388 [2019-12-27 03:40:40,620 INFO L226 Difference]: Without dead ends: 123290 [2019-12-27 03:40:40,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:40:44,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-27 03:40:46,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-27 03:40:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-27 03:40:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-27 03:40:47,356 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-27 03:40:47,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:40:47,357 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-27 03:40:47,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:40:47,357 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-27 03:40:47,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:40:47,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:40:47,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:40:47,361 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-27 03:40:47,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:40:47,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1307118492, now seen corresponding path program 1 times [2019-12-27 03:40:47,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:40:47,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869084680] [2019-12-27 03:40:47,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:40:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:40:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:40:47,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869084680] [2019-12-27 03:40:47,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:40:47,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:40:47,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908954449] [2019-12-27 03:40:47,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:40:47,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:40:47,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:40:47,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:40:47,469 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-27 03:40:53,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:40:53,367 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-27 03:40:53,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:40:53,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:40:53,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:40:54,071 INFO L225 Difference]: With dead ends: 159677 [2019-12-27 03:40:54,072 INFO L226 Difference]: Without dead ends: 159565 [2019-12-27 03:40:54,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:40:57,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-27 03:41:00,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-27 03:41:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-27 03:41:01,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-27 03:41:01,234 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-27 03:41:01,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:41:01,234 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-27 03:41:01,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:41:01,235 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-27 03:41:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:41:01,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:41:01,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:41:01,238 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-27 03:41:01,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:41:01,238 INFO L82 PathProgramCache]: Analyzing trace with hash 2137171342, now seen corresponding path program 1 times [2019-12-27 03:41:01,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:41:01,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373807464] [2019-12-27 03:41:01,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:41:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:41:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:41:01,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373807464] [2019-12-27 03:41:01,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:41:01,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:41:01,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600082257] [2019-12-27 03:41:01,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:41:01,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:41:01,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:41:01,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:41:01,303 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 3 states. [2019-12-27 03:41:02,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:41:02,189 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-27 03:41:02,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:41:02,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 03:41:02,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:41:08,902 INFO L225 Difference]: With dead ends: 181618 [2019-12-27 03:41:08,903 INFO L226 Difference]: Without dead ends: 181618 [2019-12-27 03:41:08,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:41:13,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-27 03:41:16,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-27 03:41:16,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-27 03:41:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-27 03:41:16,626 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-27 03:41:16,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:41:16,626 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-27 03:41:16,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:41:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-27 03:41:16,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:41:16,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:41:16,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:41:16,631 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-27 03:41:16,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:41:16,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2137037670, now seen corresponding path program 1 times [2019-12-27 03:41:16,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:41:16,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374624915] [2019-12-27 03:41:16,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:41:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:41:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:41:16,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374624915] [2019-12-27 03:41:16,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:41:16,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:41:16,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362932601] [2019-12-27 03:41:16,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:41:16,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:41:16,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:41:16,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:41:16,706 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 4 states. [2019-12-27 03:41:19,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:41:19,026 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-27 03:41:19,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:41:19,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:41:19,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:41:19,583 INFO L225 Difference]: With dead ends: 179622 [2019-12-27 03:41:19,584 INFO L226 Difference]: Without dead ends: 179542 [2019-12-27 03:41:19,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:41:29,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-27 03:41:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-27 03:41:32,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-27 03:41:33,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-27 03:41:33,684 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-27 03:41:33,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:41:33,684 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-27 03:41:33,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:41:33,685 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-27 03:41:33,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:41:33,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:41:33,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:41:33,689 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-27 03:41:33,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:41:33,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1997758702, now seen corresponding path program 1 times [2019-12-27 03:41:33,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:41:33,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374680662] [2019-12-27 03:41:33,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:41:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:41:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:41:33,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374680662] [2019-12-27 03:41:33,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:41:33,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:41:33,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153089887] [2019-12-27 03:41:33,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:41:33,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:41:33,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:41:33,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:41:33,779 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 4 states. [2019-12-27 03:41:34,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:41:34,849 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-27 03:41:34,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:41:34,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:41:34,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:41:41,905 INFO L225 Difference]: With dead ends: 189091 [2019-12-27 03:41:41,906 INFO L226 Difference]: Without dead ends: 188995 [2019-12-27 03:41:41,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:41:45,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-27 03:41:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-27 03:41:48,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-27 03:41:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-27 03:41:49,423 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-27 03:41:49,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:41:49,424 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-27 03:41:49,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:41:49,424 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-27 03:41:49,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 03:41:49,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:41:49,443 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:41:49,444 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-27 03:41:49,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:41:49,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1754746770, now seen corresponding path program 1 times [2019-12-27 03:41:49,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:41:49,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133223766] [2019-12-27 03:41:49,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:41:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:41:49,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:41:49,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133223766] [2019-12-27 03:41:49,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:41:49,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:41:49,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535431765] [2019-12-27 03:41:49,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:41:49,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:41:49,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:41:49,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:41:49,515 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-27 03:41:51,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:41:51,367 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-27 03:41:51,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:41:51,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 03:41:51,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:41:51,841 INFO L225 Difference]: With dead ends: 160940 [2019-12-27 03:41:51,841 INFO L226 Difference]: Without dead ends: 160940 [2019-12-27 03:41:51,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:42:01,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-27 03:42:04,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-27 03:42:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-27 03:42:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-27 03:42:05,441 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-27 03:42:05,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:05,442 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-27 03:42:05,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:42:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-27 03:42:05,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 03:42:05,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:05,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:05,463 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-27 03:42:05,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:05,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1406595818, now seen corresponding path program 1 times [2019-12-27 03:42:05,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:05,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569297966] [2019-12-27 03:42:05,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:05,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569297966] [2019-12-27 03:42:05,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:05,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:42:05,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143286195] [2019-12-27 03:42:05,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:42:05,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:05,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:42:05,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:42:05,516 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 4 states. [2019-12-27 03:42:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:13,074 INFO L93 Difference]: Finished difference Result 255238 states and 1058186 transitions. [2019-12-27 03:42:13,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:42:13,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 03:42:13,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:13,519 INFO L225 Difference]: With dead ends: 255238 [2019-12-27 03:42:13,519 INFO L226 Difference]: Without dead ends: 128270 [2019-12-27 03:42:13,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:42:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128270 states. [2019-12-27 03:42:19,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128270 to 128270. [2019-12-27 03:42:19,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128270 states. [2019-12-27 03:42:20,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128270 states to 128270 states and 523459 transitions. [2019-12-27 03:42:20,052 INFO L78 Accepts]: Start accepts. Automaton has 128270 states and 523459 transitions. Word has length 19 [2019-12-27 03:42:20,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:20,052 INFO L462 AbstractCegarLoop]: Abstraction has 128270 states and 523459 transitions. [2019-12-27 03:42:20,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:42:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 128270 states and 523459 transitions. [2019-12-27 03:42:20,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 03:42:20,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:20,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:20,065 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-27 03:42:20,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:20,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2069277611, now seen corresponding path program 1 times [2019-12-27 03:42:20,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:20,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707459444] [2019-12-27 03:42:20,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:20,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:20,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707459444] [2019-12-27 03:42:20,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:20,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:42:20,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061184537] [2019-12-27 03:42:20,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:42:20,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:20,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:42:20,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:42:20,136 INFO L87 Difference]: Start difference. First operand 128270 states and 523459 transitions. Second operand 4 states. [2019-12-27 03:42:20,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:20,298 INFO L93 Difference]: Finished difference Result 36423 states and 125388 transitions. [2019-12-27 03:42:20,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:42:20,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 03:42:20,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:20,348 INFO L225 Difference]: With dead ends: 36423 [2019-12-27 03:42:20,348 INFO L226 Difference]: Without dead ends: 28545 [2019-12-27 03:42:20,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:42:20,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28545 states. [2019-12-27 03:42:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28545 to 28545. [2019-12-27 03:42:20,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28545 states. [2019-12-27 03:42:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28545 states to 28545 states and 94430 transitions. [2019-12-27 03:42:20,828 INFO L78 Accepts]: Start accepts. Automaton has 28545 states and 94430 transitions. Word has length 19 [2019-12-27 03:42:20,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:20,828 INFO L462 AbstractCegarLoop]: Abstraction has 28545 states and 94430 transitions. [2019-12-27 03:42:20,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:42:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 28545 states and 94430 transitions. [2019-12-27 03:42:20,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:42:20,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:20,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:20,834 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-27 03:42:20,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:20,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1918737222, now seen corresponding path program 1 times [2019-12-27 03:42:20,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:20,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621738063] [2019-12-27 03:42:20,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:20,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:20,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621738063] [2019-12-27 03:42:20,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:20,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:42:20,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643004323] [2019-12-27 03:42:20,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:42:20,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:20,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:42:20,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:42:20,907 INFO L87 Difference]: Start difference. First operand 28545 states and 94430 transitions. Second operand 5 states. [2019-12-27 03:42:22,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:22,278 INFO L93 Difference]: Finished difference Result 37265 states and 121195 transitions. [2019-12-27 03:42:22,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:42:22,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 03:42:22,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:22,337 INFO L225 Difference]: With dead ends: 37265 [2019-12-27 03:42:22,337 INFO L226 Difference]: Without dead ends: 36963 [2019-12-27 03:42:22,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:42:22,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36963 states. [2019-12-27 03:42:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36963 to 29525. [2019-12-27 03:42:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29525 states. [2019-12-27 03:42:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29525 states to 29525 states and 97651 transitions. [2019-12-27 03:42:22,874 INFO L78 Accepts]: Start accepts. Automaton has 29525 states and 97651 transitions. Word has length 22 [2019-12-27 03:42:22,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:22,875 INFO L462 AbstractCegarLoop]: Abstraction has 29525 states and 97651 transitions. [2019-12-27 03:42:22,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:42:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 29525 states and 97651 transitions. [2019-12-27 03:42:22,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:42:22,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:22,881 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:22,881 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-27 03:42:22,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:22,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1233781658, now seen corresponding path program 1 times [2019-12-27 03:42:22,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:22,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817983254] [2019-12-27 03:42:22,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:22,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817983254] [2019-12-27 03:42:22,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:22,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:42:22,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829894085] [2019-12-27 03:42:22,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:42:22,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:22,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:42:22,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:42:22,952 INFO L87 Difference]: Start difference. First operand 29525 states and 97651 transitions. Second operand 5 states. [2019-12-27 03:42:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:23,421 INFO L93 Difference]: Finished difference Result 37362 states and 121787 transitions. [2019-12-27 03:42:23,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:42:23,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 03:42:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:23,479 INFO L225 Difference]: With dead ends: 37362 [2019-12-27 03:42:23,479 INFO L226 Difference]: Without dead ends: 36942 [2019-12-27 03:42:23,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:42:23,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36942 states. [2019-12-27 03:42:25,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36942 to 28461. [2019-12-27 03:42:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28461 states. [2019-12-27 03:42:25,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28461 states to 28461 states and 94342 transitions. [2019-12-27 03:42:25,941 INFO L78 Accepts]: Start accepts. Automaton has 28461 states and 94342 transitions. Word has length 22 [2019-12-27 03:42:25,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:25,942 INFO L462 AbstractCegarLoop]: Abstraction has 28461 states and 94342 transitions. [2019-12-27 03:42:25,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:42:25,942 INFO L276 IsEmpty]: Start isEmpty. Operand 28461 states and 94342 transitions. [2019-12-27 03:42:25,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:42:25,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:25,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:25,950 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-27 03:42:25,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:25,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1628067424, now seen corresponding path program 1 times [2019-12-27 03:42:25,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:25,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550060496] [2019-12-27 03:42:25,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:26,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550060496] [2019-12-27 03:42:26,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:26,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:42:26,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378891025] [2019-12-27 03:42:26,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:42:26,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:26,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:42:26,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:42:26,078 INFO L87 Difference]: Start difference. First operand 28461 states and 94342 transitions. Second operand 5 states. [2019-12-27 03:42:26,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:26,476 INFO L93 Difference]: Finished difference Result 28874 states and 95112 transitions. [2019-12-27 03:42:26,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:42:26,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 03:42:26,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:26,552 INFO L225 Difference]: With dead ends: 28874 [2019-12-27 03:42:26,553 INFO L226 Difference]: Without dead ends: 28434 [2019-12-27 03:42:26,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:42:26,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28434 states. [2019-12-27 03:42:26,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28434 to 28291. [2019-12-27 03:42:26,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28291 states. [2019-12-27 03:42:27,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28291 states to 28291 states and 93821 transitions. [2019-12-27 03:42:27,037 INFO L78 Accepts]: Start accepts. Automaton has 28291 states and 93821 transitions. Word has length 25 [2019-12-27 03:42:27,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:27,037 INFO L462 AbstractCegarLoop]: Abstraction has 28291 states and 93821 transitions. [2019-12-27 03:42:27,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:42:27,038 INFO L276 IsEmpty]: Start isEmpty. Operand 28291 states and 93821 transitions. [2019-12-27 03:42:27,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 03:42:27,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:27,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:27,051 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-27 03:42:27,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:27,051 INFO L82 PathProgramCache]: Analyzing trace with hash -126544367, now seen corresponding path program 1 times [2019-12-27 03:42:27,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:27,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775763368] [2019-12-27 03:42:27,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:27,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:27,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775763368] [2019-12-27 03:42:27,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:27,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:42:27,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326021741] [2019-12-27 03:42:27,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:42:27,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:27,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:42:27,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:42:27,106 INFO L87 Difference]: Start difference. First operand 28291 states and 93821 transitions. Second operand 5 states. [2019-12-27 03:42:27,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:27,517 INFO L93 Difference]: Finished difference Result 37145 states and 121294 transitions. [2019-12-27 03:42:27,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:42:27,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 03:42:27,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:27,574 INFO L225 Difference]: With dead ends: 37145 [2019-12-27 03:42:27,574 INFO L226 Difference]: Without dead ends: 36771 [2019-12-27 03:42:27,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:42:27,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36771 states. [2019-12-27 03:42:28,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36771 to 29755. [2019-12-27 03:42:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29755 states. [2019-12-27 03:42:28,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29755 states to 29755 states and 98514 transitions. [2019-12-27 03:42:28,401 INFO L78 Accepts]: Start accepts. Automaton has 29755 states and 98514 transitions. Word has length 28 [2019-12-27 03:42:28,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:28,402 INFO L462 AbstractCegarLoop]: Abstraction has 29755 states and 98514 transitions. [2019-12-27 03:42:28,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:42:28,402 INFO L276 IsEmpty]: Start isEmpty. Operand 29755 states and 98514 transitions. [2019-12-27 03:42:28,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 03:42:28,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:28,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:28,415 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-27 03:42:28,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:28,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1319845053, now seen corresponding path program 1 times [2019-12-27 03:42:28,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:28,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23944983] [2019-12-27 03:42:28,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:28,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23944983] [2019-12-27 03:42:28,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:28,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:42:28,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816676871] [2019-12-27 03:42:28,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:42:28,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:28,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:42:28,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:42:28,459 INFO L87 Difference]: Start difference. First operand 29755 states and 98514 transitions. Second operand 3 states. [2019-12-27 03:42:28,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:28,646 INFO L93 Difference]: Finished difference Result 38320 states and 126138 transitions. [2019-12-27 03:42:28,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:42:28,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-27 03:42:28,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:28,711 INFO L225 Difference]: With dead ends: 38320 [2019-12-27 03:42:28,712 INFO L226 Difference]: Without dead ends: 38320 [2019-12-27 03:42:28,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:42:28,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38320 states. [2019-12-27 03:42:29,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38320 to 30661. [2019-12-27 03:42:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30661 states. [2019-12-27 03:42:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30661 states to 30661 states and 100227 transitions. [2019-12-27 03:42:29,298 INFO L78 Accepts]: Start accepts. Automaton has 30661 states and 100227 transitions. Word has length 28 [2019-12-27 03:42:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:29,298 INFO L462 AbstractCegarLoop]: Abstraction has 30661 states and 100227 transitions. [2019-12-27 03:42:29,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:42:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 30661 states and 100227 transitions. [2019-12-27 03:42:29,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 03:42:29,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:29,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:29,314 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-27 03:42:29,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:29,315 INFO L82 PathProgramCache]: Analyzing trace with hash 234862090, now seen corresponding path program 1 times [2019-12-27 03:42:29,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:29,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884466810] [2019-12-27 03:42:29,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:29,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:29,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884466810] [2019-12-27 03:42:29,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:29,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:42:29,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707773844] [2019-12-27 03:42:29,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:42:29,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:29,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:42:29,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:42:29,390 INFO L87 Difference]: Start difference. First operand 30661 states and 100227 transitions. Second operand 5 states. [2019-12-27 03:42:30,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:30,276 INFO L93 Difference]: Finished difference Result 39205 states and 126499 transitions. [2019-12-27 03:42:30,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:42:30,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 03:42:30,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:30,344 INFO L225 Difference]: With dead ends: 39205 [2019-12-27 03:42:30,344 INFO L226 Difference]: Without dead ends: 38811 [2019-12-27 03:42:30,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:42:30,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38811 states. [2019-12-27 03:42:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38811 to 30894. [2019-12-27 03:42:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30894 states. [2019-12-27 03:42:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30894 states to 30894 states and 100767 transitions. [2019-12-27 03:42:30,942 INFO L78 Accepts]: Start accepts. Automaton has 30894 states and 100767 transitions. Word has length 29 [2019-12-27 03:42:30,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:30,942 INFO L462 AbstractCegarLoop]: Abstraction has 30894 states and 100767 transitions. [2019-12-27 03:42:30,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:42:30,942 INFO L276 IsEmpty]: Start isEmpty. Operand 30894 states and 100767 transitions. [2019-12-27 03:42:30,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 03:42:30,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:30,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:30,956 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-27 03:42:30,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:30,956 INFO L82 PathProgramCache]: Analyzing trace with hash 805904020, now seen corresponding path program 1 times [2019-12-27 03:42:30,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:30,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284142491] [2019-12-27 03:42:30,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:30,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284142491] [2019-12-27 03:42:30,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:30,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:42:30,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307043310] [2019-12-27 03:42:30,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:42:30,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:30,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:42:30,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:42:30,998 INFO L87 Difference]: Start difference. First operand 30894 states and 100767 transitions. Second operand 3 states. [2019-12-27 03:42:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:31,264 INFO L93 Difference]: Finished difference Result 49254 states and 162311 transitions. [2019-12-27 03:42:31,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:42:31,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-27 03:42:31,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:31,326 INFO L225 Difference]: With dead ends: 49254 [2019-12-27 03:42:31,326 INFO L226 Difference]: Without dead ends: 21429 [2019-12-27 03:42:31,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:42:31,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21429 states. [2019-12-27 03:42:31,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21429 to 20333. [2019-12-27 03:42:31,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20333 states. [2019-12-27 03:42:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20333 states to 20333 states and 67715 transitions. [2019-12-27 03:42:31,939 INFO L78 Accepts]: Start accepts. Automaton has 20333 states and 67715 transitions. Word has length 29 [2019-12-27 03:42:31,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:31,939 INFO L462 AbstractCegarLoop]: Abstraction has 20333 states and 67715 transitions. [2019-12-27 03:42:31,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:42:31,939 INFO L276 IsEmpty]: Start isEmpty. Operand 20333 states and 67715 transitions. [2019-12-27 03:42:31,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 03:42:31,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:31,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:31,953 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-27 03:42:31,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:31,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1673459084, now seen corresponding path program 1 times [2019-12-27 03:42:31,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:31,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956881328] [2019-12-27 03:42:31,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:32,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956881328] [2019-12-27 03:42:32,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:32,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:42:32,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324112351] [2019-12-27 03:42:32,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:42:32,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:32,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:42:32,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:42:32,021 INFO L87 Difference]: Start difference. First operand 20333 states and 67715 transitions. Second operand 5 states. [2019-12-27 03:42:32,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:32,798 INFO L93 Difference]: Finished difference Result 34767 states and 112990 transitions. [2019-12-27 03:42:32,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:42:32,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 03:42:32,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:32,862 INFO L225 Difference]: With dead ends: 34767 [2019-12-27 03:42:32,862 INFO L226 Difference]: Without dead ends: 34767 [2019-12-27 03:42:32,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:42:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34767 states. [2019-12-27 03:42:33,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34767 to 29090. [2019-12-27 03:42:33,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29090 states. [2019-12-27 03:42:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29090 states to 29090 states and 95089 transitions. [2019-12-27 03:42:33,412 INFO L78 Accepts]: Start accepts. Automaton has 29090 states and 95089 transitions. Word has length 30 [2019-12-27 03:42:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:33,412 INFO L462 AbstractCegarLoop]: Abstraction has 29090 states and 95089 transitions. [2019-12-27 03:42:33,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:42:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 29090 states and 95089 transitions. [2019-12-27 03:42:33,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 03:42:33,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:33,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:33,426 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-27 03:42:33,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:33,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1413309470, now seen corresponding path program 1 times [2019-12-27 03:42:33,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:33,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589170583] [2019-12-27 03:42:33,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:33,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-27 03:42:33,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589170583] [2019-12-27 03:42:33,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:33,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:42:33,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165278435] [2019-12-27 03:42:33,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:42:33,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:33,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:42:33,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:42:33,520 INFO L87 Difference]: Start difference. First operand 29090 states and 95089 transitions. Second operand 5 states. [2019-12-27 03:42:33,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:33,613 INFO L93 Difference]: Finished difference Result 13178 states and 39760 transitions. [2019-12-27 03:42:33,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:42:33,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-27 03:42:33,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:33,629 INFO L225 Difference]: With dead ends: 13178 [2019-12-27 03:42:33,629 INFO L226 Difference]: Without dead ends: 11110 [2019-12-27 03:42:33,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:42:33,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11110 states. [2019-12-27 03:42:33,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11110 to 10943. [2019-12-27 03:42:33,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10943 states. [2019-12-27 03:42:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10943 states to 10943 states and 32777 transitions. [2019-12-27 03:42:33,790 INFO L78 Accepts]: Start accepts. Automaton has 10943 states and 32777 transitions. Word has length 31 [2019-12-27 03:42:33,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:33,790 INFO L462 AbstractCegarLoop]: Abstraction has 10943 states and 32777 transitions. [2019-12-27 03:42:33,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:42:33,790 INFO L276 IsEmpty]: Start isEmpty. Operand 10943 states and 32777 transitions. [2019-12-27 03:42:33,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:42:33,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:33,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:33,802 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-27 03:42:33,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:33,802 INFO L82 PathProgramCache]: Analyzing trace with hash 483024013, now seen corresponding path program 1 times [2019-12-27 03:42:33,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:33,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760123393] [2019-12-27 03:42:33,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:33,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760123393] [2019-12-27 03:42:33,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:33,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:42:33,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795320679] [2019-12-27 03:42:33,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:42:33,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:33,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:42:33,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:42:33,888 INFO L87 Difference]: Start difference. First operand 10943 states and 32777 transitions. Second operand 6 states. [2019-12-27 03:42:34,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:34,009 INFO L93 Difference]: Finished difference Result 9884 states and 30061 transitions. [2019-12-27 03:42:34,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:42:34,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 03:42:34,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:34,027 INFO L225 Difference]: With dead ends: 9884 [2019-12-27 03:42:34,027 INFO L226 Difference]: Without dead ends: 9308 [2019-12-27 03:42:34,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:42:34,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9308 states. [2019-12-27 03:42:34,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9308 to 8756. [2019-12-27 03:42:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8756 states. [2019-12-27 03:42:34,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8756 states to 8756 states and 27336 transitions. [2019-12-27 03:42:34,204 INFO L78 Accepts]: Start accepts. Automaton has 8756 states and 27336 transitions. Word has length 40 [2019-12-27 03:42:34,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:34,204 INFO L462 AbstractCegarLoop]: Abstraction has 8756 states and 27336 transitions. [2019-12-27 03:42:34,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:42:34,205 INFO L276 IsEmpty]: Start isEmpty. Operand 8756 states and 27336 transitions. [2019-12-27 03:42:34,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:42:34,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:34,215 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-27 03:42:34,215 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-27 03:42:34,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:34,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1583482121, now seen corresponding path program 1 times [2019-12-27 03:42:34,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:34,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374972667] [2019-12-27 03:42:34,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:34,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374972667] [2019-12-27 03:42:34,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:34,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:42:34,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837440275] [2019-12-27 03:42:34,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:42:34,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:34,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:42:34,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:42:34,305 INFO L87 Difference]: Start difference. First operand 8756 states and 27336 transitions. Second operand 8 states. [2019-12-27 03:42:35,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:35,172 INFO L93 Difference]: Finished difference Result 19075 states and 58167 transitions. [2019-12-27 03:42:35,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 03:42:35,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 03:42:35,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:35,195 INFO L225 Difference]: With dead ends: 19075 [2019-12-27 03:42:35,196 INFO L226 Difference]: Without dead ends: 13560 [2019-12-27 03:42:35,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:42:35,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13560 states. [2019-12-27 03:42:35,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13560 to 10186. [2019-12-27 03:42:35,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10186 states. [2019-12-27 03:42:35,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10186 states to 10186 states and 31712 transitions. [2019-12-27 03:42:35,389 INFO L78 Accepts]: Start accepts. Automaton has 10186 states and 31712 transitions. Word has length 54 [2019-12-27 03:42:35,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:35,389 INFO L462 AbstractCegarLoop]: Abstraction has 10186 states and 31712 transitions. [2019-12-27 03:42:35,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:42:35,389 INFO L276 IsEmpty]: Start isEmpty. Operand 10186 states and 31712 transitions. [2019-12-27 03:42:35,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:42:35,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:35,406 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-27 03:42:35,406 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-27 03:42:35,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:35,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1582508777, now seen corresponding path program 2 times [2019-12-27 03:42:35,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:35,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674911094] [2019-12-27 03:42:35,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:35,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:35,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674911094] [2019-12-27 03:42:35,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:35,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:42:35,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481940803] [2019-12-27 03:42:35,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:42:35,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:35,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:42:35,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:42:35,489 INFO L87 Difference]: Start difference. First operand 10186 states and 31712 transitions. Second operand 7 states. [2019-12-27 03:42:35,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:35,778 INFO L93 Difference]: Finished difference Result 17931 states and 54609 transitions. [2019-12-27 03:42:35,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:42:35,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 03:42:35,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:35,799 INFO L225 Difference]: With dead ends: 17931 [2019-12-27 03:42:35,800 INFO L226 Difference]: Without dead ends: 12670 [2019-12-27 03:42:35,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:42:35,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12670 states. [2019-12-27 03:42:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12670 to 11824. [2019-12-27 03:42:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11824 states. [2019-12-27 03:42:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11824 states to 11824 states and 36336 transitions. [2019-12-27 03:42:36,005 INFO L78 Accepts]: Start accepts. Automaton has 11824 states and 36336 transitions. Word has length 54 [2019-12-27 03:42:36,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:36,006 INFO L462 AbstractCegarLoop]: Abstraction has 11824 states and 36336 transitions. [2019-12-27 03:42:36,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:42:36,006 INFO L276 IsEmpty]: Start isEmpty. Operand 11824 states and 36336 transitions. [2019-12-27 03:42:36,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:42:36,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:36,020 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-27 03:42:36,020 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-27 03:42:36,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:36,021 INFO L82 PathProgramCache]: Analyzing trace with hash -788857531, now seen corresponding path program 3 times [2019-12-27 03:42:36,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:36,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6818362] [2019-12-27 03:42:36,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:36,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6818362] [2019-12-27 03:42:36,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:36,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:42:36,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591600504] [2019-12-27 03:42:36,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:42:36,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:36,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:42:36,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:42:36,103 INFO L87 Difference]: Start difference. First operand 11824 states and 36336 transitions. Second operand 7 states. [2019-12-27 03:42:36,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:36,498 INFO L93 Difference]: Finished difference Result 19676 states and 59676 transitions. [2019-12-27 03:42:36,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:42:36,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 03:42:36,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:36,528 INFO L225 Difference]: With dead ends: 19676 [2019-12-27 03:42:36,528 INFO L226 Difference]: Without dead ends: 14577 [2019-12-27 03:42:36,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:42:36,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14577 states. [2019-12-27 03:42:36,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14577 to 11969. [2019-12-27 03:42:36,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11969 states. [2019-12-27 03:42:36,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11969 states to 11969 states and 36790 transitions. [2019-12-27 03:42:36,909 INFO L78 Accepts]: Start accepts. Automaton has 11969 states and 36790 transitions. Word has length 54 [2019-12-27 03:42:36,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:36,909 INFO L462 AbstractCegarLoop]: Abstraction has 11969 states and 36790 transitions. [2019-12-27 03:42:36,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:42:36,910 INFO L276 IsEmpty]: Start isEmpty. Operand 11969 states and 36790 transitions. [2019-12-27 03:42:36,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:42:36,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:36,932 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-27 03:42:36,932 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-27 03:42:36,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:36,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1632154587, now seen corresponding path program 4 times [2019-12-27 03:42:36,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:36,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716126520] [2019-12-27 03:42:36,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:37,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:37,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716126520] [2019-12-27 03:42:37,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:37,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:42:37,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081441938] [2019-12-27 03:42:37,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:42:37,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:37,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:42:37,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:42:37,049 INFO L87 Difference]: Start difference. First operand 11969 states and 36790 transitions. Second operand 9 states. [2019-12-27 03:42:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:38,038 INFO L93 Difference]: Finished difference Result 22917 states and 69058 transitions. [2019-12-27 03:42:38,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 03:42:38,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 03:42:38,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:38,074 INFO L225 Difference]: With dead ends: 22917 [2019-12-27 03:42:38,074 INFO L226 Difference]: Without dead ends: 20954 [2019-12-27 03:42:38,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2019-12-27 03:42:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20954 states. [2019-12-27 03:42:38,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20954 to 11804. [2019-12-27 03:42:38,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11804 states. [2019-12-27 03:42:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11804 states to 11804 states and 36294 transitions. [2019-12-27 03:42:38,401 INFO L78 Accepts]: Start accepts. Automaton has 11804 states and 36294 transitions. Word has length 54 [2019-12-27 03:42:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:38,401 INFO L462 AbstractCegarLoop]: Abstraction has 11804 states and 36294 transitions. [2019-12-27 03:42:38,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:42:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 11804 states and 36294 transitions. [2019-12-27 03:42:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:42:38,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:38,417 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-27 03:42:38,417 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-27 03:42:38,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:38,417 INFO L82 PathProgramCache]: Analyzing trace with hash -152017057, now seen corresponding path program 5 times [2019-12-27 03:42:38,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:38,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851159307] [2019-12-27 03:42:38,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:38,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:38,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851159307] [2019-12-27 03:42:38,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:38,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:42:38,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697900255] [2019-12-27 03:42:38,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:42:38,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:38,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:42:38,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:42:38,526 INFO L87 Difference]: Start difference. First operand 11804 states and 36294 transitions. Second operand 9 states. [2019-12-27 03:42:39,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:39,526 INFO L93 Difference]: Finished difference Result 30197 states and 91095 transitions. [2019-12-27 03:42:39,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 03:42:39,526 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 03:42:39,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:39,566 INFO L225 Difference]: With dead ends: 30197 [2019-12-27 03:42:39,566 INFO L226 Difference]: Without dead ends: 28317 [2019-12-27 03:42:39,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:42:39,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28317 states. [2019-12-27 03:42:39,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28317 to 11832. [2019-12-27 03:42:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11832 states. [2019-12-27 03:42:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11832 states to 11832 states and 36454 transitions. [2019-12-27 03:42:39,842 INFO L78 Accepts]: Start accepts. Automaton has 11832 states and 36454 transitions. Word has length 54 [2019-12-27 03:42:39,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:39,842 INFO L462 AbstractCegarLoop]: Abstraction has 11832 states and 36454 transitions. [2019-12-27 03:42:39,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:42:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 11832 states and 36454 transitions. [2019-12-27 03:42:39,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:42:39,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:39,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:39,855 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:39,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:39,855 INFO L82 PathProgramCache]: Analyzing trace with hash -380308885, now seen corresponding path program 6 times [2019-12-27 03:42:39,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:39,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899754218] [2019-12-27 03:42:39,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:39,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:39,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899754218] [2019-12-27 03:42:39,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:39,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:42:39,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641850271] [2019-12-27 03:42:39,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:42:39,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:39,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:42:39,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:42:39,961 INFO L87 Difference]: Start difference. First operand 11832 states and 36454 transitions. Second operand 7 states. [2019-12-27 03:42:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:40,879 INFO L93 Difference]: Finished difference Result 22305 states and 67261 transitions. [2019-12-27 03:42:40,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 03:42:40,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 03:42:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:40,911 INFO L225 Difference]: With dead ends: 22305 [2019-12-27 03:42:40,911 INFO L226 Difference]: Without dead ends: 22195 [2019-12-27 03:42:40,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:42:40,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22195 states. [2019-12-27 03:42:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22195 to 15211. [2019-12-27 03:42:41,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15211 states. [2019-12-27 03:42:41,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15211 states to 15211 states and 46140 transitions. [2019-12-27 03:42:41,180 INFO L78 Accepts]: Start accepts. Automaton has 15211 states and 46140 transitions. Word has length 54 [2019-12-27 03:42:41,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:41,181 INFO L462 AbstractCegarLoop]: Abstraction has 15211 states and 46140 transitions. [2019-12-27 03:42:41,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:42:41,181 INFO L276 IsEmpty]: Start isEmpty. Operand 15211 states and 46140 transitions. [2019-12-27 03:42:41,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:42:41,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:41,197 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-27 03:42:41,197 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:41,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:41,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1744394997, now seen corresponding path program 7 times [2019-12-27 03:42:41,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:41,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017576889] [2019-12-27 03:42:41,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:41,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:41,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017576889] [2019-12-27 03:42:41,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:41,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:42:41,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658309956] [2019-12-27 03:42:41,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:42:41,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:41,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:42:41,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:42:41,282 INFO L87 Difference]: Start difference. First operand 15211 states and 46140 transitions. Second operand 6 states. [2019-12-27 03:42:41,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:41,998 INFO L93 Difference]: Finished difference Result 18215 states and 54331 transitions. [2019-12-27 03:42:41,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:42:41,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 03:42:41,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:42,023 INFO L225 Difference]: With dead ends: 18215 [2019-12-27 03:42:42,024 INFO L226 Difference]: Without dead ends: 18215 [2019-12-27 03:42:42,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:42:42,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18215 states. [2019-12-27 03:42:42,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18215 to 15031. [2019-12-27 03:42:42,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15031 states. [2019-12-27 03:42:42,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15031 states to 15031 states and 45630 transitions. [2019-12-27 03:42:42,242 INFO L78 Accepts]: Start accepts. Automaton has 15031 states and 45630 transitions. Word has length 54 [2019-12-27 03:42:42,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:42,242 INFO L462 AbstractCegarLoop]: Abstraction has 15031 states and 45630 transitions. [2019-12-27 03:42:42,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:42:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand 15031 states and 45630 transitions. [2019-12-27 03:42:42,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:42:42,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:42,257 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-27 03:42:42,257 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:42,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:42,257 INFO L82 PathProgramCache]: Analyzing trace with hash -202798091, now seen corresponding path program 8 times [2019-12-27 03:42:42,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:42,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907485143] [2019-12-27 03:42:42,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:42,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907485143] [2019-12-27 03:42:42,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:42,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:42:42,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719266415] [2019-12-27 03:42:42,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:42:42,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:42,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:42:42,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:42:42,344 INFO L87 Difference]: Start difference. First operand 15031 states and 45630 transitions. Second operand 3 states. [2019-12-27 03:42:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:42,406 INFO L93 Difference]: Finished difference Result 15029 states and 45625 transitions. [2019-12-27 03:42:42,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:42:42,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 03:42:42,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:42,433 INFO L225 Difference]: With dead ends: 15029 [2019-12-27 03:42:42,433 INFO L226 Difference]: Without dead ends: 15029 [2019-12-27 03:42:42,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:42:42,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15029 states. [2019-12-27 03:42:42,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15029 to 13184. [2019-12-27 03:42:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13184 states. [2019-12-27 03:42:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13184 states to 13184 states and 40519 transitions. [2019-12-27 03:42:42,680 INFO L78 Accepts]: Start accepts. Automaton has 13184 states and 40519 transitions. Word has length 54 [2019-12-27 03:42:42,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:42,680 INFO L462 AbstractCegarLoop]: Abstraction has 13184 states and 40519 transitions. [2019-12-27 03:42:42,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:42:42,680 INFO L276 IsEmpty]: Start isEmpty. Operand 13184 states and 40519 transitions. [2019-12-27 03:42:42,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:42:42,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:42,694 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-27 03:42:42,695 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:42,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:42,695 INFO L82 PathProgramCache]: Analyzing trace with hash -655607069, now seen corresponding path program 1 times [2019-12-27 03:42:42,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:42,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725512270] [2019-12-27 03:42:42,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:42,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725512270] [2019-12-27 03:42:42,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:42,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:42:42,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883210976] [2019-12-27 03:42:42,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:42:42,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:42,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:42:42,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:42:42,747 INFO L87 Difference]: Start difference. First operand 13184 states and 40519 transitions. Second operand 3 states. [2019-12-27 03:42:42,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:42,795 INFO L93 Difference]: Finished difference Result 8648 states and 26253 transitions. [2019-12-27 03:42:42,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:42:42,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 03:42:42,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:42,812 INFO L225 Difference]: With dead ends: 8648 [2019-12-27 03:42:42,812 INFO L226 Difference]: Without dead ends: 8648 [2019-12-27 03:42:42,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:42:42,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8648 states. [2019-12-27 03:42:42,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8648 to 8482. [2019-12-27 03:42:42,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8482 states. [2019-12-27 03:42:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8482 states to 8482 states and 25789 transitions. [2019-12-27 03:42:42,979 INFO L78 Accepts]: Start accepts. Automaton has 8482 states and 25789 transitions. Word has length 55 [2019-12-27 03:42:42,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:42,980 INFO L462 AbstractCegarLoop]: Abstraction has 8482 states and 25789 transitions. [2019-12-27 03:42:42,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:42:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 8482 states and 25789 transitions. [2019-12-27 03:42:42,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:42:42,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:42,999 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:42,999 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:42,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:42,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1033271685, now seen corresponding path program 1 times [2019-12-27 03:42:43,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:43,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10833114] [2019-12-27 03:42:43,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:43,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10833114] [2019-12-27 03:42:43,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:43,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:42:43,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058742272] [2019-12-27 03:42:43,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:42:43,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:43,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:42:43,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:42:43,223 INFO L87 Difference]: Start difference. First operand 8482 states and 25789 transitions. Second operand 11 states. [2019-12-27 03:42:44,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:44,114 INFO L93 Difference]: Finished difference Result 13435 states and 40255 transitions. [2019-12-27 03:42:44,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 03:42:44,115 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 03:42:44,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:44,128 INFO L225 Difference]: With dead ends: 13435 [2019-12-27 03:42:44,128 INFO L226 Difference]: Without dead ends: 9328 [2019-12-27 03:42:44,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-12-27 03:42:44,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9328 states. [2019-12-27 03:42:44,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9328 to 8530. [2019-12-27 03:42:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8530 states. [2019-12-27 03:42:44,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8530 states to 8530 states and 25515 transitions. [2019-12-27 03:42:44,259 INFO L78 Accepts]: Start accepts. Automaton has 8530 states and 25515 transitions. Word has length 56 [2019-12-27 03:42:44,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:44,259 INFO L462 AbstractCegarLoop]: Abstraction has 8530 states and 25515 transitions. [2019-12-27 03:42:44,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:42:44,259 INFO L276 IsEmpty]: Start isEmpty. Operand 8530 states and 25515 transitions. [2019-12-27 03:42:44,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:42:44,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:44,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:44,268 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:44,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:44,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1822247207, now seen corresponding path program 2 times [2019-12-27 03:42:44,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:44,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765156660] [2019-12-27 03:42:44,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:44,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:44,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765156660] [2019-12-27 03:42:44,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:44,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:42:44,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985051356] [2019-12-27 03:42:44,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:42:44,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:44,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:42:44,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:42:44,458 INFO L87 Difference]: Start difference. First operand 8530 states and 25515 transitions. Second operand 12 states. [2019-12-27 03:42:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:45,251 INFO L93 Difference]: Finished difference Result 9730 states and 28516 transitions. [2019-12-27 03:42:45,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:42:45,251 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 03:42:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:45,265 INFO L225 Difference]: With dead ends: 9730 [2019-12-27 03:42:45,265 INFO L226 Difference]: Without dead ends: 9132 [2019-12-27 03:42:45,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 03:42:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9132 states. [2019-12-27 03:42:45,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9132 to 8212. [2019-12-27 03:42:45,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8212 states. [2019-12-27 03:42:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8212 states to 8212 states and 24651 transitions. [2019-12-27 03:42:45,449 INFO L78 Accepts]: Start accepts. Automaton has 8212 states and 24651 transitions. Word has length 56 [2019-12-27 03:42:45,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:45,449 INFO L462 AbstractCegarLoop]: Abstraction has 8212 states and 24651 transitions. [2019-12-27 03:42:45,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:42:45,449 INFO L276 IsEmpty]: Start isEmpty. Operand 8212 states and 24651 transitions. [2019-12-27 03:42:45,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:42:45,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:45,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:45,458 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:45,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:45,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1734091201, now seen corresponding path program 3 times [2019-12-27 03:42:45,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:45,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469460749] [2019-12-27 03:42:45,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:42:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:42:45,567 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:42:45,567 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:42:45,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_cnt~0_95) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2082~0.base_30| 4)) (= 0 v_~x~0_240) (= v_~x$r_buff1_thd0~0_309 0) (= v_~weak$$choice2~0_201 0) (= 0 v_~x$w_buff1_used~0_624) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~y~0_226 0) (= v_~z~0_95 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2082~0.base_30|)) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t2082~0.base_30| 1)) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$r_buff0_thd3~0_148) (= 0 v_~x$w_buff1~0_328) (= |v_ULTIMATE.start_main_~#t2082~0.offset_22| 0) (= 0 v_~x$r_buff0_thd2~0_323) (= v_~x$flush_delayed~0_62 0) (= 0 v_~x$w_buff0_used~0_913) (= 0 |v_#NULL.base_4|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_362 0) (= 0 v_~weak$$choice0~0_37) (= v_~main$tmp_guard1~0_53 0) (= v_~main$tmp_guard0~0_42 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= 0 v_~__unbuffered_p2_EAX~0_68) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2082~0.base_30| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2082~0.base_30|) |v_ULTIMATE.start_main_~#t2082~0.offset_22| 0)) |v_#memory_int_23|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2082~0.base_30|) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_267) (= v_~x$mem_tmp~0_40 0) (= v_~x$r_buff1_thd1~0_428 0) (= 0 v_~x$w_buff0~0_403) (= v_~x$r_buff0_thd0~0_156 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_403, ULTIMATE.start_main_~#t2084~0.base=|v_ULTIMATE.start_main_~#t2084~0.base_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_62, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_428, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_148, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_~#t2084~0.offset=|v_ULTIMATE.start_main_~#t2084~0.offset_14|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_68, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~x$w_buff1~0=v_~x$w_buff1~0_328, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_624, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ULTIMATE.start_main_~#t2083~0.offset=|v_ULTIMATE.start_main_~#t2083~0.offset_22|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t2082~0.offset=|v_ULTIMATE.start_main_~#t2082~0.offset_22|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~x~0=v_~x~0_240, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_362, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_114|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_267, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_53, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2082~0.base=|v_ULTIMATE.start_main_~#t2082~0.base_30|, ~y~0=v_~y~0_226, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ULTIMATE.start_main_~#t2083~0.base=|v_ULTIMATE.start_main_~#t2083~0.base_31|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_309, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_323, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_62|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_201, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2084~0.base, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2084~0.offset, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2082~0.base, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2083~0.offset, ULTIMATE.start_main_~#t2083~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t2082~0.offset, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 03:42:45,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2083~0.base_10| 1)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2083~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t2083~0.base_10| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2083~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t2083~0.offset_9| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2083~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2083~0.base_10|) |v_ULTIMATE.start_main_~#t2083~0.offset_9| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2083~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2083~0.base=|v_ULTIMATE.start_main_~#t2083~0.base_10|, ULTIMATE.start_main_~#t2083~0.offset=|v_ULTIMATE.start_main_~#t2083~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2083~0.base, ULTIMATE.start_main_~#t2083~0.offset] because there is no mapped edge [2019-12-27 03:42:45,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_19) (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= 0 (mod v_~x$w_buff1_used~0_52 256)) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff1_used~0_52 v_~x$w_buff0_used~0_98) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0_used~0_97) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~x$w_buff1~0=v_~x$w_buff1~0_19, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 03:42:45,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2084~0.base_11|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2084~0.base_11|) (= |v_ULTIMATE.start_main_~#t2084~0.offset_10| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2084~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2084~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2084~0.base_11|) |v_ULTIMATE.start_main_~#t2084~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2084~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2084~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2084~0.offset=|v_ULTIMATE.start_main_~#t2084~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2084~0.base=|v_ULTIMATE.start_main_~#t2084~0.base_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2084~0.offset, ULTIMATE.start_main_~#t2084~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 03:42:45,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-521236952 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-521236952 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-521236952 |P2Thread1of1ForFork1_#t~ite32_Out-521236952|)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-521236952 |P2Thread1of1ForFork1_#t~ite32_Out-521236952|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-521236952, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-521236952, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-521236952, ~x~0=~x~0_In-521236952} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-521236952|, ~x$w_buff1~0=~x$w_buff1~0_In-521236952, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-521236952, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-521236952, ~x~0=~x~0_In-521236952} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 03:42:45,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_10|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_10|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 03:42:45,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In1291470567 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1291470567 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1291470567|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In1291470567 |P2Thread1of1ForFork1_#t~ite34_Out1291470567|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1291470567, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1291470567} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1291470567|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1291470567, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1291470567} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 03:42:45,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1006295709 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1006295709 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out1006295709| ~x$w_buff0_used~0_In1006295709)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out1006295709| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1006295709, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1006295709} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1006295709, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1006295709|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1006295709} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 03:42:45,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-353572759 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-353572759 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-353572759 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-353572759 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-353572759|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-353572759 |P1Thread1of1ForFork0_#t~ite29_Out-353572759|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-353572759, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-353572759, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-353572759, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-353572759} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-353572759, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-353572759, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-353572759, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-353572759|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-353572759} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 03:42:45,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-849518812 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-849518812 256)))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out-849518812 0)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In-849518812 ~x$r_buff0_thd2~0_Out-849518812)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-849518812, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-849518812} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-849518812|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-849518812, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-849518812} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 03:42:45,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-587527253 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-587527253 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-587527253 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-587527253 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-587527253| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out-587527253| ~x$r_buff1_thd2~0_In-587527253) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-587527253, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-587527253, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-587527253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-587527253} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-587527253|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-587527253, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-587527253, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-587527253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-587527253} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 03:42:45,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 03:42:45,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1950474941 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite9_Out-1950474941| |P0Thread1of1ForFork2_#t~ite8_Out-1950474941|) (= ~x$w_buff0~0_In-1950474941 |P0Thread1of1ForFork2_#t~ite8_Out-1950474941|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1950474941 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In-1950474941 256)) .cse0) (= 0 (mod ~x$w_buff0_used~0_In-1950474941 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-1950474941 256)) .cse0))) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite8_In-1950474941| |P0Thread1of1ForFork2_#t~ite8_Out-1950474941|) (= |P0Thread1of1ForFork2_#t~ite9_Out-1950474941| ~x$w_buff0~0_In-1950474941) (not .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1950474941, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1950474941, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-1950474941|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1950474941, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1950474941, ~weak$$choice2~0=~weak$$choice2~0_In-1950474941, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1950474941} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1950474941, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1950474941, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1950474941|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1950474941, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-1950474941|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1950474941, ~weak$$choice2~0=~weak$$choice2~0_In-1950474941, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1950474941} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 03:42:45,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2126291195 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-2126291195 256))) (.cse2 (= (mod ~x$r_buff1_thd3~0_In-2126291195 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-2126291195 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-2126291195 |P2Thread1of1ForFork1_#t~ite35_Out-2126291195|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-2126291195|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2126291195, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2126291195, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2126291195, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2126291195} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-2126291195|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2126291195, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2126291195, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2126291195, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2126291195} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 03:42:45,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-802994113 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-802994113 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-802994113| 0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-802994113| ~x$r_buff0_thd3~0_In-802994113) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-802994113, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-802994113} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-802994113|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-802994113, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-802994113} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 03:42:45,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1709342531 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1709342531 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1709342531 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In1709342531 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out1709342531| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite37_Out1709342531| ~x$r_buff1_thd3~0_In1709342531) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1709342531, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1709342531, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1709342531, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1709342531} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1709342531|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1709342531, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1709342531, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1709342531, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1709342531} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 03:42:45,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork1_#t~ite37_30|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 03:42:45,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-581468406 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_Out-581468406| |P0Thread1of1ForFork2_#t~ite18_Out-581468406|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-581468406 256) 0))) (or (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-581468406 256))) (= 0 (mod ~x$w_buff0_used~0_In-581468406 256)) (and .cse0 (= (mod ~x$r_buff1_thd1~0_In-581468406 256) 0)))) .cse1 (= ~x$w_buff1_used~0_In-581468406 |P0Thread1of1ForFork2_#t~ite17_Out-581468406|)) (and (= ~x$w_buff1_used~0_In-581468406 |P0Thread1of1ForFork2_#t~ite18_Out-581468406|) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite17_In-581468406| |P0Thread1of1ForFork2_#t~ite17_Out-581468406|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-581468406, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-581468406|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-581468406, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-581468406, ~weak$$choice2~0=~weak$$choice2~0_In-581468406, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-581468406} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-581468406, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-581468406|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-581468406|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-581468406, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-581468406, ~weak$$choice2~0=~weak$$choice2~0_In-581468406, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-581468406} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 03:42:45,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_101 v_~x$r_buff0_thd1~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_100, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 03:42:45,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-148506690 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_Out-148506690| |P0Thread1of1ForFork2_#t~ite24_Out-148506690|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-148506690 256)))) (or (and (= (mod ~x$r_buff1_thd1~0_In-148506690 256) 0) .cse0) (= (mod ~x$w_buff0_used~0_In-148506690 256) 0) (and (= (mod ~x$w_buff1_used~0_In-148506690 256) 0) .cse0))) (= |P0Thread1of1ForFork2_#t~ite23_Out-148506690| ~x$r_buff1_thd1~0_In-148506690) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite24_Out-148506690| ~x$r_buff1_thd1~0_In-148506690) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite23_In-148506690| |P0Thread1of1ForFork2_#t~ite23_Out-148506690|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-148506690, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-148506690, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-148506690, ~weak$$choice2~0=~weak$$choice2~0_In-148506690, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-148506690|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-148506690} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-148506690, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-148506690, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-148506690, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-148506690|, ~weak$$choice2~0=~weak$$choice2~0_In-148506690, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-148506690|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-148506690} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-27 03:42:45,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x~0_34 v_~x$mem_tmp~0_10) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_34} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 03:42:45,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_158 256)) (= 0 (mod v_~x$r_buff0_thd0~0_26 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 03:42:45,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In975315056 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In975315056 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In975315056 |ULTIMATE.start_main_#t~ite41_Out975315056|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out975315056| ~x$w_buff1~0_In975315056)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In975315056, ~x$w_buff1_used~0=~x$w_buff1_used~0_In975315056, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In975315056, ~x~0=~x~0_In975315056} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out975315056|, ~x$w_buff1~0=~x$w_buff1~0_In975315056, ~x$w_buff1_used~0=~x$w_buff1_used~0_In975315056, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In975315056, ~x~0=~x~0_In975315056} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 03:42:45,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 03:42:45,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In2041130167 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In2041130167 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out2041130167|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In2041130167 |ULTIMATE.start_main_#t~ite43_Out2041130167|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2041130167, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2041130167} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2041130167, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2041130167|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2041130167} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 03:42:45,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-951275344 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-951275344 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-951275344 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-951275344 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-951275344| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-951275344 |ULTIMATE.start_main_#t~ite44_Out-951275344|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-951275344, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-951275344, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-951275344, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-951275344} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-951275344, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-951275344, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-951275344, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-951275344|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-951275344} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 03:42:45,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-473149893 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-473149893 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-473149893|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-473149893| ~x$r_buff0_thd0~0_In-473149893)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-473149893, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-473149893} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-473149893, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-473149893|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-473149893} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 03:42:45,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In376567630 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In376567630 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In376567630 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In376567630 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In376567630 |ULTIMATE.start_main_#t~ite46_Out376567630|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite46_Out376567630|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In376567630, ~x$w_buff1_used~0=~x$w_buff1_used~0_In376567630, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In376567630, ~x$w_buff0_used~0=~x$w_buff0_used~0_In376567630} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In376567630, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out376567630|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In376567630, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In376567630, ~x$w_buff0_used~0=~x$w_buff0_used~0_In376567630} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 03:42:45,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_60 2) (= v_~main$tmp_guard1~0_25 0) (= 1 v_~__unbuffered_p2_EAX~0_35) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= v_~x$r_buff1_thd0~0_277 |v_ULTIMATE.start_main_#t~ite46_60|) (= 0 v_~__unbuffered_p0_EAX~0_54) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_25 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_59|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_277, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:42:45,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:42:45 BasicIcfg [2019-12-27 03:42:45,679 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:42:45,681 INFO L168 Benchmark]: Toolchain (without parser) took 161781.45 ms. Allocated memory was 138.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.1 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 562.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:42:45,682 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 03:42:45,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 859.76 ms. Allocated memory was 138.9 MB in the beginning and 201.3 MB in the end (delta: 62.4 MB). Free memory was 101.7 MB in the beginning and 153.6 MB in the end (delta: -51.8 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-27 03:42:45,688 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.07 ms. Allocated memory is still 201.3 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:42:45,688 INFO L168 Benchmark]: Boogie Preprocessor took 39.82 ms. Allocated memory is still 201.3 MB. Free memory was 150.9 MB in the beginning and 148.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:42:45,688 INFO L168 Benchmark]: RCFGBuilder took 969.97 ms. Allocated memory is still 201.3 MB. Free memory was 148.3 MB in the beginning and 102.1 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-27 03:42:45,689 INFO L168 Benchmark]: TraceAbstraction took 159836.84 ms. Allocated memory was 201.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.4 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 499.5 MB. Max. memory is 7.1 GB. [2019-12-27 03:42:45,693 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.51 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 859.76 ms. Allocated memory was 138.9 MB in the beginning and 201.3 MB in the end (delta: 62.4 MB). Free memory was 101.7 MB in the beginning and 153.6 MB in the end (delta: -51.8 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.07 ms. Allocated memory is still 201.3 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.82 ms. Allocated memory is still 201.3 MB. Free memory was 150.9 MB in the beginning and 148.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 969.97 ms. Allocated memory is still 201.3 MB. Free memory was 148.3 MB in the beginning and 102.1 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 159836.84 ms. Allocated memory was 201.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.4 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 499.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 6709 VarBasedMoverChecksPositive, 292 VarBasedMoverChecksNegative, 116 SemBasedMoverChecksPositive, 259 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 66094 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2082, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2083, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2084, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 159.5s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 57.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4761 SDtfs, 7108 SDslu, 12706 SDs, 0 SdLazy, 5954 SolverSat, 334 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 44 SyntacticMatches, 14 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161868occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 81.0s AutomataMinimizationTime, 30 MinimizatonAttempts, 203527 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1068 NumberOfCodeBlocks, 1068 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 982 ConstructedInterpolants, 0 QuantifiedInterpolants, 165754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...