/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:31:27,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:31:27,079 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:31:27,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:31:27,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:31:27,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:31:27,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:31:27,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:31:27,102 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:31:27,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:31:27,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:31:27,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:31:27,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:31:27,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:31:27,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:31:27,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:31:27,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:31:27,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:31:27,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:31:27,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:31:27,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:31:27,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:31:27,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:31:27,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:31:27,120 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:31:27,120 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:31:27,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:31:27,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:31:27,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:31:27,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:31:27,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:31:27,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:31:27,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:31:27,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:31:27,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:31:27,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:31:27,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:31:27,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:31:27,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:31:27,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:31:27,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:31:27,136 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:31:27,157 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:31:27,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:31:27,160 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:31:27,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:31:27,160 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:31:27,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:31:27,161 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:31:27,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:31:27,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:31:27,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:31:27,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:31:27,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:31:27,163 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:31:27,163 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:31:27,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:31:27,163 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:31:27,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:31:27,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:31:27,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:31:27,164 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:31:27,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:31:27,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:31:27,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:31:27,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:31:27,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:31:27,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:31:27,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:31:27,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:31:27,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:31:27,429 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:31:27,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:31:27,448 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:31:27,450 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:31:27,450 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:31:27,451 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_rmo.oepc.i [2019-12-27 02:31:27,532 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/349f5c022/63eaf3d4f9514a44b1cb306877aff8e9/FLAGaa665a526 [2019-12-27 02:31:28,126 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:31:28,126 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_rmo.oepc.i [2019-12-27 02:31:28,142 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/349f5c022/63eaf3d4f9514a44b1cb306877aff8e9/FLAGaa665a526 [2019-12-27 02:31:28,367 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/349f5c022/63eaf3d4f9514a44b1cb306877aff8e9 [2019-12-27 02:31:28,376 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:31:28,378 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:31:28,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:31:28,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:31:28,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:31:28,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:31:28" (1/1) ... [2019-12-27 02:31:28,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c1551a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:28, skipping insertion in model container [2019-12-27 02:31:28,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:31:28" (1/1) ... [2019-12-27 02:31:28,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:31:28,452 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:31:29,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:31:29,066 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:31:29,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:31:29,205 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:31:29,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:29 WrapperNode [2019-12-27 02:31:29,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:31:29,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:31:29,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:31:29,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:31:29,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:29" (1/1) ... [2019-12-27 02:31:29,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:29" (1/1) ... [2019-12-27 02:31:29,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:31:29,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:31:29,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:31:29,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:31:29,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:29" (1/1) ... [2019-12-27 02:31:29,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:29" (1/1) ... [2019-12-27 02:31:29,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:29" (1/1) ... [2019-12-27 02:31:29,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:29" (1/1) ... [2019-12-27 02:31:29,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:29" (1/1) ... [2019-12-27 02:31:29,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:29" (1/1) ... [2019-12-27 02:31:29,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:29" (1/1) ... [2019-12-27 02:31:29,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:31:29,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:31:29,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:31:29,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:31:29,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:31:29,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:31:29,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:31:29,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:31:29,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:31:29,385 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:31:29,385 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:31:29,386 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:31:29,386 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:31:29,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:31:29,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:31:29,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:31:29,388 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:31:30,061 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:31:30,062 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:31:30,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:31:30 BoogieIcfgContainer [2019-12-27 02:31:30,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:31:30,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:31:30,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:31:30,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:31:30,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:31:28" (1/3) ... [2019-12-27 02:31:30,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232e34d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:31:30, skipping insertion in model container [2019-12-27 02:31:30,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:29" (2/3) ... [2019-12-27 02:31:30,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232e34d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:31:30, skipping insertion in model container [2019-12-27 02:31:30,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:31:30" (3/3) ... [2019-12-27 02:31:30,073 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_rmo.oepc.i [2019-12-27 02:31:30,084 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:31:30,085 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:31:30,093 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:31:30,094 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:31:30,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,135 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,135 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,137 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,146 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,147 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,195 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,195 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,195 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,201 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,203 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:30,222 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 02:31:30,240 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:31:30,240 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:31:30,240 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:31:30,240 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:31:30,240 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:31:30,240 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:31:30,240 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:31:30,241 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:31:30,258 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 02:31:30,260 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 02:31:30,351 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 02:31:30,351 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:31:30,370 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 348 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 02:31:30,389 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 02:31:30,444 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 02:31:30,444 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:31:30,450 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 348 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 02:31:30,464 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 02:31:30,465 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:31:34,839 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 02:31:34,954 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 02:31:35,366 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82827 [2019-12-27 02:31:35,367 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 02:31:35,371 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-27 02:31:35,873 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-27 02:31:35,875 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-27 02:31:35,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:31:35,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:35,883 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:31:35,883 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:35,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:35,890 INFO L82 PathProgramCache]: Analyzing trace with hash 792296, now seen corresponding path program 1 times [2019-12-27 02:31:35,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:35,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921068190] [2019-12-27 02:31:35,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:36,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:31:36,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921068190] [2019-12-27 02:31:36,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:36,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:31:36,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757167287] [2019-12-27 02:31:36,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:31:36,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:36,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:31:36,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:31:36,178 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-27 02:31:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:36,575 INFO L93 Difference]: Finished difference Result 8506 states and 27908 transitions. [2019-12-27 02:31:36,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:31:36,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:31:36,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:36,723 INFO L225 Difference]: With dead ends: 8506 [2019-12-27 02:31:36,723 INFO L226 Difference]: Without dead ends: 7522 [2019-12-27 02:31:36,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:31:36,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2019-12-27 02:31:37,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 7522. [2019-12-27 02:31:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7522 states. [2019-12-27 02:31:37,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 24586 transitions. [2019-12-27 02:31:37,162 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 24586 transitions. Word has length 3 [2019-12-27 02:31:37,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:37,163 INFO L462 AbstractCegarLoop]: Abstraction has 7522 states and 24586 transitions. [2019-12-27 02:31:37,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:31:37,163 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 24586 transitions. [2019-12-27 02:31:37,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:31:37,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:37,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:31:37,167 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:37,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:37,168 INFO L82 PathProgramCache]: Analyzing trace with hash -476377294, now seen corresponding path program 1 times [2019-12-27 02:31:37,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:37,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252932838] [2019-12-27 02:31:37,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:37,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:31:37,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252932838] [2019-12-27 02:31:37,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:37,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:31:37,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964677629] [2019-12-27 02:31:37,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:31:37,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:37,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:31:37,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:31:37,252 INFO L87 Difference]: Start difference. First operand 7522 states and 24586 transitions. Second operand 3 states. [2019-12-27 02:31:37,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:37,293 INFO L93 Difference]: Finished difference Result 1232 states and 2827 transitions. [2019-12-27 02:31:37,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:31:37,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 02:31:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:37,301 INFO L225 Difference]: With dead ends: 1232 [2019-12-27 02:31:37,301 INFO L226 Difference]: Without dead ends: 1232 [2019-12-27 02:31:37,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:31:37,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-27 02:31:37,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-27 02:31:37,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-27 02:31:37,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2827 transitions. [2019-12-27 02:31:37,352 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2827 transitions. Word has length 11 [2019-12-27 02:31:37,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:37,352 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2827 transitions. [2019-12-27 02:31:37,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:31:37,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2827 transitions. [2019-12-27 02:31:37,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:31:37,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:37,359 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:31:37,359 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:37,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:37,360 INFO L82 PathProgramCache]: Analyzing trace with hash 394534895, now seen corresponding path program 1 times [2019-12-27 02:31:37,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:37,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304284409] [2019-12-27 02:31:37,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:31:37,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304284409] [2019-12-27 02:31:37,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:37,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:31:37,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460335660] [2019-12-27 02:31:37,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:31:37,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:37,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:31:37,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:31:37,432 INFO L87 Difference]: Start difference. First operand 1232 states and 2827 transitions. Second operand 3 states. [2019-12-27 02:31:37,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:37,524 INFO L93 Difference]: Finished difference Result 1960 states and 4354 transitions. [2019-12-27 02:31:37,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:31:37,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 02:31:37,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:37,540 INFO L225 Difference]: With dead ends: 1960 [2019-12-27 02:31:37,540 INFO L226 Difference]: Without dead ends: 1960 [2019-12-27 02:31:37,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:31:37,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2019-12-27 02:31:37,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1384. [2019-12-27 02:31:37,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2019-12-27 02:31:37,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 3137 transitions. [2019-12-27 02:31:37,585 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 3137 transitions. Word has length 14 [2019-12-27 02:31:37,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:37,586 INFO L462 AbstractCegarLoop]: Abstraction has 1384 states and 3137 transitions. [2019-12-27 02:31:37,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:31:37,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 3137 transitions. [2019-12-27 02:31:37,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:31:37,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:37,587 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:31:37,588 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:37,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:37,588 INFO L82 PathProgramCache]: Analyzing trace with hash 304327747, now seen corresponding path program 1 times [2019-12-27 02:31:37,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:37,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712064739] [2019-12-27 02:31:37,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:31:37,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712064739] [2019-12-27 02:31:37,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:37,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:31:37,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404159217] [2019-12-27 02:31:37,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:31:37,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:37,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:31:37,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:31:37,670 INFO L87 Difference]: Start difference. First operand 1384 states and 3137 transitions. Second operand 4 states. [2019-12-27 02:31:37,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:37,902 INFO L93 Difference]: Finished difference Result 1706 states and 3795 transitions. [2019-12-27 02:31:37,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:31:37,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 02:31:37,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:37,913 INFO L225 Difference]: With dead ends: 1706 [2019-12-27 02:31:37,913 INFO L226 Difference]: Without dead ends: 1706 [2019-12-27 02:31:37,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:31:37,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-12-27 02:31:37,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1646. [2019-12-27 02:31:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-12-27 02:31:37,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 3679 transitions. [2019-12-27 02:31:37,958 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 3679 transitions. Word has length 14 [2019-12-27 02:31:37,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:37,958 INFO L462 AbstractCegarLoop]: Abstraction has 1646 states and 3679 transitions. [2019-12-27 02:31:37,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:31:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 3679 transitions. [2019-12-27 02:31:37,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:31:37,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:37,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:31:37,960 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:37,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:37,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1071051512, now seen corresponding path program 1 times [2019-12-27 02:31:37,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:37,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646332158] [2019-12-27 02:31:37,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:31:38,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646332158] [2019-12-27 02:31:38,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:38,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:31:38,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651159610] [2019-12-27 02:31:38,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:31:38,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:38,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:31:38,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:31:38,041 INFO L87 Difference]: Start difference. First operand 1646 states and 3679 transitions. Second operand 4 states. [2019-12-27 02:31:38,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:38,251 INFO L93 Difference]: Finished difference Result 2032 states and 4499 transitions. [2019-12-27 02:31:38,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:31:38,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 02:31:38,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:38,264 INFO L225 Difference]: With dead ends: 2032 [2019-12-27 02:31:38,264 INFO L226 Difference]: Without dead ends: 2032 [2019-12-27 02:31:38,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:31:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2019-12-27 02:31:38,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1750. [2019-12-27 02:31:38,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-12-27 02:31:38,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 3922 transitions. [2019-12-27 02:31:38,311 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 3922 transitions. Word has length 14 [2019-12-27 02:31:38,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:38,312 INFO L462 AbstractCegarLoop]: Abstraction has 1750 states and 3922 transitions. [2019-12-27 02:31:38,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:31:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 3922 transitions. [2019-12-27 02:31:38,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:31:38,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:38,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:31:38,315 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:38,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:38,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1681809556, now seen corresponding path program 1 times [2019-12-27 02:31:38,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:38,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743346847] [2019-12-27 02:31:38,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:31:38,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743346847] [2019-12-27 02:31:38,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:38,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:31:38,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735274668] [2019-12-27 02:31:38,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:31:38,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:38,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:31:38,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:31:38,490 INFO L87 Difference]: Start difference. First operand 1750 states and 3922 transitions. Second operand 5 states. [2019-12-27 02:31:38,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:38,760 INFO L93 Difference]: Finished difference Result 2284 states and 4985 transitions. [2019-12-27 02:31:38,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:31:38,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 02:31:38,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:38,786 INFO L225 Difference]: With dead ends: 2284 [2019-12-27 02:31:38,786 INFO L226 Difference]: Without dead ends: 2284 [2019-12-27 02:31:38,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:31:38,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2019-12-27 02:31:38,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2035. [2019-12-27 02:31:38,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-12-27 02:31:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 4506 transitions. [2019-12-27 02:31:38,852 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 4506 transitions. Word has length 25 [2019-12-27 02:31:38,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:38,853 INFO L462 AbstractCegarLoop]: Abstraction has 2035 states and 4506 transitions. [2019-12-27 02:31:38,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:31:38,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 4506 transitions. [2019-12-27 02:31:38,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:31:38,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:38,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:31:38,857 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:38,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:38,857 INFO L82 PathProgramCache]: Analyzing trace with hash 968997935, now seen corresponding path program 1 times [2019-12-27 02:31:38,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:38,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575211252] [2019-12-27 02:31:38,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:38,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:31:38,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575211252] [2019-12-27 02:31:38,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:38,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:31:38,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643438467] [2019-12-27 02:31:38,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:31:38,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:38,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:31:38,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:31:38,943 INFO L87 Difference]: Start difference. First operand 2035 states and 4506 transitions. Second operand 3 states. [2019-12-27 02:31:38,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:38,989 INFO L93 Difference]: Finished difference Result 2578 states and 5509 transitions. [2019-12-27 02:31:38,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:31:38,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 02:31:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:39,002 INFO L225 Difference]: With dead ends: 2578 [2019-12-27 02:31:39,002 INFO L226 Difference]: Without dead ends: 2578 [2019-12-27 02:31:39,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:31:39,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2019-12-27 02:31:39,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 1993. [2019-12-27 02:31:39,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2019-12-27 02:31:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 4274 transitions. [2019-12-27 02:31:39,069 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 4274 transitions. Word has length 25 [2019-12-27 02:31:39,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:39,070 INFO L462 AbstractCegarLoop]: Abstraction has 1993 states and 4274 transitions. [2019-12-27 02:31:39,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:31:39,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 4274 transitions. [2019-12-27 02:31:39,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 02:31:39,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:39,073 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-27 02:31:39,073 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:39,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:39,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1274554926, now seen corresponding path program 1 times [2019-12-27 02:31:39,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:39,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941442052] [2019-12-27 02:31:39,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:39,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:31:39,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941442052] [2019-12-27 02:31:39,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:39,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:31:39,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366746550] [2019-12-27 02:31:39,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:31:39,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:39,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:31:39,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:31:39,179 INFO L87 Difference]: Start difference. First operand 1993 states and 4274 transitions. Second operand 3 states. [2019-12-27 02:31:39,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:39,201 INFO L93 Difference]: Finished difference Result 3111 states and 6741 transitions. [2019-12-27 02:31:39,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:31:39,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 02:31:39,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:39,205 INFO L225 Difference]: With dead ends: 3111 [2019-12-27 02:31:39,205 INFO L226 Difference]: Without dead ends: 1431 [2019-12-27 02:31:39,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:31:39,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-12-27 02:31:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1411. [2019-12-27 02:31:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-12-27 02:31:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2997 transitions. [2019-12-27 02:31:39,239 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2997 transitions. Word has length 26 [2019-12-27 02:31:39,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:39,240 INFO L462 AbstractCegarLoop]: Abstraction has 1411 states and 2997 transitions. [2019-12-27 02:31:39,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:31:39,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2997 transitions. [2019-12-27 02:31:39,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 02:31:39,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:39,242 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-27 02:31:39,243 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:39,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:39,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1286104553, now seen corresponding path program 1 times [2019-12-27 02:31:39,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:39,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63090424] [2019-12-27 02:31:39,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:39,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:31:39,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63090424] [2019-12-27 02:31:39,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:39,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:31:39,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790585974] [2019-12-27 02:31:39,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:31:39,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:39,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:31:39,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:31:39,379 INFO L87 Difference]: Start difference. First operand 1411 states and 2997 transitions. Second operand 5 states. [2019-12-27 02:31:39,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:39,605 INFO L93 Difference]: Finished difference Result 1416 states and 2988 transitions. [2019-12-27 02:31:39,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:31:39,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 02:31:39,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:39,609 INFO L225 Difference]: With dead ends: 1416 [2019-12-27 02:31:39,610 INFO L226 Difference]: Without dead ends: 1416 [2019-12-27 02:31:39,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:31:39,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-12-27 02:31:39,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1374. [2019-12-27 02:31:39,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-12-27 02:31:39,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2924 transitions. [2019-12-27 02:31:39,638 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2924 transitions. Word has length 26 [2019-12-27 02:31:39,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:39,638 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 2924 transitions. [2019-12-27 02:31:39,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:31:39,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2924 transitions. [2019-12-27 02:31:39,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:31:39,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:39,641 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:31:39,641 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:39,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:39,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1349237224, now seen corresponding path program 1 times [2019-12-27 02:31:39,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:39,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657563585] [2019-12-27 02:31:39,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:31:39,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657563585] [2019-12-27 02:31:39,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:39,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:31:39,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540169806] [2019-12-27 02:31:39,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:31:39,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:39,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:31:39,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:31:39,708 INFO L87 Difference]: Start difference. First operand 1374 states and 2924 transitions. Second operand 5 states. [2019-12-27 02:31:40,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:40,234 INFO L93 Difference]: Finished difference Result 2192 states and 4592 transitions. [2019-12-27 02:31:40,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:31:40,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 02:31:40,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:40,239 INFO L225 Difference]: With dead ends: 2192 [2019-12-27 02:31:40,240 INFO L226 Difference]: Without dead ends: 2192 [2019-12-27 02:31:40,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:31:40,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-12-27 02:31:40,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1982. [2019-12-27 02:31:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-27 02:31:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4188 transitions. [2019-12-27 02:31:40,282 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4188 transitions. Word has length 27 [2019-12-27 02:31:40,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:40,282 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4188 transitions. [2019-12-27 02:31:40,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:31:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4188 transitions. [2019-12-27 02:31:40,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 02:31:40,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:40,285 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:31:40,286 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:40,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:40,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1804230119, now seen corresponding path program 1 times [2019-12-27 02:31:40,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:40,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639572713] [2019-12-27 02:31:40,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:40,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:31:40,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639572713] [2019-12-27 02:31:40,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:40,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:31:40,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619324061] [2019-12-27 02:31:40,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:31:40,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:40,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:31:40,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:31:40,323 INFO L87 Difference]: Start difference. First operand 1982 states and 4188 transitions. Second operand 4 states. [2019-12-27 02:31:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:40,339 INFO L93 Difference]: Finished difference Result 1109 states and 2212 transitions. [2019-12-27 02:31:40,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:31:40,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-27 02:31:40,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:40,342 INFO L225 Difference]: With dead ends: 1109 [2019-12-27 02:31:40,342 INFO L226 Difference]: Without dead ends: 1001 [2019-12-27 02:31:40,343 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-27 02:31:40,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2019-12-27 02:31:40,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 923. [2019-12-27 02:31:40,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2019-12-27 02:31:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1913 transitions. [2019-12-27 02:31:40,361 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1913 transitions. Word has length 28 [2019-12-27 02:31:40,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:40,362 INFO L462 AbstractCegarLoop]: Abstraction has 923 states and 1913 transitions. [2019-12-27 02:31:40,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:31:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1913 transitions. [2019-12-27 02:31:40,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 02:31:40,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:40,365 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-27 02:31:40,365 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:40,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:40,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1370475912, now seen corresponding path program 1 times [2019-12-27 02:31:40,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:40,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157480284] [2019-12-27 02:31:40,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:40,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:31:40,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157480284] [2019-12-27 02:31:40,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:40,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:31:40,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432384660] [2019-12-27 02:31:40,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:31:40,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:40,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:31:40,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:31:40,477 INFO L87 Difference]: Start difference. First operand 923 states and 1913 transitions. Second operand 7 states. [2019-12-27 02:31:40,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:40,700 INFO L93 Difference]: Finished difference Result 1593 states and 3217 transitions. [2019-12-27 02:31:40,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:31:40,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 02:31:40,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:40,704 INFO L225 Difference]: With dead ends: 1593 [2019-12-27 02:31:40,704 INFO L226 Difference]: Without dead ends: 1060 [2019-12-27 02:31:40,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:31:40,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-12-27 02:31:40,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 922. [2019-12-27 02:31:40,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2019-12-27 02:31:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1886 transitions. [2019-12-27 02:31:40,724 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1886 transitions. Word has length 51 [2019-12-27 02:31:40,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:40,724 INFO L462 AbstractCegarLoop]: Abstraction has 922 states and 1886 transitions. [2019-12-27 02:31:40,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:31:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1886 transitions. [2019-12-27 02:31:40,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 02:31:40,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:40,728 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-27 02:31:40,728 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:40,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:40,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1368511210, now seen corresponding path program 2 times [2019-12-27 02:31:40,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:40,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461918764] [2019-12-27 02:31:40,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:40,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:31:40,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461918764] [2019-12-27 02:31:40,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:40,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:31:40,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089311319] [2019-12-27 02:31:40,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:31:40,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:40,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:31:40,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:31:40,834 INFO L87 Difference]: Start difference. First operand 922 states and 1886 transitions. Second operand 6 states. [2019-12-27 02:31:41,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:41,368 INFO L93 Difference]: Finished difference Result 1079 states and 2184 transitions. [2019-12-27 02:31:41,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:31:41,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-27 02:31:41,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:41,373 INFO L225 Difference]: With dead ends: 1079 [2019-12-27 02:31:41,373 INFO L226 Difference]: Without dead ends: 1079 [2019-12-27 02:31:41,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:31:41,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-12-27 02:31:41,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 952. [2019-12-27 02:31:41,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-12-27 02:31:41,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1941 transitions. [2019-12-27 02:31:41,393 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1941 transitions. Word has length 51 [2019-12-27 02:31:41,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:41,394 INFO L462 AbstractCegarLoop]: Abstraction has 952 states and 1941 transitions. [2019-12-27 02:31:41,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:31:41,394 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1941 transitions. [2019-12-27 02:31:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 02:31:41,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:41,397 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-27 02:31:41,397 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:41,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:41,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1240455298, now seen corresponding path program 3 times [2019-12-27 02:31:41,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:41,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10591875] [2019-12-27 02:31:41,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:41,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:31:41,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10591875] [2019-12-27 02:31:41,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:41,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:31:41,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716003458] [2019-12-27 02:31:41,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:31:41,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:41,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:31:41,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:31:41,473 INFO L87 Difference]: Start difference. First operand 952 states and 1941 transitions. Second operand 5 states. [2019-12-27 02:31:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:41,683 INFO L93 Difference]: Finished difference Result 1081 states and 2174 transitions. [2019-12-27 02:31:41,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:31:41,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-27 02:31:41,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:41,689 INFO L225 Difference]: With dead ends: 1081 [2019-12-27 02:31:41,689 INFO L226 Difference]: Without dead ends: 1081 [2019-12-27 02:31:41,690 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-27 02:31:41,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-12-27 02:31:41,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 993. [2019-12-27 02:31:41,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-12-27 02:31:41,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 2021 transitions. [2019-12-27 02:31:41,710 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 2021 transitions. Word has length 51 [2019-12-27 02:31:41,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:41,711 INFO L462 AbstractCegarLoop]: Abstraction has 993 states and 2021 transitions. [2019-12-27 02:31:41,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:31:41,712 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 2021 transitions. [2019-12-27 02:31:41,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 02:31:41,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:41,714 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-27 02:31:41,715 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:41,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:41,715 INFO L82 PathProgramCache]: Analyzing trace with hash 503151608, now seen corresponding path program 4 times [2019-12-27 02:31:41,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:41,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235740767] [2019-12-27 02:31:41,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:41,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:31:41,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235740767] [2019-12-27 02:31:41,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:41,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:31:41,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246151247] [2019-12-27 02:31:41,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:31:41,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:41,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:31:41,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:31:41,840 INFO L87 Difference]: Start difference. First operand 993 states and 2021 transitions. Second operand 3 states. [2019-12-27 02:31:41,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:41,855 INFO L93 Difference]: Finished difference Result 993 states and 2020 transitions. [2019-12-27 02:31:41,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:31:41,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 02:31:41,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:41,858 INFO L225 Difference]: With dead ends: 993 [2019-12-27 02:31:41,858 INFO L226 Difference]: Without dead ends: 993 [2019-12-27 02:31:41,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:31:41,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-12-27 02:31:41,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 882. [2019-12-27 02:31:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-12-27 02:31:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1817 transitions. [2019-12-27 02:31:41,881 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1817 transitions. Word has length 51 [2019-12-27 02:31:41,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:41,881 INFO L462 AbstractCegarLoop]: Abstraction has 882 states and 1817 transitions. [2019-12-27 02:31:41,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:31:41,882 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1817 transitions. [2019-12-27 02:31:41,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 02:31:41,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:41,884 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-27 02:31:41,885 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:41,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:41,885 INFO L82 PathProgramCache]: Analyzing trace with hash -480319677, now seen corresponding path program 1 times [2019-12-27 02:31:41,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:41,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336158103] [2019-12-27 02:31:41,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:41,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:31:41,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336158103] [2019-12-27 02:31:41,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:41,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:31:41,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870068857] [2019-12-27 02:31:41,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:31:41,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:41,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:31:41,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:31:41,988 INFO L87 Difference]: Start difference. First operand 882 states and 1817 transitions. Second operand 3 states. [2019-12-27 02:31:42,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:42,040 INFO L93 Difference]: Finished difference Result 1057 states and 2181 transitions. [2019-12-27 02:31:42,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:31:42,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 02:31:42,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:42,042 INFO L225 Difference]: With dead ends: 1057 [2019-12-27 02:31:42,042 INFO L226 Difference]: Without dead ends: 1057 [2019-12-27 02:31:42,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:31:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-12-27 02:31:42,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 823. [2019-12-27 02:31:42,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-27 02:31:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1716 transitions. [2019-12-27 02:31:42,060 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1716 transitions. Word has length 52 [2019-12-27 02:31:42,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:42,060 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1716 transitions. [2019-12-27 02:31:42,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:31:42,060 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1716 transitions. [2019-12-27 02:31:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 02:31:42,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:42,062 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-27 02:31:42,063 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:42,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:42,063 INFO L82 PathProgramCache]: Analyzing trace with hash -409769665, now seen corresponding path program 1 times [2019-12-27 02:31:42,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:42,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896033983] [2019-12-27 02:31:42,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:31:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:31:42,175 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:31:42,176 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:31:42,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= v_~z$mem_tmp~0_25 0) (= v_~y~0_23 0) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t1097~0.base_27| 1)) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_98 0) (= v_~main$tmp_guard1~0_44 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1097~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1097~0.base_27|) |v_ULTIMATE.start_main_~#t1097~0.offset_19| 0)) |v_#memory_int_11|) (= v_~z$w_buff1~0_160 0) (= 0 v_~weak$$choice0~0_23) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$r_buff0_thd1~0_174 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1097~0.base_27|)) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p1_EAX~0_45) (= v_~z$w_buff0~0_252 0) (= v_~z~0_120 0) (= v_~z$r_buff0_thd0~0_134 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~main$tmp_guard0~0_20 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$flush_delayed~0_33) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1097~0.base_27|) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff1_thd2~0_196 0) (= v_~z$r_buff1_thd0~0_144 0) (= 0 v_~weak$$choice2~0_99) (= v_~z$w_buff0_used~0_606 0) (= |v_ULTIMATE.start_main_~#t1097~0.offset_19| 0) (= v_~z$w_buff1_used~0_306 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1097~0.base_27| 4)) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$r_buff0_thd2~0_279 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_196, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_160, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_370|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_93|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_134, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, #length=|v_#length_17|, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_279, ULTIMATE.start_main_~#t1098~0.offset=|v_ULTIMATE.start_main_~#t1098~0.offset_14|, ~z$mem_tmp~0=v_~z$mem_tmp~0_25, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_606, ~z$w_buff0~0=v_~z$w_buff0~0_252, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_306, ~z$flush_delayed~0=v_~z$flush_delayed~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_~#t1097~0.base=|v_ULTIMATE.start_main_~#t1097~0.base_27|, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_23, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_58|, ULTIMATE.start_main_~#t1098~0.base=|v_ULTIMATE.start_main_~#t1098~0.base_22|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~z~0=v_~z~0_120, ~weak$$choice2~0=v_~weak$$choice2~0_99, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_174, ULTIMATE.start_main_~#t1097~0.offset=|v_ULTIMATE.start_main_~#t1097~0.offset_19|, ~x~0=v_~x~0_98} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1098~0.offset, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1097~0.base, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t1098~0.base, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1097~0.offset, ~x~0] because there is no mapped edge [2019-12-27 02:31:42,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= 1 ~z$r_buff0_thd1~0_Out-868069162) (= ~z$r_buff0_thd1~0_In-868069162 ~z$r_buff1_thd1~0_Out-868069162) (= 1 ~x~0_Out-868069162) (= ~z$r_buff0_thd0~0_In-868069162 ~z$r_buff1_thd0~0_Out-868069162) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-868069162)) (= ~z$r_buff1_thd2~0_Out-868069162 ~z$r_buff0_thd2~0_In-868069162)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-868069162, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-868069162, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-868069162, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-868069162} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-868069162, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-868069162, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-868069162, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-868069162, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-868069162, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-868069162, ~x~0=~x~0_Out-868069162, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-868069162} AuxVars[] AssignedVars[~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 02:31:42,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L802-1-->L804: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1098~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1098~0.base_11| 0)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1098~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1098~0.base_11|) |v_ULTIMATE.start_main_~#t1098~0.offset_10| 1)) |v_#memory_int_5|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1098~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1098~0.base_11|) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1098~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t1098~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1098~0.offset=|v_ULTIMATE.start_main_~#t1098~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1098~0.base=|v_ULTIMATE.start_main_~#t1098~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1098~0.offset, ULTIMATE.start_main_~#t1098~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 02:31:42,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In2020052505 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In2020052505 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out2020052505| ~z$w_buff0_used~0_In2020052505) (or .cse0 .cse1)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out2020052505| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2020052505, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2020052505} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2020052505|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2020052505, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2020052505} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 02:31:42,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1114967550 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1114967550 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1114967550 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In1114967550 256) 0))) (or (and (= ~z$w_buff1_used~0_In1114967550 |P0Thread1of1ForFork0_#t~ite6_Out1114967550|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1114967550|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1114967550, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1114967550, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1114967550, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1114967550} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1114967550|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1114967550, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1114967550, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1114967550, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1114967550} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 02:31:42,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-1400839297 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1400839297 256) 0))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out-1400839297 0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_Out-1400839297 ~z$r_buff0_thd1~0_In-1400839297) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1400839297, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1400839297} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1400839297, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1400839297|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1400839297} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:31:42,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In518606341 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In518606341 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In518606341 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In518606341 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out518606341| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$r_buff1_thd1~0_In518606341 |P0Thread1of1ForFork0_#t~ite8_Out518606341|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In518606341, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In518606341, ~z$w_buff1_used~0=~z$w_buff1_used~0_In518606341, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In518606341} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In518606341, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out518606341|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In518606341, ~z$w_buff1_used~0=~z$w_buff1_used~0_In518606341, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In518606341} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 02:31:42,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_34|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 02:31:42,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd2~0_61 v_~z$r_buff0_thd2~0_60)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_61} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 02:31:42,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1285836340 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1285836340 256)))) (or (and .cse0 (= (mod ~z$w_buff1_used~0_In-1285836340 256) 0)) (and .cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1285836340 256))) (= 0 (mod ~z$w_buff0_used~0_In-1285836340 256)))) (= |P1Thread1of1ForFork1_#t~ite29_Out-1285836340| ~z$r_buff1_thd2~0_In-1285836340) (= |P1Thread1of1ForFork1_#t~ite30_Out-1285836340| |P1Thread1of1ForFork1_#t~ite29_Out-1285836340|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite29_In-1285836340| |P1Thread1of1ForFork1_#t~ite29_Out-1285836340|) (= |P1Thread1of1ForFork1_#t~ite30_Out-1285836340| ~z$r_buff1_thd2~0_In-1285836340) (not .cse1)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1285836340|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1285836340, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1285836340, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1285836340, ~weak$$choice2~0=~weak$$choice2~0_In-1285836340, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1285836340} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1285836340|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1285836340|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1285836340, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1285836340, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1285836340, ~weak$$choice2~0=~weak$$choice2~0_In-1285836340, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1285836340} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 02:31:42,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= v_~z~0_27 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_8) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 02:31:42,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-452385114 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-452385114 256)))) (or (and (= ~z~0_In-452385114 |P1Thread1of1ForFork1_#t~ite32_Out-452385114|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In-452385114 |P1Thread1of1ForFork1_#t~ite32_Out-452385114|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-452385114, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-452385114, ~z$w_buff1~0=~z$w_buff1~0_In-452385114, ~z~0=~z~0_In-452385114} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-452385114, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-452385114, ~z$w_buff1~0=~z$w_buff1~0_In-452385114, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-452385114|, ~z~0=~z~0_In-452385114} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 02:31:42,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~z~0_39 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~z~0=v_~z~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~z~0] because there is no mapped edge [2019-12-27 02:31:42,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-959884272 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-959884272 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-959884272|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-959884272 |P1Thread1of1ForFork1_#t~ite34_Out-959884272|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-959884272, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-959884272} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-959884272, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-959884272|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-959884272} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 02:31:42,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1592944808 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1592944808 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1592944808 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1592944808 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out1592944808| ~z$w_buff1_used~0_In1592944808)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1592944808|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1592944808, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1592944808, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1592944808, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1592944808} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1592944808, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1592944808, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1592944808, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1592944808|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1592944808} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 02:31:42,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-27677144 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-27677144 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-27677144| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-27677144 |P1Thread1of1ForFork1_#t~ite36_Out-27677144|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-27677144, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-27677144} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-27677144, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-27677144, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-27677144|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 02:31:42,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-770922498 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-770922498 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-770922498 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-770922498 256) 0))) (or (and (= ~z$r_buff1_thd2~0_In-770922498 |P1Thread1of1ForFork1_#t~ite37_Out-770922498|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-770922498|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-770922498, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-770922498, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-770922498, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-770922498} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-770922498, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-770922498, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-770922498, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-770922498, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-770922498|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 02:31:42,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite37_24| v_~z$r_buff1_thd2~0_88) (= v_~__unbuffered_cnt~0_28 (+ v_~__unbuffered_cnt~0_29 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_24|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_88, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_23|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 02:31:42,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 2 v_~__unbuffered_cnt~0_16)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 02:31:42,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In677626213 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out677626213| |ULTIMATE.start_main_#t~ite40_Out677626213|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In677626213 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out677626213| ~z~0_In677626213) .cse2) (and (= |ULTIMATE.start_main_#t~ite40_Out677626213| ~z$w_buff1~0_In677626213) (not .cse0) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In677626213, ~z$w_buff1_used~0=~z$w_buff1_used~0_In677626213, ~z$w_buff1~0=~z$w_buff1~0_In677626213, ~z~0=~z~0_In677626213} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out677626213|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out677626213|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In677626213, ~z$w_buff1_used~0=~z$w_buff1_used~0_In677626213, ~z$w_buff1~0=~z$w_buff1~0_In677626213, ~z~0=~z~0_In677626213} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 02:31:42,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In461663067 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In461663067 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out461663067| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In461663067 |ULTIMATE.start_main_#t~ite42_Out461663067|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In461663067, ~z$w_buff0_used~0=~z$w_buff0_used~0_In461663067} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In461663067, ~z$w_buff0_used~0=~z$w_buff0_used~0_In461663067, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out461663067|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 02:31:42,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In104758344 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In104758344 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In104758344 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In104758344 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out104758344|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In104758344 |ULTIMATE.start_main_#t~ite43_Out104758344|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In104758344, ~z$w_buff0_used~0=~z$w_buff0_used~0_In104758344, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In104758344, ~z$w_buff1_used~0=~z$w_buff1_used~0_In104758344} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In104758344, ~z$w_buff0_used~0=~z$w_buff0_used~0_In104758344, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In104758344, ~z$w_buff1_used~0=~z$w_buff1_used~0_In104758344, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out104758344|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 02:31:42,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In309086292 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In309086292 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In309086292 |ULTIMATE.start_main_#t~ite44_Out309086292|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out309086292|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In309086292, ~z$w_buff0_used~0=~z$w_buff0_used~0_In309086292} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In309086292, ~z$w_buff0_used~0=~z$w_buff0_used~0_In309086292, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out309086292|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 02:31:42,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-1781706667 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1781706667 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1781706667 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1781706667 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-1781706667| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-1781706667| ~z$r_buff1_thd0~0_In-1781706667)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1781706667, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1781706667, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1781706667, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1781706667} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1781706667, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1781706667, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1781706667, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1781706667, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1781706667|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 02:31:42,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~__unbuffered_p1_EBX~0_28 0) (= v_~z$r_buff1_thd0~0_107 |v_ULTIMATE.start_main_#t~ite45_60|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 1 v_~__unbuffered_p1_EAX~0_28) (= v_~x~0_67 2) (= v_~main$tmp_guard1~0_22 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_67, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_107, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~x~0=v_~x~0_67, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_59|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$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-27 02:31:42,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:31:42 BasicIcfg [2019-12-27 02:31:42,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:31:42,272 INFO L168 Benchmark]: Toolchain (without parser) took 13894.60 ms. Allocated memory was 145.8 MB in the beginning and 434.6 MB in the end (delta: 288.9 MB). Free memory was 101.7 MB in the beginning and 146.2 MB in the end (delta: -44.5 MB). Peak memory consumption was 244.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:31:42,273 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 02:31:42,274 INFO L168 Benchmark]: CACSL2BoogieTranslator took 827.23 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.5 MB in the beginning and 157.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:31:42,275 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.48 ms. Allocated memory is still 202.9 MB. Free memory was 157.4 MB in the beginning and 154.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:31:42,276 INFO L168 Benchmark]: Boogie Preprocessor took 39.14 ms. Allocated memory is still 202.9 MB. Free memory was 154.7 MB in the beginning and 152.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:31:42,276 INFO L168 Benchmark]: RCFGBuilder took 748.23 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 108.2 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:31:42,277 INFO L168 Benchmark]: TraceAbstraction took 12204.83 ms. Allocated memory was 202.9 MB in the beginning and 434.6 MB in the end (delta: 231.7 MB). Free memory was 107.5 MB in the beginning and 146.2 MB in the end (delta: -38.7 MB). Peak memory consumption was 193.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:31:42,288 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.46 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 827.23 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.5 MB in the beginning and 157.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.48 ms. Allocated memory is still 202.9 MB. Free memory was 157.4 MB in the beginning and 154.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.14 ms. Allocated memory is still 202.9 MB. Free memory was 154.7 MB in the beginning and 152.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 748.23 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 108.2 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12204.83 ms. Allocated memory was 202.9 MB in the beginning and 434.6 MB in the end (delta: 231.7 MB). Free memory was 107.5 MB in the beginning and 146.2 MB in the end (delta: -38.7 MB). Peak memory consumption was 193.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 13 FixpointIterations, 30 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 25 ChoiceCompositions, 4608 VarBasedMoverChecksPositive, 304 VarBasedMoverChecksNegative, 234 SemBasedMoverChecksPositive, 187 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 82827 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1097, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 1 z$w_buff1 = z$w_buff0 [L727] 1 z$w_buff0 = 1 [L728] 1 z$w_buff1_used = z$w_buff0_used [L729] 1 z$w_buff0_used = (_Bool)1 [L740] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] FCALL, FORK 0 pthread_create(&t1098, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L742] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L811] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L812] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L813] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1928 SDtfs, 1285 SDslu, 3101 SDs, 0 SdLazy, 1751 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 15 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s 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: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 2800 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 522 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 83671 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...