/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:40:45,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:40:45,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:40:45,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:40:45,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:40:45,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:40:45,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:40:45,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:40:45,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:40:45,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:40:45,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:40:45,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:40:45,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:40:45,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:40:45,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:40:45,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:40:45,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:40:45,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:40:45,058 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:40:45,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:40:45,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:40:45,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:40:45,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:40:45,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:40:45,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:40:45,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:40:45,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:40:45,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:40:45,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:40:45,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:40:45,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:40:45,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:40:45,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:40:45,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:40:45,074 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:40:45,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:40:45,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:40:45,075 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:40:45,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:40:45,078 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:40:45,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:40:45,080 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:40:45,093 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:40:45,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:40:45,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:40:45,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:40:45,095 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:40:45,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:40:45,095 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:40:45,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:40:45,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:40:45,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:40:45,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:40:45,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:40:45,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:40:45,097 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:40:45,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:40:45,097 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:40:45,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:40:45,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:40:45,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:40:45,098 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:40:45,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:40:45,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:40:45,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:40:45,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:40:45,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:40:45,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:40:45,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:40:45,100 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:40:45,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:40:45,100 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:40:45,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:40:45,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:40:45,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:40:45,398 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:40:45,398 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:40:45,399 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i [2019-12-18 22:40:45,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68aba95c9/8bb12bd70fb3440e9da054f276583990/FLAG0c29256b0 [2019-12-18 22:40:46,064 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:40:46,065 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i [2019-12-18 22:40:46,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68aba95c9/8bb12bd70fb3440e9da054f276583990/FLAG0c29256b0 [2019-12-18 22:40:46,315 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68aba95c9/8bb12bd70fb3440e9da054f276583990 [2019-12-18 22:40:46,323 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:40:46,325 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:40:46,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:40:46,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:40:46,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:40:46,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:40:46" (1/1) ... [2019-12-18 22:40:46,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115225be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:40:46, skipping insertion in model container [2019-12-18 22:40:46,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:40:46" (1/1) ... [2019-12-18 22:40:46,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:40:46,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:40:46,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:40:46,941 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:40:47,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:40:47,082 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:40:47,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:40:47 WrapperNode [2019-12-18 22:40:47,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:40:47,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:40:47,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:40:47,084 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:40:47,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:40:47" (1/1) ... [2019-12-18 22:40:47,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:40:47" (1/1) ... [2019-12-18 22:40:47,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:40:47,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:40:47,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:40:47,182 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:40:47,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:40:47" (1/1) ... [2019-12-18 22:40:47,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:40:47" (1/1) ... [2019-12-18 22:40:47,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:40:47" (1/1) ... [2019-12-18 22:40:47,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:40:47" (1/1) ... [2019-12-18 22:40:47,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:40:47" (1/1) ... [2019-12-18 22:40:47,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:40:47" (1/1) ... [2019-12-18 22:40:47,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:40:47" (1/1) ... [2019-12-18 22:40:47,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:40:47,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:40:47,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:40:47,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:40:47,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:40:47" (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 22:40:47,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:40:47,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:40:47,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:40:47,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:40:47,310 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:40:47,310 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:40:47,310 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:40:47,310 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:40:47,310 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:40:47,310 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:40:47,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:40:47,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:40:47,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:40:47,313 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 22:40:48,115 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:40:48,116 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:40:48,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:40:48 BoogieIcfgContainer [2019-12-18 22:40:48,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:40:48,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:40:48,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:40:48,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:40:48,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:40:46" (1/3) ... [2019-12-18 22:40:48,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd90417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:40:48, skipping insertion in model container [2019-12-18 22:40:48,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:40:47" (2/3) ... [2019-12-18 22:40:48,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd90417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:40:48, skipping insertion in model container [2019-12-18 22:40:48,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:40:48" (3/3) ... [2019-12-18 22:40:48,130 INFO L109 eAbstractionObserver]: Analyzing ICFG safe017_pso.oepc.i [2019-12-18 22:40:48,141 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:40:48,142 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:40:48,150 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:40:48,151 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:40:48,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,190 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,190 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,190 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,191 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,191 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,199 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,200 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,223 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,223 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,233 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,234 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,234 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,237 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,238 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,241 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,242 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:40:48,257 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:40:48,273 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:40:48,273 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:40:48,273 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:40:48,273 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:40:48,274 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:40:48,274 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:40:48,274 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:40:48,274 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:40:48,291 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-18 22:40:48,293 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-18 22:40:48,382 INFO L126 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-18 22:40:48,382 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:40:48,402 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/167 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:40:48,428 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-18 22:40:48,507 INFO L126 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-18 22:40:48,507 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:40:48,517 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/167 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:40:48,541 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-18 22:40:48,542 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:40:52,104 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 22:40:52,234 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 22:40:52,266 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81965 [2019-12-18 22:40:52,267 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-18 22:40:52,271 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 107 transitions [2019-12-18 22:41:11,012 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123932 states. [2019-12-18 22:41:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand 123932 states. [2019-12-18 22:41:11,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 22:41:11,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:41:11,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 22:41:11,021 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:41:11,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:41:11,026 INFO L82 PathProgramCache]: Analyzing trace with hash 840548, now seen corresponding path program 1 times [2019-12-18 22:41:11,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:41:11,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919775941] [2019-12-18 22:41:11,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:41:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:41:11,311 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 22:41:11,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919775941] [2019-12-18 22:41:11,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:41:11,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:41:11,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503446337] [2019-12-18 22:41:11,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:41:11,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:41:11,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:41:11,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:41:11,342 INFO L87 Difference]: Start difference. First operand 123932 states. Second operand 3 states. [2019-12-18 22:41:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:41:14,451 INFO L93 Difference]: Finished difference Result 123232 states and 527355 transitions. [2019-12-18 22:41:14,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:41:14,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 22:41:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:41:15,333 INFO L225 Difference]: With dead ends: 123232 [2019-12-18 22:41:15,334 INFO L226 Difference]: Without dead ends: 120684 [2019-12-18 22:41:15,335 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 22:41:21,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120684 states. [2019-12-18 22:41:25,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120684 to 120684. [2019-12-18 22:41:25,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120684 states. [2019-12-18 22:41:25,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120684 states to 120684 states and 516967 transitions. [2019-12-18 22:41:25,539 INFO L78 Accepts]: Start accepts. Automaton has 120684 states and 516967 transitions. Word has length 3 [2019-12-18 22:41:25,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:41:25,539 INFO L462 AbstractCegarLoop]: Abstraction has 120684 states and 516967 transitions. [2019-12-18 22:41:25,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:41:25,539 INFO L276 IsEmpty]: Start isEmpty. Operand 120684 states and 516967 transitions. [2019-12-18 22:41:25,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:41:25,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:41:25,544 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:41:25,544 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:41:25,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:41:25,545 INFO L82 PathProgramCache]: Analyzing trace with hash -693264508, now seen corresponding path program 1 times [2019-12-18 22:41:25,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:41:25,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168807107] [2019-12-18 22:41:25,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:41:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:41:25,665 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 22:41:25,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168807107] [2019-12-18 22:41:25,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:41:25,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:41:25,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006813729] [2019-12-18 22:41:25,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:41:25,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:41:25,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:41:25,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:41:25,668 INFO L87 Difference]: Start difference. First operand 120684 states and 516967 transitions. Second operand 4 states. [2019-12-18 22:41:31,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:41:31,220 INFO L93 Difference]: Finished difference Result 188314 states and 770960 transitions. [2019-12-18 22:41:31,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:41:31,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:41:31,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:41:32,570 INFO L225 Difference]: With dead ends: 188314 [2019-12-18 22:41:32,571 INFO L226 Difference]: Without dead ends: 188265 [2019-12-18 22:41:32,572 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 22:41:40,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188265 states. [2019-12-18 22:41:44,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188265 to 173329. [2019-12-18 22:41:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173329 states. [2019-12-18 22:41:44,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173329 states to 173329 states and 717928 transitions. [2019-12-18 22:41:44,785 INFO L78 Accepts]: Start accepts. Automaton has 173329 states and 717928 transitions. Word has length 11 [2019-12-18 22:41:44,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:41:44,785 INFO L462 AbstractCegarLoop]: Abstraction has 173329 states and 717928 transitions. [2019-12-18 22:41:44,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:41:44,786 INFO L276 IsEmpty]: Start isEmpty. Operand 173329 states and 717928 transitions. [2019-12-18 22:41:44,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:41:44,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:41:44,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:41:44,797 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:41:44,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:41:44,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1884384651, now seen corresponding path program 1 times [2019-12-18 22:41:44,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:41:44,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718508774] [2019-12-18 22:41:44,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:41:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:41:44,868 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 22:41:44,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718508774] [2019-12-18 22:41:44,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:41:44,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:41:44,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947811885] [2019-12-18 22:41:44,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:41:44,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:41:44,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:41:44,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:41:44,872 INFO L87 Difference]: Start difference. First operand 173329 states and 717928 transitions. Second operand 3 states. [2019-12-18 22:41:45,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:41:45,006 INFO L93 Difference]: Finished difference Result 34664 states and 112616 transitions. [2019-12-18 22:41:45,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:41:45,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 22:41:45,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:41:45,060 INFO L225 Difference]: With dead ends: 34664 [2019-12-18 22:41:45,060 INFO L226 Difference]: Without dead ends: 34664 [2019-12-18 22:41:45,060 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 22:41:45,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34664 states. [2019-12-18 22:41:51,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34664 to 34664. [2019-12-18 22:41:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34664 states. [2019-12-18 22:41:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34664 states to 34664 states and 112616 transitions. [2019-12-18 22:41:51,138 INFO L78 Accepts]: Start accepts. Automaton has 34664 states and 112616 transitions. Word has length 13 [2019-12-18 22:41:51,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:41:51,138 INFO L462 AbstractCegarLoop]: Abstraction has 34664 states and 112616 transitions. [2019-12-18 22:41:51,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:41:51,138 INFO L276 IsEmpty]: Start isEmpty. Operand 34664 states and 112616 transitions. [2019-12-18 22:41:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:41:51,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:41:51,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:41:51,140 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:41:51,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:41:51,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2074529167, now seen corresponding path program 1 times [2019-12-18 22:41:51,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:41:51,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552976374] [2019-12-18 22:41:51,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:41:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:41:51,200 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 22:41:51,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552976374] [2019-12-18 22:41:51,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:41:51,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:41:51,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111963306] [2019-12-18 22:41:51,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:41:51,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:41:51,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:41:51,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:41:51,203 INFO L87 Difference]: Start difference. First operand 34664 states and 112616 transitions. Second operand 4 states. [2019-12-18 22:41:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:41:51,619 INFO L93 Difference]: Finished difference Result 46077 states and 146183 transitions. [2019-12-18 22:41:51,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:41:51,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:41:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:41:51,686 INFO L225 Difference]: With dead ends: 46077 [2019-12-18 22:41:51,687 INFO L226 Difference]: Without dead ends: 46070 [2019-12-18 22:41:51,687 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 22:41:51,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46070 states. [2019-12-18 22:41:52,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46070 to 40619. [2019-12-18 22:41:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40619 states. [2019-12-18 22:41:52,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40619 states to 40619 states and 130997 transitions. [2019-12-18 22:41:52,770 INFO L78 Accepts]: Start accepts. Automaton has 40619 states and 130997 transitions. Word has length 13 [2019-12-18 22:41:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:41:52,771 INFO L462 AbstractCegarLoop]: Abstraction has 40619 states and 130997 transitions. [2019-12-18 22:41:52,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:41:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 40619 states and 130997 transitions. [2019-12-18 22:41:52,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:41:52,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:41:52,776 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:41:52,776 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:41:52,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:41:52,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1372726712, now seen corresponding path program 1 times [2019-12-18 22:41:52,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:41:52,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680853827] [2019-12-18 22:41:52,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:41:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:41:52,854 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 22:41:52,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680853827] [2019-12-18 22:41:52,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:41:52,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:41:52,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261641301] [2019-12-18 22:41:52,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:41:52,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:41:52,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:41:52,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:41:52,856 INFO L87 Difference]: Start difference. First operand 40619 states and 130997 transitions. Second operand 5 states. [2019-12-18 22:41:53,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:41:53,651 INFO L93 Difference]: Finished difference Result 54297 states and 171188 transitions. [2019-12-18 22:41:53,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:41:53,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 22:41:53,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:41:53,742 INFO L225 Difference]: With dead ends: 54297 [2019-12-18 22:41:53,743 INFO L226 Difference]: Without dead ends: 54284 [2019-12-18 22:41:53,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:41:53,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54284 states. [2019-12-18 22:41:54,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54284 to 40933. [2019-12-18 22:41:54,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40933 states. [2019-12-18 22:41:55,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40933 states to 40933 states and 131862 transitions. [2019-12-18 22:41:55,037 INFO L78 Accepts]: Start accepts. Automaton has 40933 states and 131862 transitions. Word has length 19 [2019-12-18 22:41:55,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:41:55,037 INFO L462 AbstractCegarLoop]: Abstraction has 40933 states and 131862 transitions. [2019-12-18 22:41:55,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:41:55,037 INFO L276 IsEmpty]: Start isEmpty. Operand 40933 states and 131862 transitions. [2019-12-18 22:41:55,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:41:55,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:41:55,049 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 22:41:55,050 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:41:55,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:41:55,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1682135623, now seen corresponding path program 1 times [2019-12-18 22:41:55,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:41:55,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111800967] [2019-12-18 22:41:55,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:41:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:41:55,116 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 22:41:55,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111800967] [2019-12-18 22:41:55,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:41:55,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:41:55,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722668016] [2019-12-18 22:41:55,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:41:55,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:41:55,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:41:55,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:41:55,119 INFO L87 Difference]: Start difference. First operand 40933 states and 131862 transitions. Second operand 4 states. [2019-12-18 22:41:55,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:41:55,164 INFO L93 Difference]: Finished difference Result 7502 states and 20469 transitions. [2019-12-18 22:41:55,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:41:55,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:41:55,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:41:55,184 INFO L225 Difference]: With dead ends: 7502 [2019-12-18 22:41:55,185 INFO L226 Difference]: Without dead ends: 7502 [2019-12-18 22:41:55,185 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 22:41:55,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7502 states. [2019-12-18 22:41:55,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7502 to 7390. [2019-12-18 22:41:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7390 states. [2019-12-18 22:41:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 20149 transitions. [2019-12-18 22:41:55,286 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 20149 transitions. Word has length 25 [2019-12-18 22:41:55,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:41:55,286 INFO L462 AbstractCegarLoop]: Abstraction has 7390 states and 20149 transitions. [2019-12-18 22:41:55,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:41:55,286 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 20149 transitions. [2019-12-18 22:41:55,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 22:41:55,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:41:55,298 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] [2019-12-18 22:41:55,298 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:41:55,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:41:55,299 INFO L82 PathProgramCache]: Analyzing trace with hash -2147477439, now seen corresponding path program 1 times [2019-12-18 22:41:55,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:41:55,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221796473] [2019-12-18 22:41:55,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:41:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:41:55,407 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 22:41:55,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221796473] [2019-12-18 22:41:55,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:41:55,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:41:55,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866580252] [2019-12-18 22:41:55,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:41:55,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:41:55,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:41:55,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:41:55,409 INFO L87 Difference]: Start difference. First operand 7390 states and 20149 transitions. Second operand 5 states. [2019-12-18 22:41:55,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:41:55,450 INFO L93 Difference]: Finished difference Result 5312 states and 15267 transitions. [2019-12-18 22:41:55,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:41:55,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 22:41:55,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:41:55,458 INFO L225 Difference]: With dead ends: 5312 [2019-12-18 22:41:55,459 INFO L226 Difference]: Without dead ends: 5312 [2019-12-18 22:41:55,459 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 22:41:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-18 22:41:55,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-18 22:41:55,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-18 22:41:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14283 transitions. [2019-12-18 22:41:55,560 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14283 transitions. Word has length 37 [2019-12-18 22:41:55,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:41:55,561 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14283 transitions. [2019-12-18 22:41:55,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:41:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14283 transitions. [2019-12-18 22:41:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:41:55,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:41:55,571 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:41:55,572 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:41:55,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:41:55,572 INFO L82 PathProgramCache]: Analyzing trace with hash -314622142, now seen corresponding path program 1 times [2019-12-18 22:41:55,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:41:55,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652380728] [2019-12-18 22:41:55,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:41:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:41:55,648 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 22:41:55,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652380728] [2019-12-18 22:41:55,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:41:55,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:41:55,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038105490] [2019-12-18 22:41:55,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:41:55,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:41:55,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:41:55,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:41:55,650 INFO L87 Difference]: Start difference. First operand 4948 states and 14283 transitions. Second operand 3 states. [2019-12-18 22:41:55,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:41:55,710 INFO L93 Difference]: Finished difference Result 4959 states and 14299 transitions. [2019-12-18 22:41:55,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:41:55,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:41:55,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:41:55,720 INFO L225 Difference]: With dead ends: 4959 [2019-12-18 22:41:55,720 INFO L226 Difference]: Without dead ends: 4959 [2019-12-18 22:41:55,720 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 22:41:55,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2019-12-18 22:41:55,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4955. [2019-12-18 22:41:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4955 states. [2019-12-18 22:41:55,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 14295 transitions. [2019-12-18 22:41:55,791 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 14295 transitions. Word has length 65 [2019-12-18 22:41:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:41:55,793 INFO L462 AbstractCegarLoop]: Abstraction has 4955 states and 14295 transitions. [2019-12-18 22:41:55,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:41:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 14295 transitions. [2019-12-18 22:41:55,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:41:55,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:41:55,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:41:55,803 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:41:55,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:41:55,803 INFO L82 PathProgramCache]: Analyzing trace with hash 143495123, now seen corresponding path program 1 times [2019-12-18 22:41:55,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:41:55,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316844792] [2019-12-18 22:41:55,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:41:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:41:55,920 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 22:41:55,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316844792] [2019-12-18 22:41:55,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:41:55,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:41:55,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712648452] [2019-12-18 22:41:55,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:41:55,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:41:55,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:41:55,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:41:55,922 INFO L87 Difference]: Start difference. First operand 4955 states and 14295 transitions. Second operand 5 states. [2019-12-18 22:41:56,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:41:56,226 INFO L93 Difference]: Finished difference Result 7546 states and 21560 transitions. [2019-12-18 22:41:56,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:41:56,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 22:41:56,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:41:56,236 INFO L225 Difference]: With dead ends: 7546 [2019-12-18 22:41:56,236 INFO L226 Difference]: Without dead ends: 7546 [2019-12-18 22:41:56,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:41:56,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2019-12-18 22:41:56,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 6352. [2019-12-18 22:41:56,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-12-18 22:41:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 18330 transitions. [2019-12-18 22:41:56,328 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 18330 transitions. Word has length 65 [2019-12-18 22:41:56,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:41:56,329 INFO L462 AbstractCegarLoop]: Abstraction has 6352 states and 18330 transitions. [2019-12-18 22:41:56,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:41:56,329 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 18330 transitions. [2019-12-18 22:41:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:41:56,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:41:56,337 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:41:56,338 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:41:56,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:41:56,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1279878861, now seen corresponding path program 2 times [2019-12-18 22:41:56,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:41:56,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913417571] [2019-12-18 22:41:56,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:41:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:41:56,460 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 22:41:56,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913417571] [2019-12-18 22:41:56,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:41:56,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:41:56,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197596514] [2019-12-18 22:41:56,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:41:56,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:41:56,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:41:56,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:41:56,463 INFO L87 Difference]: Start difference. First operand 6352 states and 18330 transitions. Second operand 6 states. [2019-12-18 22:41:56,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:41:56,953 INFO L93 Difference]: Finished difference Result 10887 states and 31211 transitions. [2019-12-18 22:41:56,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:41:56,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 22:41:56,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:41:56,968 INFO L225 Difference]: With dead ends: 10887 [2019-12-18 22:41:56,968 INFO L226 Difference]: Without dead ends: 10887 [2019-12-18 22:41:56,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:41:56,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2019-12-18 22:41:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 7014. [2019-12-18 22:41:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7014 states. [2019-12-18 22:41:57,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 20308 transitions. [2019-12-18 22:41:57,084 INFO L78 Accepts]: Start accepts. Automaton has 7014 states and 20308 transitions. Word has length 65 [2019-12-18 22:41:57,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:41:57,085 INFO L462 AbstractCegarLoop]: Abstraction has 7014 states and 20308 transitions. [2019-12-18 22:41:57,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:41:57,085 INFO L276 IsEmpty]: Start isEmpty. Operand 7014 states and 20308 transitions. [2019-12-18 22:41:57,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:41:57,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:41:57,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:41:57,094 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:41:57,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:41:57,095 INFO L82 PathProgramCache]: Analyzing trace with hash -817749225, now seen corresponding path program 3 times [2019-12-18 22:41:57,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:41:57,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079273594] [2019-12-18 22:41:57,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:41:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:41:57,246 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 22:41:57,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079273594] [2019-12-18 22:41:57,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:41:57,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:41:57,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106134728] [2019-12-18 22:41:57,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:41:57,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:41:57,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:41:57,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:41:57,248 INFO L87 Difference]: Start difference. First operand 7014 states and 20308 transitions. Second operand 7 states. [2019-12-18 22:41:58,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:41:58,108 INFO L93 Difference]: Finished difference Result 10694 states and 30653 transitions. [2019-12-18 22:41:58,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 22:41:58,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 22:41:58,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:41:58,122 INFO L225 Difference]: With dead ends: 10694 [2019-12-18 22:41:58,123 INFO L226 Difference]: Without dead ends: 10694 [2019-12-18 22:41:58,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:41:58,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10694 states. [2019-12-18 22:41:58,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10694 to 6618. [2019-12-18 22:41:58,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6618 states. [2019-12-18 22:41:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6618 states to 6618 states and 19145 transitions. [2019-12-18 22:41:58,436 INFO L78 Accepts]: Start accepts. Automaton has 6618 states and 19145 transitions. Word has length 65 [2019-12-18 22:41:58,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:41:58,436 INFO L462 AbstractCegarLoop]: Abstraction has 6618 states and 19145 transitions. [2019-12-18 22:41:58,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:41:58,436 INFO L276 IsEmpty]: Start isEmpty. Operand 6618 states and 19145 transitions. [2019-12-18 22:41:58,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:41:58,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:41:58,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:41:58,445 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:41:58,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:41:58,446 INFO L82 PathProgramCache]: Analyzing trace with hash 976501587, now seen corresponding path program 4 times [2019-12-18 22:41:58,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:41:58,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439777192] [2019-12-18 22:41:58,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:41:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:41:58,603 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 22:41:58,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439777192] [2019-12-18 22:41:58,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:41:58,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:41:58,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249050795] [2019-12-18 22:41:58,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:41:58,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:41:58,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:41:58,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:41:58,605 INFO L87 Difference]: Start difference. First operand 6618 states and 19145 transitions. Second operand 6 states. [2019-12-18 22:41:59,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:41:59,170 INFO L93 Difference]: Finished difference Result 9282 states and 26363 transitions. [2019-12-18 22:41:59,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:41:59,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 22:41:59,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:41:59,182 INFO L225 Difference]: With dead ends: 9282 [2019-12-18 22:41:59,183 INFO L226 Difference]: Without dead ends: 9282 [2019-12-18 22:41:59,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:41:59,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9282 states. [2019-12-18 22:41:59,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9282 to 6875. [2019-12-18 22:41:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6875 states. [2019-12-18 22:41:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6875 states to 6875 states and 19889 transitions. [2019-12-18 22:41:59,292 INFO L78 Accepts]: Start accepts. Automaton has 6875 states and 19889 transitions. Word has length 65 [2019-12-18 22:41:59,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:41:59,292 INFO L462 AbstractCegarLoop]: Abstraction has 6875 states and 19889 transitions. [2019-12-18 22:41:59,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:41:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 6875 states and 19889 transitions. [2019-12-18 22:41:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:41:59,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:41:59,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:41:59,302 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:41:59,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:41:59,303 INFO L82 PathProgramCache]: Analyzing trace with hash -514720539, now seen corresponding path program 5 times [2019-12-18 22:41:59,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:41:59,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616599214] [2019-12-18 22:41:59,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:41:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:41:59,412 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 22:41:59,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616599214] [2019-12-18 22:41:59,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:41:59,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:41:59,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762332636] [2019-12-18 22:41:59,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:41:59,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:41:59,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:41:59,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:41:59,415 INFO L87 Difference]: Start difference. First operand 6875 states and 19889 transitions. Second operand 6 states. [2019-12-18 22:41:59,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:41:59,902 INFO L93 Difference]: Finished difference Result 11086 states and 31830 transitions. [2019-12-18 22:41:59,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:41:59,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 22:41:59,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:41:59,917 INFO L225 Difference]: With dead ends: 11086 [2019-12-18 22:41:59,917 INFO L226 Difference]: Without dead ends: 11086 [2019-12-18 22:41:59,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:41:59,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11086 states. [2019-12-18 22:42:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11086 to 7343. [2019-12-18 22:42:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7343 states. [2019-12-18 22:42:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7343 states to 7343 states and 21315 transitions. [2019-12-18 22:42:00,057 INFO L78 Accepts]: Start accepts. Automaton has 7343 states and 21315 transitions. Word has length 65 [2019-12-18 22:42:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:00,057 INFO L462 AbstractCegarLoop]: Abstraction has 7343 states and 21315 transitions. [2019-12-18 22:42:00,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:42:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 7343 states and 21315 transitions. [2019-12-18 22:42:00,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:42:00,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:00,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:42:00,068 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:00,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:00,068 INFO L82 PathProgramCache]: Analyzing trace with hash -508911177, now seen corresponding path program 6 times [2019-12-18 22:42:00,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:00,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85796729] [2019-12-18 22:42:00,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:00,201 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 22:42:00,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85796729] [2019-12-18 22:42:00,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:00,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:42:00,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328890175] [2019-12-18 22:42:00,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:42:00,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:00,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:42:00,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:42:00,203 INFO L87 Difference]: Start difference. First operand 7343 states and 21315 transitions. Second operand 7 states. [2019-12-18 22:42:01,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:01,063 INFO L93 Difference]: Finished difference Result 12666 states and 36293 transitions. [2019-12-18 22:42:01,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 22:42:01,063 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 22:42:01,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:01,079 INFO L225 Difference]: With dead ends: 12666 [2019-12-18 22:42:01,080 INFO L226 Difference]: Without dead ends: 12666 [2019-12-18 22:42:01,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:42:01,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12666 states. [2019-12-18 22:42:01,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12666 to 7367. [2019-12-18 22:42:01,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7367 states. [2019-12-18 22:42:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7367 states to 7367 states and 21373 transitions. [2019-12-18 22:42:01,209 INFO L78 Accepts]: Start accepts. Automaton has 7367 states and 21373 transitions. Word has length 65 [2019-12-18 22:42:01,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:01,209 INFO L462 AbstractCegarLoop]: Abstraction has 7367 states and 21373 transitions. [2019-12-18 22:42:01,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:42:01,209 INFO L276 IsEmpty]: Start isEmpty. Operand 7367 states and 21373 transitions. [2019-12-18 22:42:01,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:42:01,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:42:01,220 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:01,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:01,220 INFO L82 PathProgramCache]: Analyzing trace with hash -90199991, now seen corresponding path program 7 times [2019-12-18 22:42:01,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:01,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640372416] [2019-12-18 22:42:01,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:01,364 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 22:42:01,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640372416] [2019-12-18 22:42:01,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:01,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:42:01,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969696098] [2019-12-18 22:42:01,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:42:01,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:01,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:42:01,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:42:01,367 INFO L87 Difference]: Start difference. First operand 7367 states and 21373 transitions. Second operand 7 states. [2019-12-18 22:42:01,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:01,958 INFO L93 Difference]: Finished difference Result 11344 states and 32286 transitions. [2019-12-18 22:42:01,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:42:01,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 22:42:01,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:01,973 INFO L225 Difference]: With dead ends: 11344 [2019-12-18 22:42:01,973 INFO L226 Difference]: Without dead ends: 11344 [2019-12-18 22:42:01,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:42:02,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11344 states. [2019-12-18 22:42:02,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11344 to 8251. [2019-12-18 22:42:02,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8251 states. [2019-12-18 22:42:02,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8251 states to 8251 states and 23907 transitions. [2019-12-18 22:42:02,098 INFO L78 Accepts]: Start accepts. Automaton has 8251 states and 23907 transitions. Word has length 65 [2019-12-18 22:42:02,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:02,098 INFO L462 AbstractCegarLoop]: Abstraction has 8251 states and 23907 transitions. [2019-12-18 22:42:02,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:42:02,098 INFO L276 IsEmpty]: Start isEmpty. Operand 8251 states and 23907 transitions. [2019-12-18 22:42:02,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:42:02,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:02,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:42:02,107 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:02,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:02,107 INFO L82 PathProgramCache]: Analyzing trace with hash -853632375, now seen corresponding path program 8 times [2019-12-18 22:42:02,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:02,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44425422] [2019-12-18 22:42:02,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:02,389 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 22:42:02,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44425422] [2019-12-18 22:42:02,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:02,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:42:02,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860345384] [2019-12-18 22:42:02,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:42:02,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:02,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:42:02,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:42:02,393 INFO L87 Difference]: Start difference. First operand 8251 states and 23907 transitions. Second operand 7 states. [2019-12-18 22:42:03,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:03,360 INFO L93 Difference]: Finished difference Result 11822 states and 33660 transitions. [2019-12-18 22:42:03,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 22:42:03,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 22:42:03,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:03,375 INFO L225 Difference]: With dead ends: 11822 [2019-12-18 22:42:03,376 INFO L226 Difference]: Without dead ends: 11822 [2019-12-18 22:42:03,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-12-18 22:42:03,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2019-12-18 22:42:03,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 7779. [2019-12-18 22:42:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7779 states. [2019-12-18 22:42:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7779 states to 7779 states and 22603 transitions. [2019-12-18 22:42:03,499 INFO L78 Accepts]: Start accepts. Automaton has 7779 states and 22603 transitions. Word has length 65 [2019-12-18 22:42:03,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:03,499 INFO L462 AbstractCegarLoop]: Abstraction has 7779 states and 22603 transitions. [2019-12-18 22:42:03,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:42:03,499 INFO L276 IsEmpty]: Start isEmpty. Operand 7779 states and 22603 transitions. [2019-12-18 22:42:03,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:42:03,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:03,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:42:03,507 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:03,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:03,508 INFO L82 PathProgramCache]: Analyzing trace with hash -985821357, now seen corresponding path program 9 times [2019-12-18 22:42:03,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:03,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541670507] [2019-12-18 22:42:03,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:03,571 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 22:42:03,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541670507] [2019-12-18 22:42:03,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:03,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:42:03,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497262005] [2019-12-18 22:42:03,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:42:03,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:03,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:42:03,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:42:03,573 INFO L87 Difference]: Start difference. First operand 7779 states and 22603 transitions. Second operand 3 states. [2019-12-18 22:42:03,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:03,605 INFO L93 Difference]: Finished difference Result 6639 states and 18933 transitions. [2019-12-18 22:42:03,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:42:03,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:42:03,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:03,615 INFO L225 Difference]: With dead ends: 6639 [2019-12-18 22:42:03,615 INFO L226 Difference]: Without dead ends: 6639 [2019-12-18 22:42:03,616 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 22:42:03,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6639 states. [2019-12-18 22:42:03,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6639 to 6639. [2019-12-18 22:42:03,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6639 states. [2019-12-18 22:42:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6639 states to 6639 states and 18933 transitions. [2019-12-18 22:42:03,709 INFO L78 Accepts]: Start accepts. Automaton has 6639 states and 18933 transitions. Word has length 65 [2019-12-18 22:42:03,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:03,709 INFO L462 AbstractCegarLoop]: Abstraction has 6639 states and 18933 transitions. [2019-12-18 22:42:03,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:42:03,709 INFO L276 IsEmpty]: Start isEmpty. Operand 6639 states and 18933 transitions. [2019-12-18 22:42:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:42:03,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:03,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:42:03,715 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:03,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:03,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1574627286, now seen corresponding path program 1 times [2019-12-18 22:42:03,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:03,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61993203] [2019-12-18 22:42:03,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:42:03,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61993203] [2019-12-18 22:42:03,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:03,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:42:03,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569752280] [2019-12-18 22:42:03,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:42:03,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:03,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:42:03,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:42:03,912 INFO L87 Difference]: Start difference. First operand 6639 states and 18933 transitions. Second operand 10 states. [2019-12-18 22:42:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:05,248 INFO L93 Difference]: Finished difference Result 13348 states and 38162 transitions. [2019-12-18 22:42:05,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 22:42:05,249 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 22:42:05,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:05,265 INFO L225 Difference]: With dead ends: 13348 [2019-12-18 22:42:05,265 INFO L226 Difference]: Without dead ends: 13348 [2019-12-18 22:42:05,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-12-18 22:42:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13348 states. [2019-12-18 22:42:05,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13348 to 6903. [2019-12-18 22:42:05,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6903 states. [2019-12-18 22:42:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6903 states to 6903 states and 19783 transitions. [2019-12-18 22:42:05,395 INFO L78 Accepts]: Start accepts. Automaton has 6903 states and 19783 transitions. Word has length 66 [2019-12-18 22:42:05,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:05,396 INFO L462 AbstractCegarLoop]: Abstraction has 6903 states and 19783 transitions. [2019-12-18 22:42:05,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:42:05,396 INFO L276 IsEmpty]: Start isEmpty. Operand 6903 states and 19783 transitions. [2019-12-18 22:42:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:42:05,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:05,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:42:05,403 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:05,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:05,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1781036024, now seen corresponding path program 2 times [2019-12-18 22:42:05,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:05,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291606738] [2019-12-18 22:42:05,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:05,469 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 22:42:05,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291606738] [2019-12-18 22:42:05,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:05,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:42:05,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475061376] [2019-12-18 22:42:05,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:42:05,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:05,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:42:05,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:42:05,471 INFO L87 Difference]: Start difference. First operand 6903 states and 19783 transitions. Second operand 3 states. [2019-12-18 22:42:05,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:05,510 INFO L93 Difference]: Finished difference Result 5788 states and 16285 transitions. [2019-12-18 22:42:05,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:42:05,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 22:42:05,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:05,519 INFO L225 Difference]: With dead ends: 5788 [2019-12-18 22:42:05,519 INFO L226 Difference]: Without dead ends: 5788 [2019-12-18 22:42:05,520 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 22:42:05,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5788 states. [2019-12-18 22:42:05,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5788 to 5620. [2019-12-18 22:42:05,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5620 states. [2019-12-18 22:42:05,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5620 states to 5620 states and 15769 transitions. [2019-12-18 22:42:05,679 INFO L78 Accepts]: Start accepts. Automaton has 5620 states and 15769 transitions. Word has length 66 [2019-12-18 22:42:05,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:05,680 INFO L462 AbstractCegarLoop]: Abstraction has 5620 states and 15769 transitions. [2019-12-18 22:42:05,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:42:05,680 INFO L276 IsEmpty]: Start isEmpty. Operand 5620 states and 15769 transitions. [2019-12-18 22:42:05,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:42:05,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:05,691 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:42:05,691 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:05,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:05,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1215710032, now seen corresponding path program 1 times [2019-12-18 22:42:05,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:05,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814441662] [2019-12-18 22:42:05,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:05,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:42:05,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814441662] [2019-12-18 22:42:05,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:05,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:42:05,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320989926] [2019-12-18 22:42:05,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:42:05,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:05,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:42:05,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:42:05,796 INFO L87 Difference]: Start difference. First operand 5620 states and 15769 transitions. Second operand 3 states. [2019-12-18 22:42:05,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:05,879 INFO L93 Difference]: Finished difference Result 5620 states and 15768 transitions. [2019-12-18 22:42:05,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:42:05,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 22:42:05,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:05,891 INFO L225 Difference]: With dead ends: 5620 [2019-12-18 22:42:05,892 INFO L226 Difference]: Without dead ends: 5620 [2019-12-18 22:42:05,892 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 22:42:05,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5620 states. [2019-12-18 22:42:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5620 to 2990. [2019-12-18 22:42:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2990 states. [2019-12-18 22:42:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 8464 transitions. [2019-12-18 22:42:06,007 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 8464 transitions. Word has length 67 [2019-12-18 22:42:06,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:06,008 INFO L462 AbstractCegarLoop]: Abstraction has 2990 states and 8464 transitions. [2019-12-18 22:42:06,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:42:06,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 8464 transitions. [2019-12-18 22:42:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:42:06,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:06,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:42:06,014 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:06,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:06,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1708175791, now seen corresponding path program 1 times [2019-12-18 22:42:06,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:06,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106580511] [2019-12-18 22:42:06,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:06,485 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 22:42:06,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106580511] [2019-12-18 22:42:06,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:06,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 22:42:06,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852719803] [2019-12-18 22:42:06,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 22:42:06,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:06,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 22:42:06,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-12-18 22:42:06,488 INFO L87 Difference]: Start difference. First operand 2990 states and 8464 transitions. Second operand 18 states. [2019-12-18 22:42:06,706 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-18 22:42:09,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:09,102 INFO L93 Difference]: Finished difference Result 8917 states and 24992 transitions. [2019-12-18 22:42:09,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 22:42:09,102 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2019-12-18 22:42:09,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:09,115 INFO L225 Difference]: With dead ends: 8917 [2019-12-18 22:42:09,116 INFO L226 Difference]: Without dead ends: 8884 [2019-12-18 22:42:09,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=353, Invalid=2097, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 22:42:09,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8884 states. [2019-12-18 22:42:09,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8884 to 4143. [2019-12-18 22:42:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4143 states. [2019-12-18 22:42:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 11564 transitions. [2019-12-18 22:42:09,203 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 11564 transitions. Word has length 68 [2019-12-18 22:42:09,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:09,204 INFO L462 AbstractCegarLoop]: Abstraction has 4143 states and 11564 transitions. [2019-12-18 22:42:09,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 22:42:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 11564 transitions. [2019-12-18 22:42:09,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:42:09,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:09,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:42:09,208 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:09,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:09,209 INFO L82 PathProgramCache]: Analyzing trace with hash -987957935, now seen corresponding path program 2 times [2019-12-18 22:42:09,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:09,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318149721] [2019-12-18 22:42:09,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:09,465 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 22:42:09,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318149721] [2019-12-18 22:42:09,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:09,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 22:42:09,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975893018] [2019-12-18 22:42:09,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 22:42:09,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:09,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 22:42:09,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:42:09,467 INFO L87 Difference]: Start difference. First operand 4143 states and 11564 transitions. Second operand 14 states. [2019-12-18 22:42:10,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:10,113 INFO L93 Difference]: Finished difference Result 7693 states and 21750 transitions. [2019-12-18 22:42:10,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 22:42:10,114 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-18 22:42:10,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:10,125 INFO L225 Difference]: With dead ends: 7693 [2019-12-18 22:42:10,125 INFO L226 Difference]: Without dead ends: 7660 [2019-12-18 22:42:10,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=743, Unknown=0, NotChecked=0, Total=930 [2019-12-18 22:42:10,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7660 states. [2019-12-18 22:42:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7660 to 4145. [2019-12-18 22:42:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4145 states. [2019-12-18 22:42:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 11627 transitions. [2019-12-18 22:42:10,204 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 11627 transitions. Word has length 68 [2019-12-18 22:42:10,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:10,205 INFO L462 AbstractCegarLoop]: Abstraction has 4145 states and 11627 transitions. [2019-12-18 22:42:10,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 22:42:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 11627 transitions. [2019-12-18 22:42:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:42:10,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:10,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:42:10,209 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:10,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:10,210 INFO L82 PathProgramCache]: Analyzing trace with hash 947098105, now seen corresponding path program 3 times [2019-12-18 22:42:10,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:10,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204544902] [2019-12-18 22:42:10,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:42:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:42:10,330 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:42:10,332 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:42:10,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~y$r_buff0_thd3~0_18 0) (= 0 v_~y$w_buff1~0_28) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_17) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff0_used~0_123 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2183~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2183~0.base_27|) |v_ULTIMATE.start_main_~#t2183~0.offset_20| 0)) |v_#memory_int_21|) (= (store .cse0 |v_ULTIMATE.start_main_~#t2183~0.base_27| 1) |v_#valid_63|) (= 0 v_~y$r_buff1_thd0~0_49) (= 0 v_~__unbuffered_cnt~0_20) (= v_~y$r_buff0_thd2~0_20 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_75 0) (= v_~y~0_30 0) (= v_~x~0_13 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_6 0) (= v_~y$mem_tmp~0_11 0) (= 0 v_~weak$$choice2~0_33) (= 0 |v_ULTIMATE.start_main_~#t2183~0.offset_20|) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$r_buff0_thd0~0_83 0) (= 0 v_~y$w_buff0~0_30) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2183~0.base_27| 4)) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff1_thd2~0_17) (= |v_#NULL.offset_5| 0) (= v_~__unbuffered_p2_EAX~0_9 0) (= v_~main$tmp_guard1~0_12 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2183~0.base_27|)) (= 0 |v_#NULL.base_5|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2183~0.base_27|) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ULTIMATE.start_main_~#t2185~0.offset=|v_ULTIMATE.start_main_~#t2185~0.offset_16|, ULTIMATE.start_main_~#t2185~0.base=|v_ULTIMATE.start_main_~#t2185~0.base_19|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_26, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_~#t2183~0.offset=|v_ULTIMATE.start_main_~#t2183~0.offset_20|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_49, ~x~0=v_~x~0_13, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_123, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ULTIMATE.start_main_~#t2183~0.base=|v_ULTIMATE.start_main_~#t2183~0.base_27|, ~y~0=v_~y~0_30, ULTIMATE.start_main_~#t2184~0.offset=|v_ULTIMATE.start_main_~#t2184~0.offset_18|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ULTIMATE.start_main_~#t2184~0.base=|v_ULTIMATE.start_main_~#t2184~0.base_23|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t2185~0.offset, ULTIMATE.start_main_~#t2185~0.base, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2183~0.offset, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t2183~0.base, ~y~0, ULTIMATE.start_main_~#t2184~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2184~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 22:42:10,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L800-1-->L802: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2184~0.base_11|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2184~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2184~0.base_11|) |v_ULTIMATE.start_main_~#t2184~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t2184~0.base_11| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2184~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t2184~0.offset_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2184~0.base_11| 4) |v_#length_15|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t2184~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2184~0.base=|v_ULTIMATE.start_main_~#t2184~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2184~0.offset=|v_ULTIMATE.start_main_~#t2184~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2184~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2184~0.offset] because there is no mapped edge [2019-12-18 22:42:10,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0_used~0_85) (= 2 v_~y$w_buff0~0_16) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff1_used~0_48 v_~y$w_buff0_used~0_86) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_17 v_~y$w_buff1~0_13) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= 0 (mod v_~y$w_buff1_used~0_48 256)) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_85, ~y$w_buff1~0=v_~y$w_buff1~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_48} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 22:42:10,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L802-1-->L804: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2185~0.base_13| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2185~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2185~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2185~0.base_13|) |v_ULTIMATE.start_main_~#t2185~0.offset_11| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t2185~0.offset_11|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2185~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t2185~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2185~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2185~0.offset=|v_ULTIMATE.start_main_~#t2185~0.offset_11|, ULTIMATE.start_main_~#t2185~0.base=|v_ULTIMATE.start_main_~#t2185~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2185~0.offset, ULTIMATE.start_main_~#t2185~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 22:42:10,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1589524478 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1589524478 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1589524478| ~y$w_buff0_used~0_In1589524478)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1589524478|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1589524478, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1589524478} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1589524478|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1589524478, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1589524478} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:42:10,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L757-2-->L757-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1022967753 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1022967753 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out1022967753| ~y$w_buff1~0_In1022967753) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out1022967753| ~y~0_In1022967753) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1022967753, ~y$w_buff1~0=~y$w_buff1~0_In1022967753, ~y~0=~y~0_In1022967753, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1022967753} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1022967753, ~y$w_buff1~0=~y$w_buff1~0_In1022967753, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1022967753|, ~y~0=~y~0_In1022967753, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1022967753} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 22:42:10,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-778370775 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-778370775 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-778370775 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-778370775 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-778370775 |P0Thread1of1ForFork0_#t~ite6_Out-778370775|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-778370775|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-778370775, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-778370775, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-778370775, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-778370775} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-778370775|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-778370775, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-778370775, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-778370775, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-778370775} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:42:10,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L743-->L744: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1179883109 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1179883109 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out1179883109 ~y$r_buff0_thd1~0_In1179883109) (or .cse0 .cse1)) (and (= ~y$r_buff0_thd1~0_Out1179883109 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1179883109, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1179883109} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1179883109, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1179883109|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1179883109} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:42:10,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1471557093 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In1471557093 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1471557093 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1471557093 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1471557093|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd1~0_In1471557093 |P0Thread1of1ForFork0_#t~ite8_Out1471557093|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1471557093, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1471557093, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1471557093, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1471557093} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1471557093, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1471557093, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1471557093|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1471557093, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1471557093} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:42:10,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 22:42:10,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L777-2-->L777-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd3~0_In-733140774 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-733140774 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-733140774| ~y$w_buff1~0_In-733140774)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out-733140774| ~y~0_In-733140774)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-733140774, ~y$w_buff1~0=~y$w_buff1~0_In-733140774, ~y~0=~y~0_In-733140774, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-733140774} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-733140774, P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-733140774|, ~y$w_buff1~0=~y$w_buff1~0_In-733140774, ~y~0=~y~0_In-733140774, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-733140774} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 22:42:10,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-4-->L778: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~y~0_20) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~y~0=v_~y~0_20, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~y~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 22:42:10,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L757-4-->L758: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_21) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-18 22:42:10,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-222272206 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-222272206 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-222272206| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-222272206 |P1Thread1of1ForFork1_#t~ite11_Out-222272206|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-222272206, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-222272206} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-222272206, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-222272206, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-222272206|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 22:42:10,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L759-->L759-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1535121269 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1535121269 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1535121269 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1535121269 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1535121269|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1535121269 |P1Thread1of1ForFork1_#t~ite12_Out-1535121269|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1535121269, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1535121269, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1535121269, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1535121269} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1535121269, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1535121269, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1535121269, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1535121269|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1535121269} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 22:42:10,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In872264343 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In872264343 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out872264343| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out872264343| ~y$r_buff0_thd2~0_In872264343) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In872264343, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In872264343} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In872264343, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In872264343, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out872264343|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 22:42:10,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1085141671 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1085141671 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1085141671 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1085141671 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1085141671|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In-1085141671 |P1Thread1of1ForFork1_#t~ite14_Out-1085141671|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1085141671, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1085141671, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1085141671, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1085141671} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1085141671, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1085141671, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1085141671, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1085141671|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1085141671} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 22:42:10,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L761-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 22:42:10,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1920148129 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1920148129 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out1920148129|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1920148129 |P2Thread1of1ForFork2_#t~ite17_Out1920148129|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1920148129, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1920148129} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1920148129, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1920148129, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1920148129|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 22:42:10,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1096839059 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1096839059 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1096839059 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1096839059 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out1096839059| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite18_Out1096839059| ~y$w_buff1_used~0_In1096839059) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1096839059, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1096839059, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1096839059, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1096839059} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1096839059, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1096839059, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1096839059, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1096839059|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1096839059} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 22:42:10,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In969149057 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In969149057 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out969149057| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out969149057| ~y$r_buff0_thd3~0_In969149057)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In969149057, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In969149057} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In969149057, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In969149057, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out969149057|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 22:42:10,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In-2145264182 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2145264182 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-2145264182 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2145264182 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite20_Out-2145264182|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-2145264182| ~y$r_buff1_thd3~0_In-2145264182) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2145264182, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2145264182, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2145264182, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2145264182} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2145264182, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2145264182, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-2145264182|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2145264182, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2145264182} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 22:42:10,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L781-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~y$r_buff1_thd3~0_12)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 22:42:10,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:42:10,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L810-2-->L810-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-626234388 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-626234388 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite24_Out-626234388| |ULTIMATE.start_main_#t~ite25_Out-626234388|))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-626234388| ~y$w_buff1~0_In-626234388) (not .cse0) (not .cse1) .cse2) (and (or .cse0 .cse1) (= ~y~0_In-626234388 |ULTIMATE.start_main_#t~ite24_Out-626234388|) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-626234388, ~y~0=~y~0_In-626234388, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-626234388, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-626234388} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-626234388, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-626234388|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-626234388|, ~y~0=~y~0_In-626234388, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-626234388, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-626234388} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 22:42:10,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-263789844 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-263789844 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out-263789844|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-263789844 |ULTIMATE.start_main_#t~ite26_Out-263789844|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-263789844, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-263789844} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-263789844, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-263789844, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-263789844|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 22:42:10,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In1480578119 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1480578119 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1480578119 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1480578119 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1480578119 |ULTIMATE.start_main_#t~ite27_Out1480578119|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite27_Out1480578119| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1480578119, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1480578119, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1480578119, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1480578119} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1480578119, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1480578119, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1480578119|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1480578119, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1480578119} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 22:42:10,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-25829623 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-25829623 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-25829623 |ULTIMATE.start_main_#t~ite28_Out-25829623|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out-25829623| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-25829623, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-25829623} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-25829623|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-25829623, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-25829623} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 22:42:10,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In562844553 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In562844553 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In562844553 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In562844553 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In562844553 |ULTIMATE.start_main_#t~ite29_Out562844553|)) (and (= 0 |ULTIMATE.start_main_#t~ite29_Out562844553|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In562844553, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In562844553, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In562844553, ~y$w_buff1_used~0=~y$w_buff1_used~0_In562844553} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In562844553, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out562844553|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In562844553, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In562844553, ~y$w_buff1_used~0=~y$w_buff1_used~0_In562844553} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 22:42:10,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L823-->L823-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1640985342 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1640985342| |ULTIMATE.start_main_#t~ite38_Out-1640985342|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1640985342 256)))) (or (and .cse0 (= (mod ~y$r_buff1_thd0~0_In-1640985342 256) 0)) (and .cse0 (= (mod ~y$w_buff1_used~0_In-1640985342 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-1640985342 256)))) .cse1 (= |ULTIMATE.start_main_#t~ite38_Out-1640985342| ~y$w_buff1~0_In-1640985342)) (and (= |ULTIMATE.start_main_#t~ite39_Out-1640985342| ~y$w_buff1~0_In-1640985342) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_In-1640985342| |ULTIMATE.start_main_#t~ite38_Out-1640985342|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1640985342, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1640985342, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1640985342, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1640985342|, ~weak$$choice2~0=~weak$$choice2~0_In-1640985342, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1640985342, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1640985342} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1640985342, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1640985342, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1640985342|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1640985342, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1640985342|, ~weak$$choice2~0=~weak$$choice2~0_In-1640985342, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1640985342, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1640985342} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 22:42:10,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L824-->L824-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1092163137 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-1092163137| ~y$w_buff0_used~0_In-1092163137) (= |ULTIMATE.start_main_#t~ite41_In-1092163137| |ULTIMATE.start_main_#t~ite41_Out-1092163137|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1092163137 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1092163137 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1092163137 256))) (and (= (mod ~y$r_buff1_thd0~0_In-1092163137 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite41_Out-1092163137| ~y$w_buff0_used~0_In-1092163137) .cse0 (= |ULTIMATE.start_main_#t~ite42_Out-1092163137| |ULTIMATE.start_main_#t~ite41_Out-1092163137|)))) InVars {ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In-1092163137|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1092163137, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1092163137, ~weak$$choice2~0=~weak$$choice2~0_In-1092163137, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1092163137, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1092163137} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1092163137|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1092163137, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1092163137, ~weak$$choice2~0=~weak$$choice2~0_In-1092163137, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1092163137|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1092163137, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1092163137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 22:42:10,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~y$r_buff0_thd0~0_65 v_~y$r_buff0_thd0~0_64)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 22:42:10,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L829-->L832-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_25 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:42:10,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 22:42:10,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:42:10 BasicIcfg [2019-12-18 22:42:10,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:42:10,457 INFO L168 Benchmark]: Toolchain (without parser) took 84132.55 ms. Allocated memory was 145.8 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 22:42:10,458 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 22:42:10,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.09 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.4 MB in the beginning and 157.4 MB in the end (delta: -56.0 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:42:10,459 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.93 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:42:10,459 INFO L168 Benchmark]: Boogie Preprocessor took 51.99 ms. Allocated memory is still 203.9 MB. Free memory was 154.1 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:42:10,459 INFO L168 Benchmark]: RCFGBuilder took 884.48 ms. Allocated memory is still 203.9 MB. Free memory was 151.5 MB in the beginning and 102.2 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:42:10,460 INFO L168 Benchmark]: TraceAbstraction took 82336.10 ms. Allocated memory was 203.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 22:42:10,463 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 757.09 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.4 MB in the beginning and 157.4 MB in the end (delta: -56.0 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 97.93 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.99 ms. Allocated memory is still 203.9 MB. Free memory was 154.1 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 884.48 ms. Allocated memory is still 203.9 MB. Free memory was 151.5 MB in the beginning and 102.2 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 82336.10 ms. Allocated memory was 203.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 173 ProgramPointsBefore, 96 ProgramPointsAfterwards, 210 TransitionsBefore, 107 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 30 ChoiceCompositions, 5662 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 81965 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t2183, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] FCALL, FORK 0 pthread_create(&t2184, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L804] FCALL, FORK 0 pthread_create(&t2185, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L771] 3 __unbuffered_p2_EAX = x [L774] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0: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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L777] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0: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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 82.0s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3840 SDtfs, 4066 SDslu, 10017 SDs, 0 SdLazy, 8167 SolverSat, 280 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 64 SyntacticMatches, 27 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173329occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 32.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 79445 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1174 NumberOfCodeBlocks, 1174 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1084 ConstructedInterpolants, 0 QuantifiedInterpolants, 243321 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...