/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix031_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:18:40,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:18:40,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:18:40,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:18:40,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:18:40,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:18:40,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:18:40,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:18:40,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:18:40,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:18:40,213 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:18:40,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:18:40,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:18:40,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:18:40,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:18:40,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:18:40,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:18:40,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:18:40,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:18:40,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:18:40,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:18:40,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:18:40,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:18:40,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:18:40,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:18:40,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:18:40,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:18:40,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:18:40,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:18:40,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:18:40,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:18:40,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:18:40,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:18:40,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:18:40,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:18:40,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:18:40,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:18:40,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:18:40,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:18:40,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:18:40,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:18:40,254 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:18:40,268 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:18:40,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:18:40,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:18:40,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:18:40,270 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:18:40,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:18:40,270 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:18:40,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:18:40,270 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:18:40,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:18:40,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:18:40,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:18:40,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:18:40,271 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:18:40,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:18:40,272 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:18:40,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:18:40,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:18:40,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:18:40,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:18:40,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:18:40,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:18:40,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:18:40,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:18:40,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:18:40,274 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:18:40,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:18:40,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:18:40,274 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:18:40,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:18:40,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:18:40,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:18:40,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:18:40,566 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:18:40,566 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:18:40,567 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_power.oepc.i [2019-12-26 22:18:40,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c6b3057/3fefefaf19524057b27048dff3375146/FLAG6ce9d48e5 [2019-12-26 22:18:41,161 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:18:41,162 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_power.oepc.i [2019-12-26 22:18:41,178 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c6b3057/3fefefaf19524057b27048dff3375146/FLAG6ce9d48e5 [2019-12-26 22:18:41,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c6b3057/3fefefaf19524057b27048dff3375146 [2019-12-26 22:18:41,500 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:18:41,502 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:18:41,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:18:41,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:18:41,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:18:41,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:18:41" (1/1) ... [2019-12-26 22:18:41,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b63b91a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:18:41, skipping insertion in model container [2019-12-26 22:18:41,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:18:41" (1/1) ... [2019-12-26 22:18:41,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:18:41,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:18:42,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:18:42,118 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:18:42,212 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:18:42,291 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:18:42,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:18:42 WrapperNode [2019-12-26 22:18:42,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:18:42,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:18:42,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:18:42,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:18:42,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:18:42" (1/1) ... [2019-12-26 22:18:42,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:18:42" (1/1) ... [2019-12-26 22:18:42,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:18:42,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:18:42,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:18:42,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:18:42,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:18:42" (1/1) ... [2019-12-26 22:18:42,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:18:42" (1/1) ... [2019-12-26 22:18:42,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:18:42" (1/1) ... [2019-12-26 22:18:42,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:18:42" (1/1) ... [2019-12-26 22:18:42,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:18:42" (1/1) ... [2019-12-26 22:18:42,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:18:42" (1/1) ... [2019-12-26 22:18:42,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:18:42" (1/1) ... [2019-12-26 22:18:42,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:18:42,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:18:42,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:18:42,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:18:42,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:18:42" (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-26 22:18:42,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:18:42,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:18:42,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:18:42,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:18:42,476 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:18:42,476 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:18:42,476 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:18:42,476 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:18:42,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:18:42,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:18:42,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:18:42,479 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:18:43,153 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:18:43,154 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:18:43,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:18:43 BoogieIcfgContainer [2019-12-26 22:18:43,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:18:43,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:18:43,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:18:43,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:18:43,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:18:41" (1/3) ... [2019-12-26 22:18:43,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d197cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:18:43, skipping insertion in model container [2019-12-26 22:18:43,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:18:42" (2/3) ... [2019-12-26 22:18:43,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d197cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:18:43, skipping insertion in model container [2019-12-26 22:18:43,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:18:43" (3/3) ... [2019-12-26 22:18:43,164 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_power.oepc.i [2019-12-26 22:18:43,175 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:18:43,176 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:18:43,185 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:18:43,186 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:18:43,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,242 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,243 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,243 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,244 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,244 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,258 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,259 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,316 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,317 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,317 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,322 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,325 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:18:43,343 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 22:18:43,365 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:18:43,365 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:18:43,365 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:18:43,365 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:18:43,365 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:18:43,366 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:18:43,366 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:18:43,366 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:18:43,387 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 185 transitions [2019-12-26 22:18:43,389 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-26 22:18:43,499 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-26 22:18:43,500 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:18:43,514 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 22:18:43,533 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-26 22:18:43,579 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-26 22:18:43,579 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:18:43,585 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 22:18:43,600 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-26 22:18:43,601 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:18:48,425 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-26 22:18:49,114 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-26 22:18:49,234 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 22:18:49,257 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55357 [2019-12-26 22:18:49,258 INFO L214 etLargeBlockEncoding]: Total number of compositions: 107 [2019-12-26 22:18:49,261 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-26 22:18:49,708 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-26 22:18:49,710 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-26 22:18:49,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 22:18:49,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:49,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 22:18:49,719 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:49,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:49,727 INFO L82 PathProgramCache]: Analyzing trace with hash 801135, now seen corresponding path program 1 times [2019-12-26 22:18:49,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:49,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100119427] [2019-12-26 22:18:49,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:49,937 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-26 22:18:49,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100119427] [2019-12-26 22:18:49,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:49,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:18:49,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342674913] [2019-12-26 22:18:49,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:18:49,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:49,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:18:49,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:18:49,962 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-26 22:18:50,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:50,224 INFO L93 Difference]: Finished difference Result 8472 states and 28002 transitions. [2019-12-26 22:18:50,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:18:50,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 22:18:50,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:50,329 INFO L225 Difference]: With dead ends: 8472 [2019-12-26 22:18:50,329 INFO L226 Difference]: Without dead ends: 7980 [2019-12-26 22:18:50,331 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-26 22:18:50,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7980 states. [2019-12-26 22:18:50,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7980 to 7980. [2019-12-26 22:18:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7980 states. [2019-12-26 22:18:50,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7980 states to 7980 states and 26329 transitions. [2019-12-26 22:18:50,835 INFO L78 Accepts]: Start accepts. Automaton has 7980 states and 26329 transitions. Word has length 3 [2019-12-26 22:18:50,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:50,835 INFO L462 AbstractCegarLoop]: Abstraction has 7980 states and 26329 transitions. [2019-12-26 22:18:50,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:18:50,835 INFO L276 IsEmpty]: Start isEmpty. Operand 7980 states and 26329 transitions. [2019-12-26 22:18:50,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:18:50,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:50,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:18:50,842 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:50,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:50,842 INFO L82 PathProgramCache]: Analyzing trace with hash -337363797, now seen corresponding path program 1 times [2019-12-26 22:18:50,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:50,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212893130] [2019-12-26 22:18:50,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:50,969 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-26 22:18:50,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212893130] [2019-12-26 22:18:50,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:50,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:18:50,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257788117] [2019-12-26 22:18:50,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:18:50,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:50,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:18:50,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:18:50,973 INFO L87 Difference]: Start difference. First operand 7980 states and 26329 transitions. Second operand 3 states. [2019-12-26 22:18:51,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:51,023 INFO L93 Difference]: Finished difference Result 1284 states and 2972 transitions. [2019-12-26 22:18:51,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:18:51,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-26 22:18:51,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:51,033 INFO L225 Difference]: With dead ends: 1284 [2019-12-26 22:18:51,033 INFO L226 Difference]: Without dead ends: 1284 [2019-12-26 22:18:51,036 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-26 22:18:51,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-12-26 22:18:51,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1284. [2019-12-26 22:18:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-12-26 22:18:51,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2972 transitions. [2019-12-26 22:18:51,090 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2972 transitions. Word has length 11 [2019-12-26 22:18:51,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:51,091 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 2972 transitions. [2019-12-26 22:18:51,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:18:51,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2972 transitions. [2019-12-26 22:18:51,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:18:51,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:51,099 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:18:51,099 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:51,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:51,100 INFO L82 PathProgramCache]: Analyzing trace with hash 254708639, now seen corresponding path program 1 times [2019-12-26 22:18:51,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:51,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187483820] [2019-12-26 22:18:51,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:51,198 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-26 22:18:51,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187483820] [2019-12-26 22:18:51,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:51,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:18:51,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599209355] [2019-12-26 22:18:51,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:18:51,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:51,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:18:51,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:18:51,201 INFO L87 Difference]: Start difference. First operand 1284 states and 2972 transitions. Second operand 3 states. [2019-12-26 22:18:51,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:51,291 INFO L93 Difference]: Finished difference Result 1993 states and 4593 transitions. [2019-12-26 22:18:51,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:18:51,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-26 22:18:51,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:51,303 INFO L225 Difference]: With dead ends: 1993 [2019-12-26 22:18:51,303 INFO L226 Difference]: Without dead ends: 1993 [2019-12-26 22:18:51,304 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-26 22:18:51,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2019-12-26 22:18:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1444. [2019-12-26 22:18:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-12-26 22:18:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 3429 transitions. [2019-12-26 22:18:51,355 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 3429 transitions. Word has length 14 [2019-12-26 22:18:51,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:51,355 INFO L462 AbstractCegarLoop]: Abstraction has 1444 states and 3429 transitions. [2019-12-26 22:18:51,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:18:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 3429 transitions. [2019-12-26 22:18:51,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:18:51,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:51,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:18:51,357 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:51,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:51,358 INFO L82 PathProgramCache]: Analyzing trace with hash 254810970, now seen corresponding path program 1 times [2019-12-26 22:18:51,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:51,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246961925] [2019-12-26 22:18:51,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:51,420 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-26 22:18:51,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246961925] [2019-12-26 22:18:51,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:51,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:18:51,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072336846] [2019-12-26 22:18:51,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:18:51,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:51,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:18:51,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:18:51,423 INFO L87 Difference]: Start difference. First operand 1444 states and 3429 transitions. Second operand 4 states. [2019-12-26 22:18:51,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:51,629 INFO L93 Difference]: Finished difference Result 1803 states and 4159 transitions. [2019-12-26 22:18:51,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:18:51,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 22:18:51,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:51,639 INFO L225 Difference]: With dead ends: 1803 [2019-12-26 22:18:51,640 INFO L226 Difference]: Without dead ends: 1803 [2019-12-26 22:18:51,640 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-26 22:18:51,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-12-26 22:18:51,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1739. [2019-12-26 22:18:51,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2019-12-26 22:18:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 4035 transitions. [2019-12-26 22:18:51,702 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 4035 transitions. Word has length 14 [2019-12-26 22:18:51,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:51,703 INFO L462 AbstractCegarLoop]: Abstraction has 1739 states and 4035 transitions. [2019-12-26 22:18:51,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:18:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 4035 transitions. [2019-12-26 22:18:51,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:18:51,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:51,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:18:51,706 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:51,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:51,706 INFO L82 PathProgramCache]: Analyzing trace with hash 32652836, now seen corresponding path program 1 times [2019-12-26 22:18:51,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:51,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320181281] [2019-12-26 22:18:51,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:51,812 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-26 22:18:51,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320181281] [2019-12-26 22:18:51,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:51,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:18:51,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954255658] [2019-12-26 22:18:51,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:18:51,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:51,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:18:51,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:18:51,815 INFO L87 Difference]: Start difference. First operand 1739 states and 4035 transitions. Second operand 4 states. [2019-12-26 22:18:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:52,017 INFO L93 Difference]: Finished difference Result 2116 states and 4835 transitions. [2019-12-26 22:18:52,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:18:52,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 22:18:52,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:52,029 INFO L225 Difference]: With dead ends: 2116 [2019-12-26 22:18:52,030 INFO L226 Difference]: Without dead ends: 2116 [2019-12-26 22:18:52,030 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-26 22:18:52,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-12-26 22:18:52,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1856. [2019-12-26 22:18:52,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1856 states. [2019-12-26 22:18:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 4299 transitions. [2019-12-26 22:18:52,077 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 4299 transitions. Word has length 14 [2019-12-26 22:18:52,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:52,077 INFO L462 AbstractCegarLoop]: Abstraction has 1856 states and 4299 transitions. [2019-12-26 22:18:52,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:18:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 4299 transitions. [2019-12-26 22:18:52,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:18:52,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:52,080 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-26 22:18:52,081 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:52,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:52,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1595600556, now seen corresponding path program 1 times [2019-12-26 22:18:52,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:52,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881196287] [2019-12-26 22:18:52,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:52,168 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-26 22:18:52,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881196287] [2019-12-26 22:18:52,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:52,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:18:52,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389596507] [2019-12-26 22:18:52,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:18:52,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:52,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:18:52,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:18:52,171 INFO L87 Difference]: Start difference. First operand 1856 states and 4299 transitions. Second operand 5 states. [2019-12-26 22:18:52,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:52,597 INFO L93 Difference]: Finished difference Result 2383 states and 5349 transitions. [2019-12-26 22:18:52,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:18:52,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-26 22:18:52,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:52,623 INFO L225 Difference]: With dead ends: 2383 [2019-12-26 22:18:52,624 INFO L226 Difference]: Without dead ends: 2383 [2019-12-26 22:18:52,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:18:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-12-26 22:18:52,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2127. [2019-12-26 22:18:52,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-12-26 22:18:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 4855 transitions. [2019-12-26 22:18:52,693 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 4855 transitions. Word has length 25 [2019-12-26 22:18:52,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:52,694 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 4855 transitions. [2019-12-26 22:18:52,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:18:52,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 4855 transitions. [2019-12-26 22:18:52,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 22:18:52,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:52,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:18:52,697 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:52,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:52,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1878239565, now seen corresponding path program 1 times [2019-12-26 22:18:52,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:52,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177499809] [2019-12-26 22:18:52,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:52,779 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-26 22:18:52,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177499809] [2019-12-26 22:18:52,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:52,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:18:52,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691502389] [2019-12-26 22:18:52,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:18:52,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:52,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:18:52,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:18:52,782 INFO L87 Difference]: Start difference. First operand 2127 states and 4855 transitions. Second operand 3 states. [2019-12-26 22:18:52,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:52,800 INFO L93 Difference]: Finished difference Result 2126 states and 4853 transitions. [2019-12-26 22:18:52,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:18:52,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-26 22:18:52,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:52,815 INFO L225 Difference]: With dead ends: 2126 [2019-12-26 22:18:52,815 INFO L226 Difference]: Without dead ends: 2126 [2019-12-26 22:18:52,816 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-26 22:18:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2019-12-26 22:18:52,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2126. [2019-12-26 22:18:52,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2126 states. [2019-12-26 22:18:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 4853 transitions. [2019-12-26 22:18:52,879 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 4853 transitions. Word has length 26 [2019-12-26 22:18:52,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:52,879 INFO L462 AbstractCegarLoop]: Abstraction has 2126 states and 4853 transitions. [2019-12-26 22:18:52,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:18:52,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 4853 transitions. [2019-12-26 22:18:52,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 22:18:52,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:52,883 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] [2019-12-26 22:18:52,883 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:52,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:52,883 INFO L82 PathProgramCache]: Analyzing trace with hash 532711466, now seen corresponding path program 1 times [2019-12-26 22:18:52,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:52,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50387446] [2019-12-26 22:18:52,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:53,005 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-26 22:18:53,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50387446] [2019-12-26 22:18:53,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:53,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:18:53,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114858230] [2019-12-26 22:18:53,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:18:53,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:53,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:18:53,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:18:53,009 INFO L87 Difference]: Start difference. First operand 2126 states and 4853 transitions. Second operand 5 states. [2019-12-26 22:18:53,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:53,249 INFO L93 Difference]: Finished difference Result 2503 states and 5587 transitions. [2019-12-26 22:18:53,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:18:53,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-26 22:18:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:53,256 INFO L225 Difference]: With dead ends: 2503 [2019-12-26 22:18:53,257 INFO L226 Difference]: Without dead ends: 2503 [2019-12-26 22:18:53,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:18:53,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2019-12-26 22:18:53,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 1976. [2019-12-26 22:18:53,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2019-12-26 22:18:53,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 4537 transitions. [2019-12-26 22:18:53,318 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 4537 transitions. Word has length 26 [2019-12-26 22:18:53,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:53,319 INFO L462 AbstractCegarLoop]: Abstraction has 1976 states and 4537 transitions. [2019-12-26 22:18:53,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:18:53,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 4537 transitions. [2019-12-26 22:18:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:18:53,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:53,322 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] [2019-12-26 22:18:53,322 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:53,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:53,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1895680429, now seen corresponding path program 1 times [2019-12-26 22:18:53,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:53,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207529220] [2019-12-26 22:18:53,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:53,373 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-26 22:18:53,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207529220] [2019-12-26 22:18:53,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:53,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:18:53,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674951823] [2019-12-26 22:18:53,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:18:53,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:53,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:18:53,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:18:53,376 INFO L87 Difference]: Start difference. First operand 1976 states and 4537 transitions. Second operand 4 states. [2019-12-26 22:18:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:53,421 INFO L93 Difference]: Finished difference Result 3149 states and 7351 transitions. [2019-12-26 22:18:53,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:18:53,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-26 22:18:53,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:53,428 INFO L225 Difference]: With dead ends: 3149 [2019-12-26 22:18:53,428 INFO L226 Difference]: Without dead ends: 1449 [2019-12-26 22:18:53,429 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-26 22:18:53,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2019-12-26 22:18:53,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1433. [2019-12-26 22:18:53,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2019-12-26 22:18:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 3305 transitions. [2019-12-26 22:18:53,470 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 3305 transitions. Word has length 27 [2019-12-26 22:18:53,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:53,471 INFO L462 AbstractCegarLoop]: Abstraction has 1433 states and 3305 transitions. [2019-12-26 22:18:53,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:18:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 3305 transitions. [2019-12-26 22:18:53,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:18:53,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:53,474 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] [2019-12-26 22:18:53,474 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:53,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:53,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1902769443, now seen corresponding path program 2 times [2019-12-26 22:18:53,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:53,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700067127] [2019-12-26 22:18:53,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:53,550 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-26 22:18:53,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700067127] [2019-12-26 22:18:53,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:53,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:18:53,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051160065] [2019-12-26 22:18:53,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:18:53,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:53,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:18:53,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:18:53,553 INFO L87 Difference]: Start difference. First operand 1433 states and 3305 transitions. Second operand 5 states. [2019-12-26 22:18:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:54,062 INFO L93 Difference]: Finished difference Result 2262 states and 5074 transitions. [2019-12-26 22:18:54,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:18:54,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 22:18:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:54,068 INFO L225 Difference]: With dead ends: 2262 [2019-12-26 22:18:54,069 INFO L226 Difference]: Without dead ends: 2262 [2019-12-26 22:18:54,069 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-26 22:18:54,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2019-12-26 22:18:54,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 2061. [2019-12-26 22:18:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2061 states. [2019-12-26 22:18:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 4683 transitions. [2019-12-26 22:18:54,114 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 4683 transitions. Word has length 27 [2019-12-26 22:18:54,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:54,115 INFO L462 AbstractCegarLoop]: Abstraction has 2061 states and 4683 transitions. [2019-12-26 22:18:54,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:18:54,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 4683 transitions. [2019-12-26 22:18:54,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 22:18:54,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:54,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:18:54,119 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:54,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:54,120 INFO L82 PathProgramCache]: Analyzing trace with hash -348234267, now seen corresponding path program 1 times [2019-12-26 22:18:54,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:54,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486857042] [2019-12-26 22:18:54,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:54,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486857042] [2019-12-26 22:18:54,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:54,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:18:54,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163199500] [2019-12-26 22:18:54,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:18:54,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:54,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:18:54,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:18:54,163 INFO L87 Difference]: Start difference. First operand 2061 states and 4683 transitions. Second operand 4 states. [2019-12-26 22:18:54,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:54,181 INFO L93 Difference]: Finished difference Result 1113 states and 2397 transitions. [2019-12-26 22:18:54,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:18:54,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-26 22:18:54,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:54,184 INFO L225 Difference]: With dead ends: 1113 [2019-12-26 22:18:54,184 INFO L226 Difference]: Without dead ends: 1002 [2019-12-26 22:18:54,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-26 22:18:54,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-12-26 22:18:54,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 960. [2019-12-26 22:18:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-12-26 22:18:54,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 2144 transitions. [2019-12-26 22:18:54,204 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 2144 transitions. Word has length 28 [2019-12-26 22:18:54,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:54,205 INFO L462 AbstractCegarLoop]: Abstraction has 960 states and 2144 transitions. [2019-12-26 22:18:54,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:18:54,205 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 2144 transitions. [2019-12-26 22:18:54,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 22:18:54,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:54,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] [2019-12-26 22:18:54,209 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:54,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:54,209 INFO L82 PathProgramCache]: Analyzing trace with hash -359202268, now seen corresponding path program 1 times [2019-12-26 22:18:54,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:54,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905131512] [2019-12-26 22:18:54,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:54,310 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-26 22:18:54,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905131512] [2019-12-26 22:18:54,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:54,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:18:54,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457613027] [2019-12-26 22:18:54,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:18:54,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:54,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:18:54,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:18:54,312 INFO L87 Difference]: Start difference. First operand 960 states and 2144 transitions. Second operand 7 states. [2019-12-26 22:18:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:54,624 INFO L93 Difference]: Finished difference Result 2777 states and 5836 transitions. [2019-12-26 22:18:54,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 22:18:54,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-26 22:18:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:54,629 INFO L225 Difference]: With dead ends: 2777 [2019-12-26 22:18:54,629 INFO L226 Difference]: Without dead ends: 1853 [2019-12-26 22:18:54,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-26 22:18:54,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-12-26 22:18:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 998. [2019-12-26 22:18:54,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-12-26 22:18:54,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2203 transitions. [2019-12-26 22:18:54,658 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2203 transitions. Word has length 51 [2019-12-26 22:18:54,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:54,659 INFO L462 AbstractCegarLoop]: Abstraction has 998 states and 2203 transitions. [2019-12-26 22:18:54,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:18:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2203 transitions. [2019-12-26 22:18:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 22:18:54,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:54,662 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] [2019-12-26 22:18:54,662 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:54,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:54,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1598138544, now seen corresponding path program 2 times [2019-12-26 22:18:54,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:54,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403055673] [2019-12-26 22:18:54,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:54,722 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-26 22:18:54,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403055673] [2019-12-26 22:18:54,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:54,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:18:54,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947987611] [2019-12-26 22:18:54,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:18:54,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:54,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:18:54,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:18:54,725 INFO L87 Difference]: Start difference. First operand 998 states and 2203 transitions. Second operand 3 states. [2019-12-26 22:18:54,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:54,776 INFO L93 Difference]: Finished difference Result 1234 states and 2682 transitions. [2019-12-26 22:18:54,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:18:54,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-26 22:18:54,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:54,781 INFO L225 Difference]: With dead ends: 1234 [2019-12-26 22:18:54,781 INFO L226 Difference]: Without dead ends: 1234 [2019-12-26 22:18:54,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-26 22:18:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2019-12-26 22:18:54,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1032. [2019-12-26 22:18:54,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2019-12-26 22:18:54,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 2281 transitions. [2019-12-26 22:18:54,804 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 2281 transitions. Word has length 51 [2019-12-26 22:18:54,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:54,804 INFO L462 AbstractCegarLoop]: Abstraction has 1032 states and 2281 transitions. [2019-12-26 22:18:54,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:18:54,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 2281 transitions. [2019-12-26 22:18:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 22:18:54,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:54,807 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] [2019-12-26 22:18:54,807 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:54,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:54,808 INFO L82 PathProgramCache]: Analyzing trace with hash -232907078, now seen corresponding path program 1 times [2019-12-26 22:18:54,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:54,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071822741] [2019-12-26 22:18:54,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:54,850 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-26 22:18:54,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071822741] [2019-12-26 22:18:54,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:54,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:18:54,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475904018] [2019-12-26 22:18:54,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:18:54,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:54,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:18:54,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:18:54,852 INFO L87 Difference]: Start difference. First operand 1032 states and 2281 transitions. Second operand 4 states. [2019-12-26 22:18:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:55,061 INFO L93 Difference]: Finished difference Result 1622 states and 3562 transitions. [2019-12-26 22:18:55,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:18:55,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-26 22:18:55,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:55,066 INFO L225 Difference]: With dead ends: 1622 [2019-12-26 22:18:55,066 INFO L226 Difference]: Without dead ends: 1622 [2019-12-26 22:18:55,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-26 22:18:55,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2019-12-26 22:18:55,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1091. [2019-12-26 22:18:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1091 states. [2019-12-26 22:18:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 2427 transitions. [2019-12-26 22:18:55,093 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 2427 transitions. Word has length 52 [2019-12-26 22:18:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:55,094 INFO L462 AbstractCegarLoop]: Abstraction has 1091 states and 2427 transitions. [2019-12-26 22:18:55,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:18:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 2427 transitions. [2019-12-26 22:18:55,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 22:18:55,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:55,097 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] [2019-12-26 22:18:55,097 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:55,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:55,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1437488850, now seen corresponding path program 1 times [2019-12-26 22:18:55,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:55,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110190235] [2019-12-26 22:18:55,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:55,163 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-26 22:18:55,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110190235] [2019-12-26 22:18:55,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:55,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:18:55,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927144887] [2019-12-26 22:18:55,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:18:55,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:55,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:18:55,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:18:55,166 INFO L87 Difference]: Start difference. First operand 1091 states and 2427 transitions. Second operand 5 states. [2019-12-26 22:18:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:55,477 INFO L93 Difference]: Finished difference Result 1436 states and 3139 transitions. [2019-12-26 22:18:55,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:18:55,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-26 22:18:55,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:55,482 INFO L225 Difference]: With dead ends: 1436 [2019-12-26 22:18:55,482 INFO L226 Difference]: Without dead ends: 1436 [2019-12-26 22:18:55,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:18:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2019-12-26 22:18:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1284. [2019-12-26 22:18:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-12-26 22:18:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2836 transitions. [2019-12-26 22:18:55,506 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2836 transitions. Word has length 52 [2019-12-26 22:18:55,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:55,507 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 2836 transitions. [2019-12-26 22:18:55,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:18:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2836 transitions. [2019-12-26 22:18:55,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 22:18:55,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:55,510 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] [2019-12-26 22:18:55,510 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:55,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:55,511 INFO L82 PathProgramCache]: Analyzing trace with hash 905926424, now seen corresponding path program 1 times [2019-12-26 22:18:55,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:55,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602816123] [2019-12-26 22:18:55,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:55,592 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-26 22:18:55,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602816123] [2019-12-26 22:18:55,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:55,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:18:55,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761596190] [2019-12-26 22:18:55,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:18:55,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:55,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:18:55,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:18:55,594 INFO L87 Difference]: Start difference. First operand 1284 states and 2836 transitions. Second operand 7 states. [2019-12-26 22:18:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:55,849 INFO L93 Difference]: Finished difference Result 2874 states and 6031 transitions. [2019-12-26 22:18:55,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:18:55,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-26 22:18:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:55,855 INFO L225 Difference]: With dead ends: 2874 [2019-12-26 22:18:55,856 INFO L226 Difference]: Without dead ends: 2405 [2019-12-26 22:18:55,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:18:55,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2019-12-26 22:18:55,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 1279. [2019-12-26 22:18:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-12-26 22:18:55,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 2821 transitions. [2019-12-26 22:18:55,886 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 2821 transitions. Word has length 52 [2019-12-26 22:18:55,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:55,887 INFO L462 AbstractCegarLoop]: Abstraction has 1279 states and 2821 transitions. [2019-12-26 22:18:55,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:18:55,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 2821 transitions. [2019-12-26 22:18:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 22:18:55,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:55,890 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] [2019-12-26 22:18:55,891 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:55,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:55,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1875488952, now seen corresponding path program 2 times [2019-12-26 22:18:55,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:55,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220095660] [2019-12-26 22:18:55,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:55,960 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-26 22:18:55,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220095660] [2019-12-26 22:18:55,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:55,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:18:55,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49737979] [2019-12-26 22:18:55,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:18:55,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:55,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:18:55,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:18:55,962 INFO L87 Difference]: Start difference. First operand 1279 states and 2821 transitions. Second operand 4 states. [2019-12-26 22:18:56,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:56,030 INFO L93 Difference]: Finished difference Result 1279 states and 2807 transitions. [2019-12-26 22:18:56,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:18:56,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-26 22:18:56,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:56,033 INFO L225 Difference]: With dead ends: 1279 [2019-12-26 22:18:56,034 INFO L226 Difference]: Without dead ends: 1279 [2019-12-26 22:18:56,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:18:56,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-12-26 22:18:56,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1161. [2019-12-26 22:18:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-12-26 22:18:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 2543 transitions. [2019-12-26 22:18:56,053 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 2543 transitions. Word has length 52 [2019-12-26 22:18:56,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:56,053 INFO L462 AbstractCegarLoop]: Abstraction has 1161 states and 2543 transitions. [2019-12-26 22:18:56,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:18:56,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 2543 transitions. [2019-12-26 22:18:56,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 22:18:56,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:56,057 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] [2019-12-26 22:18:56,057 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:56,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:56,057 INFO L82 PathProgramCache]: Analyzing trace with hash -976265928, now seen corresponding path program 1 times [2019-12-26 22:18:56,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:56,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813071446] [2019-12-26 22:18:56,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:56,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813071446] [2019-12-26 22:18:56,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:56,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:18:56,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532153418] [2019-12-26 22:18:56,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:18:56,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:56,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:18:56,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:18:56,170 INFO L87 Difference]: Start difference. First operand 1161 states and 2543 transitions. Second operand 3 states. [2019-12-26 22:18:56,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:56,186 INFO L93 Difference]: Finished difference Result 1160 states and 2541 transitions. [2019-12-26 22:18:56,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:18:56,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 22:18:56,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:56,190 INFO L225 Difference]: With dead ends: 1160 [2019-12-26 22:18:56,190 INFO L226 Difference]: Without dead ends: 1160 [2019-12-26 22:18:56,191 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-26 22:18:56,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-12-26 22:18:56,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1053. [2019-12-26 22:18:56,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2019-12-26 22:18:56,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 2347 transitions. [2019-12-26 22:18:56,217 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 2347 transitions. Word has length 52 [2019-12-26 22:18:56,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:56,217 INFO L462 AbstractCegarLoop]: Abstraction has 1053 states and 2347 transitions. [2019-12-26 22:18:56,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:18:56,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 2347 transitions. [2019-12-26 22:18:56,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 22:18:56,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:56,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:18:56,222 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:56,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:56,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1691396374, now seen corresponding path program 1 times [2019-12-26 22:18:56,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:56,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853888132] [2019-12-26 22:18:56,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:18:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:18:56,395 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:18:56,395 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:18:56,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t833~0.base_35|)) (= 0 v_~a$w_buff1~0_316) (= (store .cse0 |v_ULTIMATE.start_main_~#t833~0.base_35| 1) |v_#valid_63|) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_cnt~0_62) (= v_~z~0_11 0) (= 0 v_~a$read_delayed~0_7) (= v_~y~0_90 0) (= 0 v_~a$r_buff1_thd2~0_271) (= v_~__unbuffered_p1_EBX~0_60 0) (= v_~a$flush_delayed~0_23 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= |v_ULTIMATE.start_main_~#t833~0.offset_23| 0) (= 0 v_~a$w_buff0_used~0_830) (= 0 v_~a$w_buff1_used~0_501) (= 0 |v_#NULL.base_4|) (= v_~x~0_85 0) (= 0 v_~a$r_buff1_thd1~0_132) (= 0 v_~weak$$choice0~0_11) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t833~0.base_35| 4)) (= 0 v_~a$r_buff0_thd1~0_236) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~a$r_buff0_thd2~0_373) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t833~0.base_35| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t833~0.base_35|) |v_ULTIMATE.start_main_~#t833~0.offset_23| 0)) |v_#memory_int_13|) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_115 0) (= v_~a$mem_tmp~0_14 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t833~0.base_35|) (= v_~weak$$choice2~0_107 0) (= v_~a~0_150 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~a$r_buff1_thd0~0_178 0) (= v_~a$r_buff0_thd0~0_163 0) (= v_~a$w_buff0~0_518 0) (= 0 v_~__unbuffered_p1_EAX~0_46) (= 0 v_~__unbuffered_p0_EAX~0_117))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_271, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_373, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_163, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ULTIMATE.start_main_~#t834~0.base=|v_ULTIMATE.start_main_~#t834~0.base_27|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~a~0=v_~a~0_150, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_117, ~a$w_buff1~0=v_~a$w_buff1~0_316, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_60, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_115, ULTIMATE.start_main_~#t833~0.offset=|v_ULTIMATE.start_main_~#t833~0.offset_23|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_132, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_830, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_236, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_95|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_87|, ULTIMATE.start_main_~#t834~0.offset=|v_ULTIMATE.start_main_~#t834~0.offset_16|, ~a$w_buff0~0=v_~a$w_buff0~0_518, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_178, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_11, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_501, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~x~0=v_~x~0_85, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t833~0.base=|v_ULTIMATE.start_main_~#t833~0.base_35|} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, #NULL.offset, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t834~0.base, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t833~0.offset, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t834~0.offset, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t833~0.base] because there is no mapped edge [2019-12-26 22:18:56,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->L4-3: Formula: (and (= 0 (mod ~a$w_buff1_used~0_Out50118505 256)) (= ~a$w_buff0~0_Out50118505 1) (= |P0Thread1of1ForFork0_#in~arg.base_In50118505| P0Thread1of1ForFork0_~arg.base_Out50118505) (= ~a$w_buff0_used~0_Out50118505 1) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out50118505|) (= ~a$w_buff1_used~0_Out50118505 ~a$w_buff0_used~0_In50118505) (= ~a$w_buff0~0_In50118505 ~a$w_buff1~0_Out50118505) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out50118505| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out50118505) (= |P0Thread1of1ForFork0_#in~arg.offset_In50118505| P0Thread1of1ForFork0_~arg.offset_Out50118505)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In50118505|, ~a$w_buff0~0=~a$w_buff0~0_In50118505, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In50118505|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In50118505} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In50118505|, ~a$w_buff1~0=~a$w_buff1~0_Out50118505, ~a$w_buff0~0=~a$w_buff0~0_Out50118505, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out50118505, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In50118505|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out50118505, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out50118505, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out50118505, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out50118505|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out50118505} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 22:18:56,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L814-1-->L816: Formula: (and (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t834~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t834~0.base_10| 0)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t834~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t834~0.base_10|) |v_ULTIMATE.start_main_~#t834~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t834~0.offset_9| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t834~0.base_10| 4) |v_#length_9|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t834~0.base_10|) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t834~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t834~0.base=|v_ULTIMATE.start_main_~#t834~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t834~0.offset=|v_ULTIMATE.start_main_~#t834~0.offset_9|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t834~0.base, ULTIMATE.start_main_~#t834~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-26 22:18:56,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L783-->L783-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In158420549 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In158420549 256)))) (or (and (= 0 (mod ~a$r_buff1_thd2~0_In158420549 256)) .cse0) (and .cse0 (= (mod ~a$w_buff1_used~0_In158420549 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In158420549 256)))) .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out158420549| ~a$w_buff1_used~0_In158420549) (= |P1Thread1of1ForFork1_#t~ite23_Out158420549| |P1Thread1of1ForFork1_#t~ite24_Out158420549|)) (and (= ~a$w_buff1_used~0_In158420549 |P1Thread1of1ForFork1_#t~ite24_Out158420549|) (= |P1Thread1of1ForFork1_#t~ite23_In158420549| |P1Thread1of1ForFork1_#t~ite23_Out158420549|) (not .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In158420549, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In158420549, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In158420549|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In158420549, ~a$w_buff1_used~0=~a$w_buff1_used~0_In158420549, ~weak$$choice2~0=~weak$$choice2~0_In158420549} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In158420549, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out158420549|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In158420549, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out158420549|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In158420549, ~a$w_buff1_used~0=~a$w_buff1_used~0_In158420549, ~weak$$choice2~0=~weak$$choice2~0_In158420549} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-26 22:18:56,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= (mod v_~weak$$choice2~0_38 256) 0)) (= v_~a$r_buff0_thd2~0_146 v_~a$r_buff0_thd2~0_147)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_147, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_38, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_12|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-26 22:18:56,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1466959347 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1466959347 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1466959347| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1466959347| ~a$w_buff0_used~0_In-1466959347)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1466959347, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1466959347} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1466959347|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1466959347, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1466959347} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 22:18:56,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd1~0_In1248637767 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In1248637767 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1248637767 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In1248637767 256)))) (or (and (= ~a$w_buff1_used~0_In1248637767 |P0Thread1of1ForFork0_#t~ite6_Out1248637767|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1248637767| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1248637767, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1248637767, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1248637767, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1248637767} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1248637767|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1248637767, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1248637767, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1248637767, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1248637767} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 22:18:56,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-597842992 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-597842992 256)))) (or (and (= ~a$r_buff0_thd1~0_In-597842992 ~a$r_buff0_thd1~0_Out-597842992) (or .cse0 .cse1)) (and (= 0 ~a$r_buff0_thd1~0_Out-597842992) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-597842992, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-597842992} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-597842992|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-597842992, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-597842992} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:18:56,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-585205706 256))) (.cse3 (= (mod ~a$r_buff1_thd1~0_In-585205706 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-585205706 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-585205706 256)))) (or (and (= ~a$r_buff1_thd1~0_In-585205706 |P0Thread1of1ForFork0_#t~ite8_Out-585205706|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-585205706|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-585205706, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-585205706, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-585205706, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-585205706} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-585205706, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-585205706|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-585205706, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-585205706, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-585205706} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 22:18:56,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L756-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 22:18:56,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_14 256))) (= v_~a~0_48 v_~a$mem_tmp~0_7) (= v_~a$flush_delayed~0_13 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_14} OutVars{~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_13|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-26 22:18:56,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out458076364| |P1Thread1of1ForFork1_#t~ite32_Out458076364|)) (.cse2 (= (mod ~a$w_buff1_used~0_In458076364 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In458076364 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out458076364| ~a$w_buff1~0_In458076364) (not .cse0) .cse1 (not .cse2)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out458076364| ~a~0_In458076364) .cse1 (or .cse2 .cse0)))) InVars {~a~0=~a~0_In458076364, ~a$w_buff1~0=~a$w_buff1~0_In458076364, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In458076364, ~a$w_buff1_used~0=~a$w_buff1_used~0_In458076364} OutVars{~a~0=~a~0_In458076364, ~a$w_buff1~0=~a$w_buff1~0_In458076364, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In458076364, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out458076364|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out458076364|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In458076364} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-26 22:18:56,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In2089011326 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In2089011326 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out2089011326| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out2089011326| ~a$w_buff0_used~0_In2089011326)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2089011326, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2089011326} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out2089011326|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2089011326, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2089011326} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 22:18:56,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In501525473 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In501525473 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In501525473 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In501525473 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In501525473 |P1Thread1of1ForFork1_#t~ite35_Out501525473|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out501525473|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In501525473, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In501525473, ~a$w_buff0_used~0=~a$w_buff0_used~0_In501525473, ~a$w_buff1_used~0=~a$w_buff1_used~0_In501525473} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In501525473, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In501525473, ~a$w_buff0_used~0=~a$w_buff0_used~0_In501525473, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out501525473|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In501525473} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 22:18:56,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-2123950717 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-2123950717 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-2123950717|)) (and (= ~a$r_buff0_thd2~0_In-2123950717 |P1Thread1of1ForFork1_#t~ite36_Out-2123950717|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2123950717, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2123950717} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2123950717, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2123950717, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-2123950717|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 22:18:56,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In498797607 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd2~0_In498797607 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In498797607 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In498797607 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out498797607| ~a$r_buff1_thd2~0_In498797607) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out498797607| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In498797607, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In498797607, ~a$w_buff0_used~0=~a$w_buff0_used~0_In498797607, ~a$w_buff1_used~0=~a$w_buff1_used~0_In498797607} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In498797607, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In498797607, ~a$w_buff0_used~0=~a$w_buff0_used~0_In498797607, ~a$w_buff1_used~0=~a$w_buff1_used~0_In498797607, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out498797607|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 22:18:56,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L795-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite37_24| v_~a$r_buff1_thd2~0_110) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_24|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_23|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 22:18:56,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-26 22:18:56,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-2042424134 256))) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-2042424134 256) 0))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In-2042424134 |ULTIMATE.start_main_#t~ite40_Out-2042424134|)) (and (= ~a~0_In-2042424134 |ULTIMATE.start_main_#t~ite40_Out-2042424134|) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-2042424134, ~a$w_buff1~0=~a$w_buff1~0_In-2042424134, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2042424134, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2042424134} OutVars{~a~0=~a~0_In-2042424134, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2042424134|, ~a$w_buff1~0=~a$w_buff1~0_In-2042424134, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2042424134, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2042424134} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 22:18:56,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_26 |v_ULTIMATE.start_main_#t~ite40_17|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|} OutVars{~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 22:18:56,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-888846018 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-888846018 256)))) (or (and (= ~a$w_buff0_used~0_In-888846018 |ULTIMATE.start_main_#t~ite42_Out-888846018|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-888846018|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-888846018, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-888846018} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-888846018, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-888846018, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-888846018|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:18:56,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-669141802 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-669141802 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-669141802 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-669141802 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-669141802| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-669141802| ~a$w_buff1_used~0_In-669141802) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-669141802, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-669141802, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-669141802, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-669141802} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-669141802, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-669141802, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-669141802, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-669141802, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-669141802|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 22:18:56,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In1792074034 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1792074034 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out1792074034|) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd0~0_In1792074034 |ULTIMATE.start_main_#t~ite44_Out1792074034|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1792074034, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1792074034} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1792074034, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1792074034, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1792074034|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 22:18:56,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In1199835025 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In1199835025 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In1199835025 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In1199835025 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1199835025| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1199835025| ~a$r_buff1_thd0~0_In1199835025)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1199835025, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1199835025, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1199835025, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1199835025} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1199835025, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1199835025, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1199835025, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1199835025, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1199835025|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 22:18:56,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~a$r_buff1_thd0~0_147 |v_ULTIMATE.start_main_#t~ite45_39|) (= v_~__unbuffered_p1_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_86 0) (= 1 v_~__unbuffered_p1_EAX~0_18) (= 1 v_~__unbuffered_p0_EAX~0_88) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_147, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:18:56,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:18:56 BasicIcfg [2019-12-26 22:18:56,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:18:56,535 INFO L168 Benchmark]: Toolchain (without parser) took 15033.19 ms. Allocated memory was 146.8 MB in the beginning and 424.7 MB in the end (delta: 277.9 MB). Free memory was 103.2 MB in the beginning and 109.8 MB in the end (delta: -6.6 MB). Peak memory consumption was 271.3 MB. Max. memory is 7.1 GB. [2019-12-26 22:18:56,536 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 22:18:56,537 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.72 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 102.8 MB in the beginning and 158.5 MB in the end (delta: -55.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:18:56,538 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.71 ms. Allocated memory is still 204.5 MB. Free memory was 158.5 MB in the beginning and 155.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:18:56,538 INFO L168 Benchmark]: Boogie Preprocessor took 45.28 ms. Allocated memory is still 204.5 MB. Free memory was 155.9 MB in the beginning and 153.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:18:56,539 INFO L168 Benchmark]: RCFGBuilder took 748.19 ms. Allocated memory is still 204.5 MB. Free memory was 153.9 MB in the beginning and 109.0 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:18:56,539 INFO L168 Benchmark]: TraceAbstraction took 13376.51 ms. Allocated memory was 204.5 MB in the beginning and 424.7 MB in the end (delta: 220.2 MB). Free memory was 108.3 MB in the beginning and 109.8 MB in the end (delta: -1.5 MB). Peak memory consumption was 218.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:18:56,543 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.23 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.72 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 102.8 MB in the beginning and 158.5 MB in the end (delta: -55.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.71 ms. Allocated memory is still 204.5 MB. Free memory was 158.5 MB in the beginning and 155.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.28 ms. Allocated memory is still 204.5 MB. Free memory was 155.9 MB in the beginning and 153.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 748.19 ms. Allocated memory is still 204.5 MB. Free memory was 153.9 MB in the beginning and 109.0 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13376.51 ms. Allocated memory was 204.5 MB in the beginning and 424.7 MB in the end (delta: 220.2 MB). Free memory was 108.3 MB in the beginning and 109.8 MB in the end (delta: -1.5 MB). Peak memory consumption was 218.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 151 ProgramPointsBefore, 77 ProgramPointsAfterwards, 185 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 5174 VarBasedMoverChecksPositive, 220 VarBasedMoverChecksNegative, 43 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 55357 CheckedPairsTotal, 107 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t833, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t834, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L822] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.0s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2181 SDtfs, 2016 SDslu, 3753 SDs, 0 SdLazy, 1820 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 5006 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 630 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 559 ConstructedInterpolants, 0 QuantifiedInterpolants, 79922 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...