/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:34:49,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:34:49,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:34:49,960 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:34:49,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:34:49,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:34:49,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:34:49,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:34:49,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:34:49,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:34:49,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:34:49,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:34:49,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:34:49,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:34:49,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:34:49,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:34:49,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:34:49,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:34:49,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:34:49,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:34:49,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:34:49,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:34:49,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:34:49,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:34:49,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:34:49,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:34:49,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:34:49,998 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:34:49,998 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:34:49,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:34:49,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:34:50,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:34:50,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:34:50,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:34:50,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:34:50,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:34:50,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:34:50,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:34:50,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:34:50,005 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:34:50,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:34:50,006 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:34:50,020 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:34:50,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:34:50,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:34:50,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:34:50,022 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:34:50,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:34:50,023 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:34:50,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:34:50,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:34:50,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:34:50,023 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:34:50,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:34:50,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:34:50,024 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:34:50,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:34:50,024 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:34:50,025 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:34:50,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:34:50,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:34:50,025 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:34:50,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:34:50,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:34:50,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:34:50,026 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:34:50,026 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:34:50,026 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:34:50,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:34:50,027 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:34:50,027 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:34:50,027 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:34:50,285 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:34:50,303 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:34:50,308 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:34:50,309 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:34:50,310 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:34:50,311 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i [2019-12-18 12:34:50,386 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb212ac78/1664369fc69d400c83809774573a16cb/FLAG5093a8882 [2019-12-18 12:34:50,989 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:34:50,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i [2019-12-18 12:34:51,014 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb212ac78/1664369fc69d400c83809774573a16cb/FLAG5093a8882 [2019-12-18 12:34:51,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb212ac78/1664369fc69d400c83809774573a16cb [2019-12-18 12:34:51,253 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:34:51,256 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:34:51,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:34:51,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:34:51,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:34:51,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:34:51" (1/1) ... [2019-12-18 12:34:51,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9ec5a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:51, skipping insertion in model container [2019-12-18 12:34:51,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:34:51" (1/1) ... [2019-12-18 12:34:51,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:34:51,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:34:51,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:34:51,805 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:34:51,871 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:34:51,976 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:34:51,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:51 WrapperNode [2019-12-18 12:34:51,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:34:51,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:34:51,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:34:51,978 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:34:51,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:51" (1/1) ... [2019-12-18 12:34:52,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:51" (1/1) ... [2019-12-18 12:34:52,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:34:52,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:34:52,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:34:52,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:34:52,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:51" (1/1) ... [2019-12-18 12:34:52,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:51" (1/1) ... [2019-12-18 12:34:52,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:51" (1/1) ... [2019-12-18 12:34:52,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:51" (1/1) ... [2019-12-18 12:34:52,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:51" (1/1) ... [2019-12-18 12:34:52,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:51" (1/1) ... [2019-12-18 12:34:52,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:51" (1/1) ... [2019-12-18 12:34:52,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:34:52,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:34:52,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:34:52,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:34:52,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:34:52,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:34:52,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:34:52,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:34:52,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:34:52,243 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:34:52,244 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:34:52,244 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:34:52,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:34:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:34:52,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:34:52,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:34:52,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:34:52,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:34:52,249 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:34:53,065 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:34:53,066 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:34:53,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:34:53 BoogieIcfgContainer [2019-12-18 12:34:53,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:34:53,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:34:53,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:34:53,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:34:53,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:34:51" (1/3) ... [2019-12-18 12:34:53,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a41fe59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:34:53, skipping insertion in model container [2019-12-18 12:34:53,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:51" (2/3) ... [2019-12-18 12:34:53,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a41fe59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:34:53, skipping insertion in model container [2019-12-18 12:34:53,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:34:53" (3/3) ... [2019-12-18 12:34:53,080 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_rmo.opt.i [2019-12-18 12:34:53,091 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:34:53,091 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:34:53,102 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:34:53,103 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:34:53,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,157 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,157 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,181 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,181 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,182 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,182 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,182 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,205 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,205 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,213 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,214 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,214 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,219 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,220 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,224 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,225 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:53,244 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:34:53,264 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:34:53,265 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:34:53,265 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:34:53,265 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:34:53,265 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:34:53,265 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:34:53,265 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:34:53,266 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:34:53,282 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-18 12:34:53,284 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 12:34:53,364 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 12:34:53,365 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:34:53,382 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 12:34:53,409 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 12:34:53,451 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 12:34:53,452 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:34:53,460 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 12:34:53,480 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 12:34:53,481 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:34:54,362 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-12-18 12:34:58,593 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-12-18 12:34:58,790 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 12:34:58,916 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 12:34:59,303 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 12:34:59,422 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 12:34:59,453 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75392 [2019-12-18 12:34:59,453 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 12:34:59,457 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 91 transitions [2019-12-18 12:35:10,403 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86190 states. [2019-12-18 12:35:10,405 INFO L276 IsEmpty]: Start isEmpty. Operand 86190 states. [2019-12-18 12:35:10,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 12:35:10,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:10,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 12:35:10,413 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:10,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:10,419 INFO L82 PathProgramCache]: Analyzing trace with hash 802149997, now seen corresponding path program 1 times [2019-12-18 12:35:10,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:10,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187170587] [2019-12-18 12:35:10,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:10,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187170587] [2019-12-18 12:35:10,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:10,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:35:10,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10579027] [2019-12-18 12:35:10,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:35:10,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:10,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:35:10,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:10,714 INFO L87 Difference]: Start difference. First operand 86190 states. Second operand 3 states. [2019-12-18 12:35:13,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:13,467 INFO L93 Difference]: Finished difference Result 85100 states and 365324 transitions. [2019-12-18 12:35:13,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:35:13,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 12:35:13,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:14,050 INFO L225 Difference]: With dead ends: 85100 [2019-12-18 12:35:14,051 INFO L226 Difference]: Without dead ends: 79822 [2019-12-18 12:35:14,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:17,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79822 states. [2019-12-18 12:35:21,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79822 to 79822. [2019-12-18 12:35:21,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79822 states. [2019-12-18 12:35:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79822 states to 79822 states and 342168 transitions. [2019-12-18 12:35:21,472 INFO L78 Accepts]: Start accepts. Automaton has 79822 states and 342168 transitions. Word has length 5 [2019-12-18 12:35:21,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:21,472 INFO L462 AbstractCegarLoop]: Abstraction has 79822 states and 342168 transitions. [2019-12-18 12:35:21,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:35:21,472 INFO L276 IsEmpty]: Start isEmpty. Operand 79822 states and 342168 transitions. [2019-12-18 12:35:21,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:35:21,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:21,481 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:21,482 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:21,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:21,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1460490103, now seen corresponding path program 1 times [2019-12-18 12:35:21,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:21,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613355146] [2019-12-18 12:35:21,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:21,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613355146] [2019-12-18 12:35:21,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:21,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:35:21,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99637114] [2019-12-18 12:35:21,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:35:21,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:21,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:35:21,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:21,556 INFO L87 Difference]: Start difference. First operand 79822 states and 342168 transitions. Second operand 3 states. [2019-12-18 12:35:21,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:21,880 INFO L93 Difference]: Finished difference Result 21012 states and 72403 transitions. [2019-12-18 12:35:21,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:35:21,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:35:21,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:21,979 INFO L225 Difference]: With dead ends: 21012 [2019-12-18 12:35:21,979 INFO L226 Difference]: Without dead ends: 21012 [2019-12-18 12:35:21,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21012 states. [2019-12-18 12:35:25,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21012 to 21012. [2019-12-18 12:35:25,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21012 states. [2019-12-18 12:35:25,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21012 states to 21012 states and 72403 transitions. [2019-12-18 12:35:25,323 INFO L78 Accepts]: Start accepts. Automaton has 21012 states and 72403 transitions. Word has length 13 [2019-12-18 12:35:25,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:25,323 INFO L462 AbstractCegarLoop]: Abstraction has 21012 states and 72403 transitions. [2019-12-18 12:35:25,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:35:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 21012 states and 72403 transitions. [2019-12-18 12:35:25,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:35:25,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:25,326 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:25,326 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:25,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:25,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1843446667, now seen corresponding path program 1 times [2019-12-18 12:35:25,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:25,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055954199] [2019-12-18 12:35:25,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:25,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055954199] [2019-12-18 12:35:25,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:25,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:35:25,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164579901] [2019-12-18 12:35:25,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:35:25,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:25,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:35:25,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:35:25,442 INFO L87 Difference]: Start difference. First operand 21012 states and 72403 transitions. Second operand 4 states. [2019-12-18 12:35:25,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:25,782 INFO L93 Difference]: Finished difference Result 31168 states and 104167 transitions. [2019-12-18 12:35:25,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:35:25,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 12:35:25,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:25,887 INFO L225 Difference]: With dead ends: 31168 [2019-12-18 12:35:25,888 INFO L226 Difference]: Without dead ends: 31154 [2019-12-18 12:35:25,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:35:26,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31154 states. [2019-12-18 12:35:26,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31154 to 27751. [2019-12-18 12:35:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27751 states. [2019-12-18 12:35:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27751 states to 27751 states and 93636 transitions. [2019-12-18 12:35:27,066 INFO L78 Accepts]: Start accepts. Automaton has 27751 states and 93636 transitions. Word has length 13 [2019-12-18 12:35:27,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:27,067 INFO L462 AbstractCegarLoop]: Abstraction has 27751 states and 93636 transitions. [2019-12-18 12:35:27,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:35:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 27751 states and 93636 transitions. [2019-12-18 12:35:27,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 12:35:27,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:27,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:27,070 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:27,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:27,071 INFO L82 PathProgramCache]: Analyzing trace with hash 890356816, now seen corresponding path program 1 times [2019-12-18 12:35:27,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:27,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767687458] [2019-12-18 12:35:27,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:27,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:27,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767687458] [2019-12-18 12:35:27,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:27,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:35:27,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67561318] [2019-12-18 12:35:27,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:35:27,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:27,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:35:27,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:35:27,167 INFO L87 Difference]: Start difference. First operand 27751 states and 93636 transitions. Second operand 5 states. [2019-12-18 12:35:27,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:27,637 INFO L93 Difference]: Finished difference Result 40618 states and 134851 transitions. [2019-12-18 12:35:27,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:35:27,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 12:35:27,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:27,738 INFO L225 Difference]: With dead ends: 40618 [2019-12-18 12:35:27,739 INFO L226 Difference]: Without dead ends: 40602 [2019-12-18 12:35:27,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:35:28,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40602 states. [2019-12-18 12:35:28,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40602 to 32075. [2019-12-18 12:35:28,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32075 states. [2019-12-18 12:35:28,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32075 states to 32075 states and 107493 transitions. [2019-12-18 12:35:28,761 INFO L78 Accepts]: Start accepts. Automaton has 32075 states and 107493 transitions. Word has length 14 [2019-12-18 12:35:28,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:28,762 INFO L462 AbstractCegarLoop]: Abstraction has 32075 states and 107493 transitions. [2019-12-18 12:35:28,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:35:28,762 INFO L276 IsEmpty]: Start isEmpty. Operand 32075 states and 107493 transitions. [2019-12-18 12:35:28,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:35:28,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:28,774 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:28,774 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:28,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:28,775 INFO L82 PathProgramCache]: Analyzing trace with hash 454702152, now seen corresponding path program 1 times [2019-12-18 12:35:28,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:28,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480419114] [2019-12-18 12:35:28,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:28,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:28,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480419114] [2019-12-18 12:35:28,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:28,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:35:28,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603514574] [2019-12-18 12:35:28,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:35:28,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:28,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:35:28,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:35:28,892 INFO L87 Difference]: Start difference. First operand 32075 states and 107493 transitions. Second operand 6 states. [2019-12-18 12:35:29,522 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-12-18 12:35:30,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:30,130 INFO L93 Difference]: Finished difference Result 48617 states and 159685 transitions. [2019-12-18 12:35:30,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:35:30,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 12:35:30,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:30,225 INFO L225 Difference]: With dead ends: 48617 [2019-12-18 12:35:30,225 INFO L226 Difference]: Without dead ends: 48589 [2019-12-18 12:35:30,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:35:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48589 states. [2019-12-18 12:35:31,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48589 to 33099. [2019-12-18 12:35:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33099 states. [2019-12-18 12:35:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33099 states to 33099 states and 109984 transitions. [2019-12-18 12:35:31,134 INFO L78 Accepts]: Start accepts. Automaton has 33099 states and 109984 transitions. Word has length 22 [2019-12-18 12:35:31,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:31,135 INFO L462 AbstractCegarLoop]: Abstraction has 33099 states and 109984 transitions. [2019-12-18 12:35:31,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:35:31,135 INFO L276 IsEmpty]: Start isEmpty. Operand 33099 states and 109984 transitions. [2019-12-18 12:35:31,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:35:31,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:31,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:31,154 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:31,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:31,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1218687100, now seen corresponding path program 1 times [2019-12-18 12:35:31,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:31,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402510742] [2019-12-18 12:35:31,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:31,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:31,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402510742] [2019-12-18 12:35:31,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:31,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:35:31,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022622254] [2019-12-18 12:35:31,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:35:31,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:31,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:35:31,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:35:31,213 INFO L87 Difference]: Start difference. First operand 33099 states and 109984 transitions. Second operand 4 states. [2019-12-18 12:35:31,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:31,304 INFO L93 Difference]: Finished difference Result 13493 states and 41620 transitions. [2019-12-18 12:35:31,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:35:31,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:35:31,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:31,331 INFO L225 Difference]: With dead ends: 13493 [2019-12-18 12:35:31,331 INFO L226 Difference]: Without dead ends: 13493 [2019-12-18 12:35:31,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:35:31,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2019-12-18 12:35:31,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13273. [2019-12-18 12:35:31,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13273 states. [2019-12-18 12:35:31,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13273 states to 13273 states and 40970 transitions. [2019-12-18 12:35:31,973 INFO L78 Accepts]: Start accepts. Automaton has 13273 states and 40970 transitions. Word has length 25 [2019-12-18 12:35:31,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:31,973 INFO L462 AbstractCegarLoop]: Abstraction has 13273 states and 40970 transitions. [2019-12-18 12:35:31,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:35:31,973 INFO L276 IsEmpty]: Start isEmpty. Operand 13273 states and 40970 transitions. [2019-12-18 12:35:31,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:35:31,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:31,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:31,993 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:31,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:31,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1155983199, now seen corresponding path program 1 times [2019-12-18 12:35:31,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:31,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729616752] [2019-12-18 12:35:31,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:32,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729616752] [2019-12-18 12:35:32,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:32,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:35:32,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881655568] [2019-12-18 12:35:32,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:35:32,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:32,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:35:32,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:35:32,085 INFO L87 Difference]: Start difference. First operand 13273 states and 40970 transitions. Second operand 5 states. [2019-12-18 12:35:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:32,156 INFO L93 Difference]: Finished difference Result 12040 states and 37785 transitions. [2019-12-18 12:35:32,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:35:32,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 12:35:32,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:32,175 INFO L225 Difference]: With dead ends: 12040 [2019-12-18 12:35:32,175 INFO L226 Difference]: Without dead ends: 11998 [2019-12-18 12:35:32,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:35:32,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11998 states. [2019-12-18 12:35:32,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11998 to 11419. [2019-12-18 12:35:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11419 states. [2019-12-18 12:35:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11419 states to 11419 states and 36001 transitions. [2019-12-18 12:35:32,364 INFO L78 Accepts]: Start accepts. Automaton has 11419 states and 36001 transitions. Word has length 39 [2019-12-18 12:35:32,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:32,365 INFO L462 AbstractCegarLoop]: Abstraction has 11419 states and 36001 transitions. [2019-12-18 12:35:32,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:35:32,365 INFO L276 IsEmpty]: Start isEmpty. Operand 11419 states and 36001 transitions. [2019-12-18 12:35:32,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 12:35:32,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:32,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:32,382 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:32,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:32,382 INFO L82 PathProgramCache]: Analyzing trace with hash 588132615, now seen corresponding path program 1 times [2019-12-18 12:35:32,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:32,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23728966] [2019-12-18 12:35:32,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:32,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23728966] [2019-12-18 12:35:32,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:32,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:35:32,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714065212] [2019-12-18 12:35:32,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:35:32,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:32,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:35:32,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:35:32,475 INFO L87 Difference]: Start difference. First operand 11419 states and 36001 transitions. Second operand 4 states. [2019-12-18 12:35:32,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:32,546 INFO L93 Difference]: Finished difference Result 20766 states and 65459 transitions. [2019-12-18 12:35:32,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:35:32,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-18 12:35:32,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:32,562 INFO L225 Difference]: With dead ends: 20766 [2019-12-18 12:35:32,562 INFO L226 Difference]: Without dead ends: 9680 [2019-12-18 12:35:32,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:35:32,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9680 states. [2019-12-18 12:35:32,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9680 to 9680. [2019-12-18 12:35:32,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9680 states. [2019-12-18 12:35:32,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9680 states to 9680 states and 30383 transitions. [2019-12-18 12:35:32,725 INFO L78 Accepts]: Start accepts. Automaton has 9680 states and 30383 transitions. Word has length 53 [2019-12-18 12:35:32,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:32,725 INFO L462 AbstractCegarLoop]: Abstraction has 9680 states and 30383 transitions. [2019-12-18 12:35:32,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:35:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 9680 states and 30383 transitions. [2019-12-18 12:35:32,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 12:35:32,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:32,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:32,741 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:32,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:32,741 INFO L82 PathProgramCache]: Analyzing trace with hash 104371591, now seen corresponding path program 2 times [2019-12-18 12:35:32,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:32,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78703817] [2019-12-18 12:35:32,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:32,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78703817] [2019-12-18 12:35:32,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:32,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:35:32,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854033428] [2019-12-18 12:35:32,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:35:32,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:32,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:35:32,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:35:32,847 INFO L87 Difference]: Start difference. First operand 9680 states and 30383 transitions. Second operand 7 states. [2019-12-18 12:35:33,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:33,271 INFO L93 Difference]: Finished difference Result 24579 states and 76915 transitions. [2019-12-18 12:35:33,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:35:33,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 12:35:33,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:33,304 INFO L225 Difference]: With dead ends: 24579 [2019-12-18 12:35:33,304 INFO L226 Difference]: Without dead ends: 19443 [2019-12-18 12:35:33,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:35:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19443 states. [2019-12-18 12:35:33,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19443 to 11624. [2019-12-18 12:35:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11624 states. [2019-12-18 12:35:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11624 states to 11624 states and 36702 transitions. [2019-12-18 12:35:33,569 INFO L78 Accepts]: Start accepts. Automaton has 11624 states and 36702 transitions. Word has length 53 [2019-12-18 12:35:33,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:33,569 INFO L462 AbstractCegarLoop]: Abstraction has 11624 states and 36702 transitions. [2019-12-18 12:35:33,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:35:33,569 INFO L276 IsEmpty]: Start isEmpty. Operand 11624 states and 36702 transitions. [2019-12-18 12:35:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 12:35:33,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:33,589 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:33,589 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:33,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:33,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1667433135, now seen corresponding path program 3 times [2019-12-18 12:35:33,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:33,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325821155] [2019-12-18 12:35:33,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:33,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325821155] [2019-12-18 12:35:33,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:33,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:35:33,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066851648] [2019-12-18 12:35:33,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:35:33,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:33,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:35:33,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:35:33,685 INFO L87 Difference]: Start difference. First operand 11624 states and 36702 transitions. Second operand 7 states. [2019-12-18 12:35:34,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:34,328 INFO L93 Difference]: Finished difference Result 29614 states and 91402 transitions. [2019-12-18 12:35:34,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:35:34,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 12:35:34,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:34,368 INFO L225 Difference]: With dead ends: 29614 [2019-12-18 12:35:34,368 INFO L226 Difference]: Without dead ends: 21210 [2019-12-18 12:35:34,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:35:34,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21210 states. [2019-12-18 12:35:34,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21210 to 13657. [2019-12-18 12:35:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13657 states. [2019-12-18 12:35:34,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13657 states to 13657 states and 42965 transitions. [2019-12-18 12:35:34,638 INFO L78 Accepts]: Start accepts. Automaton has 13657 states and 42965 transitions. Word has length 53 [2019-12-18 12:35:34,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:34,638 INFO L462 AbstractCegarLoop]: Abstraction has 13657 states and 42965 transitions. [2019-12-18 12:35:34,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:35:34,639 INFO L276 IsEmpty]: Start isEmpty. Operand 13657 states and 42965 transitions. [2019-12-18 12:35:34,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 12:35:34,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:34,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:34,657 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:34,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:34,657 INFO L82 PathProgramCache]: Analyzing trace with hash 750976839, now seen corresponding path program 4 times [2019-12-18 12:35:34,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:34,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448723392] [2019-12-18 12:35:34,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:34,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:34,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448723392] [2019-12-18 12:35:34,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:34,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:35:34,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304551445] [2019-12-18 12:35:34,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:35:34,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:34,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:35:34,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:35:34,752 INFO L87 Difference]: Start difference. First operand 13657 states and 42965 transitions. Second operand 7 states. [2019-12-18 12:35:35,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:35,102 INFO L93 Difference]: Finished difference Result 27460 states and 85976 transitions. [2019-12-18 12:35:35,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:35:35,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 12:35:35,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:35,139 INFO L225 Difference]: With dead ends: 27460 [2019-12-18 12:35:35,140 INFO L226 Difference]: Without dead ends: 25402 [2019-12-18 12:35:35,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:35:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25402 states. [2019-12-18 12:35:35,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25402 to 13726. [2019-12-18 12:35:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13726 states. [2019-12-18 12:35:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13726 states to 13726 states and 43266 transitions. [2019-12-18 12:35:35,428 INFO L78 Accepts]: Start accepts. Automaton has 13726 states and 43266 transitions. Word has length 53 [2019-12-18 12:35:35,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:35,428 INFO L462 AbstractCegarLoop]: Abstraction has 13726 states and 43266 transitions. [2019-12-18 12:35:35,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:35:35,428 INFO L276 IsEmpty]: Start isEmpty. Operand 13726 states and 43266 transitions. [2019-12-18 12:35:35,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 12:35:35,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:35,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:35,445 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:35,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:35,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1191615376, now seen corresponding path program 1 times [2019-12-18 12:35:35,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:35,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506671749] [2019-12-18 12:35:35,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:35,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:35,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506671749] [2019-12-18 12:35:35,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:35,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:35:35,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866531169] [2019-12-18 12:35:35,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:35:35,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:35,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:35:35,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:35,490 INFO L87 Difference]: Start difference. First operand 13726 states and 43266 transitions. Second operand 3 states. [2019-12-18 12:35:35,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:35,587 INFO L93 Difference]: Finished difference Result 18812 states and 59147 transitions. [2019-12-18 12:35:35,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:35:35,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 12:35:35,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:35,613 INFO L225 Difference]: With dead ends: 18812 [2019-12-18 12:35:35,613 INFO L226 Difference]: Without dead ends: 18812 [2019-12-18 12:35:35,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:35,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18812 states. [2019-12-18 12:35:35,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18812 to 16902. [2019-12-18 12:35:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16902 states. [2019-12-18 12:35:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16902 states to 16902 states and 53223 transitions. [2019-12-18 12:35:35,894 INFO L78 Accepts]: Start accepts. Automaton has 16902 states and 53223 transitions. Word has length 53 [2019-12-18 12:35:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:35,894 INFO L462 AbstractCegarLoop]: Abstraction has 16902 states and 53223 transitions. [2019-12-18 12:35:35,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:35:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 16902 states and 53223 transitions. [2019-12-18 12:35:35,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 12:35:35,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:35,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:35,915 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:35,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:35,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2090423977, now seen corresponding path program 5 times [2019-12-18 12:35:35,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:35,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449228859] [2019-12-18 12:35:35,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:35,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449228859] [2019-12-18 12:35:35,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:35,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:35:35,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700510345] [2019-12-18 12:35:35,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:35:35,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:35,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:35:35,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:35,965 INFO L87 Difference]: Start difference. First operand 16902 states and 53223 transitions. Second operand 3 states. [2019-12-18 12:35:36,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:36,254 INFO L93 Difference]: Finished difference Result 18773 states and 56435 transitions. [2019-12-18 12:35:36,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:35:36,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 12:35:36,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:36,286 INFO L225 Difference]: With dead ends: 18773 [2019-12-18 12:35:36,286 INFO L226 Difference]: Without dead ends: 18104 [2019-12-18 12:35:36,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:36,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18104 states. [2019-12-18 12:35:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18104 to 15749. [2019-12-18 12:35:36,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15749 states. [2019-12-18 12:35:36,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15749 states to 15749 states and 47846 transitions. [2019-12-18 12:35:36,576 INFO L78 Accepts]: Start accepts. Automaton has 15749 states and 47846 transitions. Word has length 53 [2019-12-18 12:35:36,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:36,576 INFO L462 AbstractCegarLoop]: Abstraction has 15749 states and 47846 transitions. [2019-12-18 12:35:36,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:35:36,576 INFO L276 IsEmpty]: Start isEmpty. Operand 15749 states and 47846 transitions. [2019-12-18 12:35:36,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 12:35:36,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:36,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:36,597 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:36,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:36,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1578630746, now seen corresponding path program 1 times [2019-12-18 12:35:36,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:36,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417775191] [2019-12-18 12:35:36,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:36,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:36,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417775191] [2019-12-18 12:35:36,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:36,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:35:36,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800804952] [2019-12-18 12:35:36,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:35:36,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:36,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:35:36,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:35:36,699 INFO L87 Difference]: Start difference. First operand 15749 states and 47846 transitions. Second operand 7 states. [2019-12-18 12:35:37,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:37,569 INFO L93 Difference]: Finished difference Result 26751 states and 78312 transitions. [2019-12-18 12:35:37,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:35:37,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 12:35:37,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:37,606 INFO L225 Difference]: With dead ends: 26751 [2019-12-18 12:35:37,607 INFO L226 Difference]: Without dead ends: 26641 [2019-12-18 12:35:37,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:35:37,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26641 states. [2019-12-18 12:35:37,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26641 to 19681. [2019-12-18 12:35:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19681 states. [2019-12-18 12:35:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19681 states to 19681 states and 59031 transitions. [2019-12-18 12:35:37,971 INFO L78 Accepts]: Start accepts. Automaton has 19681 states and 59031 transitions. Word has length 53 [2019-12-18 12:35:37,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:37,971 INFO L462 AbstractCegarLoop]: Abstraction has 19681 states and 59031 transitions. [2019-12-18 12:35:37,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:35:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand 19681 states and 59031 transitions. [2019-12-18 12:35:37,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 12:35:37,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:37,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:37,995 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:37,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:37,995 INFO L82 PathProgramCache]: Analyzing trace with hash -74918758, now seen corresponding path program 2 times [2019-12-18 12:35:37,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:37,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018241405] [2019-12-18 12:35:37,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:38,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:38,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018241405] [2019-12-18 12:35:38,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:38,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:35:38,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674022812] [2019-12-18 12:35:38,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:35:38,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:38,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:35:38,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:35:38,112 INFO L87 Difference]: Start difference. First operand 19681 states and 59031 transitions. Second operand 8 states. [2019-12-18 12:35:39,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:39,669 INFO L93 Difference]: Finished difference Result 38250 states and 112084 transitions. [2019-12-18 12:35:39,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:35:39,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-18 12:35:39,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:39,716 INFO L225 Difference]: With dead ends: 38250 [2019-12-18 12:35:39,717 INFO L226 Difference]: Without dead ends: 38140 [2019-12-18 12:35:39,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-12-18 12:35:39,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38140 states. [2019-12-18 12:35:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38140 to 20676. [2019-12-18 12:35:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20676 states. [2019-12-18 12:35:40,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20676 states to 20676 states and 61780 transitions. [2019-12-18 12:35:40,193 INFO L78 Accepts]: Start accepts. Automaton has 20676 states and 61780 transitions. Word has length 53 [2019-12-18 12:35:40,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:40,194 INFO L462 AbstractCegarLoop]: Abstraction has 20676 states and 61780 transitions. [2019-12-18 12:35:40,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:35:40,194 INFO L276 IsEmpty]: Start isEmpty. Operand 20676 states and 61780 transitions. [2019-12-18 12:35:40,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 12:35:40,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:40,219 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:40,219 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:40,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:40,220 INFO L82 PathProgramCache]: Analyzing trace with hash 638104790, now seen corresponding path program 3 times [2019-12-18 12:35:40,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:40,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956178535] [2019-12-18 12:35:40,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:40,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:40,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956178535] [2019-12-18 12:35:40,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:40,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:35:40,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115470463] [2019-12-18 12:35:40,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:35:40,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:40,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:35:40,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:40,290 INFO L87 Difference]: Start difference. First operand 20676 states and 61780 transitions. Second operand 3 states. [2019-12-18 12:35:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:40,361 INFO L93 Difference]: Finished difference Result 20676 states and 61778 transitions. [2019-12-18 12:35:40,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:35:40,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 12:35:40,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:40,388 INFO L225 Difference]: With dead ends: 20676 [2019-12-18 12:35:40,389 INFO L226 Difference]: Without dead ends: 20676 [2019-12-18 12:35:40,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:40,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20676 states. [2019-12-18 12:35:40,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20676 to 16261. [2019-12-18 12:35:40,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16261 states. [2019-12-18 12:35:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16261 states to 16261 states and 49687 transitions. [2019-12-18 12:35:40,667 INFO L78 Accepts]: Start accepts. Automaton has 16261 states and 49687 transitions. Word has length 53 [2019-12-18 12:35:40,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:40,667 INFO L462 AbstractCegarLoop]: Abstraction has 16261 states and 49687 transitions. [2019-12-18 12:35:40,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:35:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 16261 states and 49687 transitions. [2019-12-18 12:35:40,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 12:35:40,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:40,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:40,684 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:40,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:40,684 INFO L82 PathProgramCache]: Analyzing trace with hash -6191814, now seen corresponding path program 1 times [2019-12-18 12:35:40,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:40,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440395272] [2019-12-18 12:35:40,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:40,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440395272] [2019-12-18 12:35:40,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:40,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:35:40,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87537395] [2019-12-18 12:35:40,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:35:40,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:40,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:35:40,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:40,745 INFO L87 Difference]: Start difference. First operand 16261 states and 49687 transitions. Second operand 3 states. [2019-12-18 12:35:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:40,800 INFO L93 Difference]: Finished difference Result 12476 states and 37450 transitions. [2019-12-18 12:35:40,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:35:40,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 12:35:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:40,821 INFO L225 Difference]: With dead ends: 12476 [2019-12-18 12:35:40,821 INFO L226 Difference]: Without dead ends: 12476 [2019-12-18 12:35:40,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:40,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12476 states. [2019-12-18 12:35:40,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12476 to 11767. [2019-12-18 12:35:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11767 states. [2019-12-18 12:35:41,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11767 states to 11767 states and 35347 transitions. [2019-12-18 12:35:41,005 INFO L78 Accepts]: Start accepts. Automaton has 11767 states and 35347 transitions. Word has length 54 [2019-12-18 12:35:41,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:41,005 INFO L462 AbstractCegarLoop]: Abstraction has 11767 states and 35347 transitions. [2019-12-18 12:35:41,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:35:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 11767 states and 35347 transitions. [2019-12-18 12:35:41,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 12:35:41,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:41,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:41,017 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:41,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:41,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1003034569, now seen corresponding path program 1 times [2019-12-18 12:35:41,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:41,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674447010] [2019-12-18 12:35:41,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:41,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:41,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674447010] [2019-12-18 12:35:41,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:41,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:35:41,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755964795] [2019-12-18 12:35:41,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:35:41,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:41,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:35:41,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:35:41,117 INFO L87 Difference]: Start difference. First operand 11767 states and 35347 transitions. Second operand 8 states. [2019-12-18 12:35:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:42,387 INFO L93 Difference]: Finished difference Result 22675 states and 67447 transitions. [2019-12-18 12:35:42,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:35:42,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-18 12:35:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:42,416 INFO L225 Difference]: With dead ends: 22675 [2019-12-18 12:35:42,416 INFO L226 Difference]: Without dead ends: 18316 [2019-12-18 12:35:42,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:35:42,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18316 states. [2019-12-18 12:35:42,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18316 to 12308. [2019-12-18 12:35:42,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12308 states. [2019-12-18 12:35:42,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12308 states to 12308 states and 36615 transitions. [2019-12-18 12:35:42,631 INFO L78 Accepts]: Start accepts. Automaton has 12308 states and 36615 transitions. Word has length 55 [2019-12-18 12:35:42,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:42,632 INFO L462 AbstractCegarLoop]: Abstraction has 12308 states and 36615 transitions. [2019-12-18 12:35:42,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:35:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 12308 states and 36615 transitions. [2019-12-18 12:35:42,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 12:35:42,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:42,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:42,646 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:42,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:42,646 INFO L82 PathProgramCache]: Analyzing trace with hash -367516305, now seen corresponding path program 2 times [2019-12-18 12:35:42,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:42,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870365556] [2019-12-18 12:35:42,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:42,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870365556] [2019-12-18 12:35:42,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:42,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:35:42,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174227310] [2019-12-18 12:35:42,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:35:42,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:42,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:35:42,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:35:42,767 INFO L87 Difference]: Start difference. First operand 12308 states and 36615 transitions. Second operand 9 states. [2019-12-18 12:35:43,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:43,752 INFO L93 Difference]: Finished difference Result 21113 states and 62320 transitions. [2019-12-18 12:35:43,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:35:43,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 12:35:43,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:43,776 INFO L225 Difference]: With dead ends: 21113 [2019-12-18 12:35:43,776 INFO L226 Difference]: Without dead ends: 17884 [2019-12-18 12:35:43,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:35:43,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17884 states. [2019-12-18 12:35:43,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17884 to 12140. [2019-12-18 12:35:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12140 states. [2019-12-18 12:35:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12140 states to 12140 states and 36091 transitions. [2019-12-18 12:35:43,987 INFO L78 Accepts]: Start accepts. Automaton has 12140 states and 36091 transitions. Word has length 55 [2019-12-18 12:35:43,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:43,987 INFO L462 AbstractCegarLoop]: Abstraction has 12140 states and 36091 transitions. [2019-12-18 12:35:43,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:35:43,988 INFO L276 IsEmpty]: Start isEmpty. Operand 12140 states and 36091 transitions. [2019-12-18 12:35:43,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 12:35:44,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:44,000 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:44,000 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:44,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:44,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1545411663, now seen corresponding path program 3 times [2019-12-18 12:35:44,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:44,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558666707] [2019-12-18 12:35:44,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:44,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558666707] [2019-12-18 12:35:44,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:44,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 12:35:44,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893137751] [2019-12-18 12:35:44,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 12:35:44,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:44,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 12:35:44,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:35:44,450 INFO L87 Difference]: Start difference. First operand 12140 states and 36091 transitions. Second operand 15 states. [2019-12-18 12:35:48,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:48,827 INFO L93 Difference]: Finished difference Result 27231 states and 79196 transitions. [2019-12-18 12:35:48,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-18 12:35:48,828 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-18 12:35:48,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:48,865 INFO L225 Difference]: With dead ends: 27231 [2019-12-18 12:35:48,865 INFO L226 Difference]: Without dead ends: 26545 [2019-12-18 12:35:48,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1233 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=603, Invalid=3557, Unknown=0, NotChecked=0, Total=4160 [2019-12-18 12:35:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26545 states. [2019-12-18 12:35:49,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26545 to 14182. [2019-12-18 12:35:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14182 states. [2019-12-18 12:35:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14182 states to 14182 states and 41823 transitions. [2019-12-18 12:35:49,186 INFO L78 Accepts]: Start accepts. Automaton has 14182 states and 41823 transitions. Word has length 55 [2019-12-18 12:35:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:49,186 INFO L462 AbstractCegarLoop]: Abstraction has 14182 states and 41823 transitions. [2019-12-18 12:35:49,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 12:35:49,186 INFO L276 IsEmpty]: Start isEmpty. Operand 14182 states and 41823 transitions. [2019-12-18 12:35:49,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 12:35:49,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:49,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:49,202 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:49,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:49,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1540693839, now seen corresponding path program 4 times [2019-12-18 12:35:49,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:49,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157711523] [2019-12-18 12:35:49,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:49,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:49,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157711523] [2019-12-18 12:35:49,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:49,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 12:35:49,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580266441] [2019-12-18 12:35:49,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 12:35:49,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:49,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 12:35:49,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:35:49,653 INFO L87 Difference]: Start difference. First operand 14182 states and 41823 transitions. Second operand 15 states. [2019-12-18 12:35:53,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:53,030 INFO L93 Difference]: Finished difference Result 26877 states and 77568 transitions. [2019-12-18 12:35:53,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 12:35:53,031 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-18 12:35:53,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:53,058 INFO L225 Difference]: With dead ends: 26877 [2019-12-18 12:35:53,058 INFO L226 Difference]: Without dead ends: 21485 [2019-12-18 12:35:53,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=514, Invalid=2456, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 12:35:53,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21485 states. [2019-12-18 12:35:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21485 to 12008. [2019-12-18 12:35:53,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12008 states. [2019-12-18 12:35:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12008 states to 12008 states and 35667 transitions. [2019-12-18 12:35:53,499 INFO L78 Accepts]: Start accepts. Automaton has 12008 states and 35667 transitions. Word has length 55 [2019-12-18 12:35:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:53,499 INFO L462 AbstractCegarLoop]: Abstraction has 12008 states and 35667 transitions. [2019-12-18 12:35:53,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 12:35:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 12008 states and 35667 transitions. [2019-12-18 12:35:53,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 12:35:53,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:53,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:53,513 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:53,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:53,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1318747633, now seen corresponding path program 5 times [2019-12-18 12:35:53,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:53,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207571517] [2019-12-18 12:35:53,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:53,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207571517] [2019-12-18 12:35:53,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:53,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:35:53,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548451864] [2019-12-18 12:35:53,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:35:53,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:53,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:35:53,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:35:53,687 INFO L87 Difference]: Start difference. First operand 12008 states and 35667 transitions. Second operand 11 states. [2019-12-18 12:35:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:54,699 INFO L93 Difference]: Finished difference Result 21368 states and 63146 transitions. [2019-12-18 12:35:54,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:35:54,700 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 12:35:54,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:54,727 INFO L225 Difference]: With dead ends: 21368 [2019-12-18 12:35:54,727 INFO L226 Difference]: Without dead ends: 20802 [2019-12-18 12:35:54,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:35:54,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20802 states. [2019-12-18 12:35:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20802 to 13493. [2019-12-18 12:35:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13493 states. [2019-12-18 12:35:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 39896 transitions. [2019-12-18 12:35:54,992 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 39896 transitions. Word has length 55 [2019-12-18 12:35:54,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:54,992 INFO L462 AbstractCegarLoop]: Abstraction has 13493 states and 39896 transitions. [2019-12-18 12:35:54,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:35:54,992 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 39896 transitions. [2019-12-18 12:35:55,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 12:35:55,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:55,006 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:55,006 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:55,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:55,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1314029809, now seen corresponding path program 6 times [2019-12-18 12:35:55,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:55,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113082812] [2019-12-18 12:35:55,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:55,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113082812] [2019-12-18 12:35:55,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:55,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:35:55,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635266677] [2019-12-18 12:35:55,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:35:55,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:55,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:35:55,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:35:55,191 INFO L87 Difference]: Start difference. First operand 13493 states and 39896 transitions. Second operand 11 states. [2019-12-18 12:35:56,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:56,139 INFO L93 Difference]: Finished difference Result 21134 states and 61954 transitions. [2019-12-18 12:35:56,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:35:56,140 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 12:35:56,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:56,165 INFO L225 Difference]: With dead ends: 21134 [2019-12-18 12:35:56,166 INFO L226 Difference]: Without dead ends: 18101 [2019-12-18 12:35:56,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:35:56,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18101 states. [2019-12-18 12:35:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18101 to 11590. [2019-12-18 12:35:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11590 states. [2019-12-18 12:35:56,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11590 states to 11590 states and 34497 transitions. [2019-12-18 12:35:56,398 INFO L78 Accepts]: Start accepts. Automaton has 11590 states and 34497 transitions. Word has length 55 [2019-12-18 12:35:56,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:56,398 INFO L462 AbstractCegarLoop]: Abstraction has 11590 states and 34497 transitions. [2019-12-18 12:35:56,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:35:56,398 INFO L276 IsEmpty]: Start isEmpty. Operand 11590 states and 34497 transitions. [2019-12-18 12:35:56,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 12:35:56,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:56,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:56,410 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:56,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:56,411 INFO L82 PathProgramCache]: Analyzing trace with hash -767893923, now seen corresponding path program 7 times [2019-12-18 12:35:56,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:56,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653353969] [2019-12-18 12:35:56,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:56,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:56,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653353969] [2019-12-18 12:35:56,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:56,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 12:35:56,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964107021] [2019-12-18 12:35:56,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 12:35:56,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:56,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 12:35:56,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:35:56,788 INFO L87 Difference]: Start difference. First operand 11590 states and 34497 transitions. Second operand 17 states. [2019-12-18 12:35:58,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:58,679 INFO L93 Difference]: Finished difference Result 13562 states and 39922 transitions. [2019-12-18 12:35:58,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:35:58,680 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-12-18 12:35:58,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:58,698 INFO L225 Difference]: With dead ends: 13562 [2019-12-18 12:35:58,698 INFO L226 Difference]: Without dead ends: 13474 [2019-12-18 12:35:58,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2019-12-18 12:35:58,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13474 states. [2019-12-18 12:35:58,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13474 to 11686. [2019-12-18 12:35:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11686 states. [2019-12-18 12:35:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11686 states to 11686 states and 34735 transitions. [2019-12-18 12:35:58,881 INFO L78 Accepts]: Start accepts. Automaton has 11686 states and 34735 transitions. Word has length 55 [2019-12-18 12:35:58,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:58,882 INFO L462 AbstractCegarLoop]: Abstraction has 11686 states and 34735 transitions. [2019-12-18 12:35:58,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 12:35:58,882 INFO L276 IsEmpty]: Start isEmpty. Operand 11686 states and 34735 transitions. [2019-12-18 12:35:58,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 12:35:58,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:58,894 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:58,895 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:58,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:58,895 INFO L82 PathProgramCache]: Analyzing trace with hash 882976399, now seen corresponding path program 8 times [2019-12-18 12:35:58,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:58,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640379466] [2019-12-18 12:35:58,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:59,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:59,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640379466] [2019-12-18 12:35:59,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:59,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:35:59,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121749092] [2019-12-18 12:35:59,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:35:59,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:59,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:35:59,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:35:59,049 INFO L87 Difference]: Start difference. First operand 11686 states and 34735 transitions. Second operand 12 states. [2019-12-18 12:35:59,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:59,952 INFO L93 Difference]: Finished difference Result 18327 states and 54081 transitions. [2019-12-18 12:35:59,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:35:59,952 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-18 12:35:59,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:59,975 INFO L225 Difference]: With dead ends: 18327 [2019-12-18 12:35:59,975 INFO L226 Difference]: Without dead ends: 18109 [2019-12-18 12:35:59,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:36:00,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18109 states. [2019-12-18 12:36:00,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18109 to 11486. [2019-12-18 12:36:00,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11486 states. [2019-12-18 12:36:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11486 states to 11486 states and 34223 transitions. [2019-12-18 12:36:00,182 INFO L78 Accepts]: Start accepts. Automaton has 11486 states and 34223 transitions. Word has length 55 [2019-12-18 12:36:00,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:00,182 INFO L462 AbstractCegarLoop]: Abstraction has 11486 states and 34223 transitions. [2019-12-18 12:36:00,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:36:00,182 INFO L276 IsEmpty]: Start isEmpty. Operand 11486 states and 34223 transitions. [2019-12-18 12:36:00,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 12:36:00,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:00,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:00,194 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:00,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:00,194 INFO L82 PathProgramCache]: Analyzing trace with hash -238462213, now seen corresponding path program 9 times [2019-12-18 12:36:00,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:00,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825304264] [2019-12-18 12:36:00,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:36:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:36:00,298 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:36:00,298 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:36:00,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t424~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t424~0.base_40|) |v_ULTIMATE.start_main_~#t424~0.offset_28| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p2_EAX~0_40) (= 0 v_~__unbuffered_p0_EAX~0_50) (= 0 v_~x$w_buff0~0_407) (= 0 v_~weak$$choice0~0_14) (= v_~__unbuffered_cnt~0_133 0) (= 0 v_~x$w_buff0_used~0_981) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~x$r_buff1_thd1~0_402 0) (= 0 v_~x$w_buff1~0_314) (= v_~x$flush_delayed~0_48 0) (= 0 v_~x$read_delayed_var~0.base_8) (= 0 v_~x~0_233) (= 0 v_~x$r_buff0_thd2~0_329) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$r_buff0_thd3~0_134) (= v_~__unbuffered_p1_EAX~0_219 0) (= 0 v_~x$w_buff1_used~0_593) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= v_~x$r_buff0_thd1~0_388 0) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed_var~0.offset_8) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_17 0) (= v_~main$tmp_guard0~0_20 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t424~0.base_40|)) (= v_~x$r_buff0_thd0~0_141 0) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t424~0.base_40| 1)) (= 0 |v_ULTIMATE.start_main_~#t424~0.offset_28|) (= |v_#NULL.offset_4| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t424~0.base_40|) (= v_~weak$$choice2~0_186 0) (= v_~y~0_68 0) (= 0 v_~x$r_buff1_thd3~0_275) (= v_~__unbuffered_p2_EBX~0_40 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t424~0.base_40| 4) |v_#length_21|) (= v_~x$r_buff1_thd0~0_274 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_407, ULTIMATE.start_main_~#t425~0.offset=|v_ULTIMATE.start_main_~#t425~0.offset_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_48, ULTIMATE.start_main_~#t426~0.base=|v_ULTIMATE.start_main_~#t426~0.base_19|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_402, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_43|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_50, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_219, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_593, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ULTIMATE.start_main_~#t426~0.offset=|v_ULTIMATE.start_main_~#t426~0.offset_16|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, ~x~0=v_~x~0_233, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_388, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_73|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_17, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_127|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_49|, ULTIMATE.start_main_~#t424~0.offset=|v_ULTIMATE.start_main_~#t424~0.offset_28|, ULTIMATE.start_main_~#t425~0.base=|v_ULTIMATE.start_main_~#t425~0.base_32|, ~y~0=v_~y~0_68, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_274, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_329, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_981, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_77|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_186, ULTIMATE.start_main_~#t424~0.base=|v_ULTIMATE.start_main_~#t424~0.base_40|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t425~0.offset, ~x$flush_delayed~0, ULTIMATE.start_main_~#t426~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t426~0.offset, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t424~0.offset, ULTIMATE.start_main_~#t425~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t424~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 12:36:00,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L823-1-->L825: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t425~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t425~0.base_11|) |v_ULTIMATE.start_main_~#t425~0.offset_10| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t425~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t425~0.offset_10|) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t425~0.base_11|) 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t425~0.base_11| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t425~0.base_11|)) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t425~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t425~0.offset=|v_ULTIMATE.start_main_~#t425~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t425~0.base=|v_ULTIMATE.start_main_~#t425~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t425~0.offset, ULTIMATE.start_main_~#t425~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 12:36:00,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_11 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_9|) (= v_~x$w_buff1_used~0_59 v_~x$w_buff0_used~0_123) (= 1 v_~x$w_buff0~0_27) (= v_P1Thread1of1ForFork0_~arg.offset_9 |v_P1Thread1of1ForFork0_#in~arg.offset_9|) (= 1 v_~x$w_buff0_used~0_122) (= 0 (mod v_~x$w_buff1_used~0_59 256)) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_9|) (= v_P1Thread1of1ForFork0_~arg.base_9 |v_P1Thread1of1ForFork0_#in~arg.base_9|) (= v_~x$w_buff0~0_28 v_~x$w_buff1~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_28, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_27, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_11, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_9|, ~x$w_buff1~0=v_~x$w_buff1~0_20, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_122} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 12:36:00,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L825-1-->L827: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t426~0.offset_10|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t426~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t426~0.base_11|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t426~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t426~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t426~0.base_11|) |v_ULTIMATE.start_main_~#t426~0.offset_10| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t426~0.base_11| 4)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t426~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t426~0.base=|v_ULTIMATE.start_main_~#t426~0.base_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t426~0.offset=|v_ULTIMATE.start_main_~#t426~0.offset_10|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t426~0.base, #length, ULTIMATE.start_main_~#t426~0.offset, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 12:36:00,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L800-2-->L800-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In693323675 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In693323675 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In693323675 |P2Thread1of1ForFork1_#t~ite32_Out693323675|)) (and (or .cse1 .cse0) (= ~x~0_In693323675 |P2Thread1of1ForFork1_#t~ite32_Out693323675|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In693323675, ~x$w_buff1_used~0=~x$w_buff1_used~0_In693323675, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In693323675, ~x~0=~x~0_In693323675} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out693323675|, ~x$w_buff1~0=~x$w_buff1~0_In693323675, ~x$w_buff1_used~0=~x$w_buff1_used~0_In693323675, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In693323675, ~x~0=~x~0_In693323675} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 12:36:00,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In2121649729 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In2121649729 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out2121649729|)) (and (= ~x$w_buff0_used~0_In2121649729 |P1Thread1of1ForFork0_#t~ite28_Out2121649729|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2121649729, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2121649729} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2121649729, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out2121649729|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2121649729} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 12:36:00,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1971335987 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In1971335987 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1971335987 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1971335987 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out1971335987|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out1971335987| ~x$w_buff1_used~0_In1971335987) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1971335987, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1971335987, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1971335987, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1971335987} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1971335987, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1971335987, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1971335987, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1971335987|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1971335987} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:36:00,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L780-->L781: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1592606559 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1592606559 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out1592606559 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_Out1592606559 ~x$r_buff0_thd2~0_In1592606559) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1592606559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1592606559} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1592606559|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1592606559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1592606559} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 12:36:00,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1556924977 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1556924977 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1556924977 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1556924977 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1556924977|)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out1556924977| ~x$r_buff1_thd2~0_In1556924977) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1556924977, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1556924977, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1556924977, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1556924977} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1556924977|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1556924977, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1556924977, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1556924977, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1556924977} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 12:36:00,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_51 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 12:36:00,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L744-->L744-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-80975550 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-80975550 256)))) (or (and .cse0 (= (mod ~x$w_buff1_used~0_In-80975550 256) 0)) (and .cse0 (= (mod ~x$r_buff1_thd1~0_In-80975550 256) 0)) (= (mod ~x$w_buff0_used~0_In-80975550 256) 0))) .cse1 (= |P0Thread1of1ForFork2_#t~ite15_Out-80975550| |P0Thread1of1ForFork2_#t~ite14_Out-80975550|) (= |P0Thread1of1ForFork2_#t~ite14_Out-80975550| ~x$w_buff0_used~0_In-80975550)) (and (= |P0Thread1of1ForFork2_#t~ite14_In-80975550| |P0Thread1of1ForFork2_#t~ite14_Out-80975550|) (= |P0Thread1of1ForFork2_#t~ite15_Out-80975550| ~x$w_buff0_used~0_In-80975550) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-80975550, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-80975550, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-80975550, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-80975550|, ~weak$$choice2~0=~weak$$choice2~0_In-80975550, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-80975550} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-80975550, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-80975550, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-80975550|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-80975550, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-80975550|, ~weak$$choice2~0=~weak$$choice2~0_In-80975550, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-80975550} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:36:00,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1243192413 256) 0)) (.cse4 (= 0 (mod ~x$w_buff1_used~0_In-1243192413 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1243192413 256))) (.cse5 (= |P0Thread1of1ForFork2_#t~ite18_Out-1243192413| |P0Thread1of1ForFork2_#t~ite17_Out-1243192413|)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1243192413 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-1243192413 256)))) (or (and (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_Out-1243192413| |P0Thread1of1ForFork2_#t~ite17_In-1243192413|) (= |P0Thread1of1ForFork2_#t~ite18_Out-1243192413| ~x$w_buff1_used~0_In-1243192413)) (and .cse0 (or (and .cse1 .cse2) .cse3 (and .cse2 .cse4)) .cse5 (= |P0Thread1of1ForFork2_#t~ite17_Out-1243192413| ~x$w_buff1_used~0_In-1243192413))) (= |P0Thread1of1ForFork2_#t~ite16_In-1243192413| |P0Thread1of1ForFork2_#t~ite16_Out-1243192413|)) (let ((.cse6 (not .cse2))) (and .cse0 (or .cse6 (not .cse4)) (not .cse3) .cse5 (or (not .cse1) .cse6) (= |P0Thread1of1ForFork2_#t~ite16_Out-1243192413| 0) (= |P0Thread1of1ForFork2_#t~ite17_Out-1243192413| |P0Thread1of1ForFork2_#t~ite16_Out-1243192413|))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1243192413, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-1243192413|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1243192413, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In-1243192413|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1243192413, ~weak$$choice2~0=~weak$$choice2~0_In-1243192413, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1243192413} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1243192413, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-1243192413|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-1243192413|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1243192413, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out-1243192413|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1243192413, ~weak$$choice2~0=~weak$$choice2~0_In-1243192413, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1243192413} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 12:36:00,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L745-8-->L747: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite18_55| v_~x$w_buff1_used~0_577) (not (= 0 (mod v_~weak$$choice2~0_176 256))) (= v_~x$r_buff0_thd1~0_373 v_~x$r_buff0_thd1~0_372)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_373, P0Thread1of1ForFork2_#t~ite18=|v_P0Thread1of1ForFork2_#t~ite18_55|, ~weak$$choice2~0=v_~weak$$choice2~0_176} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_39|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_372, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, P0Thread1of1ForFork2_#t~ite18=|v_P0Thread1of1ForFork2_#t~ite18_54|, P0Thread1of1ForFork2_#t~ite17=|v_P0Thread1of1ForFork2_#t~ite17_48|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_577, P0Thread1of1ForFork2_#t~ite16=|v_P0Thread1of1ForFork2_#t~ite16_44|, ~weak$$choice2~0=v_~weak$$choice2~0_176, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, ~x$w_buff1_used~0, P0Thread1of1ForFork2_#t~ite16, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 12:36:00,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L800-4-->L801: Formula: (= v_~x~0_36 |v_P2Thread1of1ForFork1_#t~ite32_14|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_14|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_13|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_21|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 12:36:00,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L749-->L757: Formula: (and (= v_~x$flush_delayed~0_13 0) (not (= (mod v_~x$flush_delayed~0_14 256) 0)) (= v_~x$mem_tmp~0_5 v_~x~0_56) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 12:36:00,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-1047315150 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1047315150 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out-1047315150| 0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite34_Out-1047315150| ~x$w_buff0_used~0_In-1047315150) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1047315150, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1047315150} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1047315150|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1047315150, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1047315150} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 12:36:00,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L802-->L802-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In969911381 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In969911381 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In969911381 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In969911381 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In969911381 |P2Thread1of1ForFork1_#t~ite35_Out969911381|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out969911381|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In969911381, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In969911381, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In969911381, ~x$w_buff0_used~0=~x$w_buff0_used~0_In969911381} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out969911381|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In969911381, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In969911381, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In969911381, ~x$w_buff0_used~0=~x$w_buff0_used~0_In969911381} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 12:36:00,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-314792343 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-314792343 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-314792343| ~x$r_buff0_thd3~0_In-314792343) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-314792343| 0) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-314792343, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-314792343} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-314792343|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-314792343, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-314792343} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 12:36:00,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L804-->L804-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In895748853 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In895748853 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In895748853 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In895748853 256) 0))) (or (and (= ~x$r_buff1_thd3~0_In895748853 |P2Thread1of1ForFork1_#t~ite37_Out895748853|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out895748853|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In895748853, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In895748853, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In895748853, ~x$w_buff0_used~0=~x$w_buff0_used~0_In895748853} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out895748853|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In895748853, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In895748853, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In895748853, ~x$w_buff0_used~0=~x$w_buff0_used~0_In895748853} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 12:36:00,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L804-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82) (= |v_P2Thread1of1ForFork1_#t~ite37_42| v_~x$r_buff1_thd3~0_144)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_41|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_144, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 12:36:00,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L827-1-->L833: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:36:00,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L833-2-->L833-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite42_Out-420055938| |ULTIMATE.start_main_#t~ite41_Out-420055938|)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-420055938 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-420055938 256)))) (or (and .cse0 (= ~x$w_buff1~0_In-420055938 |ULTIMATE.start_main_#t~ite41_Out-420055938|) (not .cse1) (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite41_Out-420055938| ~x~0_In-420055938) .cse0 (or .cse2 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-420055938, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-420055938, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-420055938, ~x~0=~x~0_In-420055938} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-420055938|, ~x$w_buff1~0=~x$w_buff1~0_In-420055938, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-420055938, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-420055938, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-420055938|, ~x~0=~x~0_In-420055938} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 12:36:00,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In675559724 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In675559724 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out675559724| ~x$w_buff0_used~0_In675559724) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out675559724|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In675559724, ~x$w_buff0_used~0=~x$w_buff0_used~0_In675559724} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In675559724, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out675559724|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In675559724} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 12:36:00,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In1721430187 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1721430187 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1721430187 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1721430187 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out1721430187|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1721430187 |ULTIMATE.start_main_#t~ite44_Out1721430187|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1721430187, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1721430187, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1721430187, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1721430187} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1721430187, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1721430187, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1721430187, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1721430187|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1721430187} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 12:36:00,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In322187606 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In322187606 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In322187606 |ULTIMATE.start_main_#t~ite45_Out322187606|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out322187606|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In322187606, ~x$w_buff0_used~0=~x$w_buff0_used~0_In322187606} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In322187606, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out322187606|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In322187606} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 12:36:00,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L837-->L837-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1475023774 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1475023774 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1475023774 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1475023774 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out1475023774| 0)) (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In1475023774 |ULTIMATE.start_main_#t~ite46_Out1475023774|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1475023774, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1475023774, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1475023774, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1475023774} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1475023774, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1475023774|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1475023774, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1475023774, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1475023774} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 12:36:00,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_22 256)) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~__unbuffered_p1_EAX~0_205 0) (= v_~__unbuffered_p2_EBX~0_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~x$r_buff1_thd0~0_258 |v_ULTIMATE.start_main_#t~ite46_45|) (= 0 v_~__unbuffered_p0_EAX~0_34) (= v_~main$tmp_guard1~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_205, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_45|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_205, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_44|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_258, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:36:00,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:36:00 BasicIcfg [2019-12-18 12:36:00,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:36:00,430 INFO L168 Benchmark]: Toolchain (without parser) took 69175.62 ms. Allocated memory was 137.4 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 100.7 MB in the beginning and 991.6 MB in the end (delta: -890.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 12:36:00,431 INFO L168 Benchmark]: CDTParser took 1.47 ms. Allocated memory is still 137.4 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 12:36:00,431 INFO L168 Benchmark]: CACSL2BoogieTranslator took 720.85 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.2 MB in the beginning and 153.0 MB in the end (delta: -52.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-18 12:36:00,432 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.63 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 150.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:36:00,437 INFO L168 Benchmark]: Boogie Preprocessor took 78.94 ms. Allocated memory is still 201.3 MB. Free memory was 150.2 MB in the beginning and 148.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:36:00,437 INFO L168 Benchmark]: RCFGBuilder took 908.08 ms. Allocated memory is still 201.3 MB. Free memory was 148.1 MB in the beginning and 101.0 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:36:00,438 INFO L168 Benchmark]: TraceAbstraction took 67359.33 ms. Allocated memory was 201.3 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 100.3 MB in the beginning and 991.6 MB in the end (delta: -891.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 12:36:00,442 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.47 ms. Allocated memory is still 137.4 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 720.85 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.2 MB in the beginning and 153.0 MB in the end (delta: -52.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 102.63 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 150.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.94 ms. Allocated memory is still 201.3 MB. Free memory was 150.2 MB in the beginning and 148.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 908.08 ms. Allocated memory is still 201.3 MB. Free memory was 148.1 MB in the beginning and 101.0 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 67359.33 ms. Allocated memory was 201.3 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 100.3 MB in the beginning and 991.6 MB in the end (delta: -891.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 165 ProgramPointsBefore, 83 ProgramPointsAfterwards, 196 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 6986 VarBasedMoverChecksPositive, 284 VarBasedMoverChecksNegative, 112 SemBasedMoverChecksPositive, 261 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 75392 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t424, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] FCALL, FORK 0 pthread_create(&t425, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] FCALL, FORK 0 pthread_create(&t426, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] 3 y = 1 [L794] 3 __unbuffered_p2_EAX = y [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L800] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L734] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=1, x$flush_delayed=1, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, x$flush_delayed=1, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L747] EXPR 1 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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))=0, x=1, x$flush_delayed=1, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, y=1, z=1] [L801] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] 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 [L803] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L835] 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 [L836] 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, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 67.0s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 26.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5666 SDtfs, 7814 SDslu, 22716 SDs, 0 SdLazy, 13731 SolverSat, 326 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 411 GetRequests, 42 SyntacticMatches, 14 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2814 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86190occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 144903 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1157 NumberOfCodeBlocks, 1157 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1077 ConstructedInterpolants, 0 QuantifiedInterpolants, 248147 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...