/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:59:34,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:59:34,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:59:34,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:59:34,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:59:34,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:59:34,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:59:34,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:59:34,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:59:34,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:59:34,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:59:34,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:59:34,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:59:34,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:59:34,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:59:34,129 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:59:34,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:59:34,134 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:59:34,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:59:34,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:59:34,144 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:59:34,145 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:59:34,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:59:34,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:59:34,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:59:34,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:59:34,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:59:34,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:59:34,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:59:34,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:59:34,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:59:34,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:59:34,164 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:59:34,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:59:34,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:59:34,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:59:34,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:59:34,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:59:34,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:59:34,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:59:34,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:59:34,174 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:59:34,198 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:59:34,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:59:34,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:59:34,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:59:34,202 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:59:34,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:59:34,202 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:59:34,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:59:34,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:59:34,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:59:34,204 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:59:34,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:59:34,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:59:34,205 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:59:34,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:59:34,205 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:59:34,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:59:34,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:59:34,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:59:34,206 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:59:34,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:59:34,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:59:34,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:59:34,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:59:34,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:59:34,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:59:34,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:59:34,208 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:59:34,208 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:59:34,208 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:59:34,524 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:59:34,539 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:59:34,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:59:34,544 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:59:34,545 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:59:34,546 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_rmo.oepc.i [2019-12-18 13:59:34,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2ac5ed7/c4656dec99274fa2aaa34531550d4451/FLAGb7a596afd [2019-12-18 13:59:35,203 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:59:35,204 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_rmo.oepc.i [2019-12-18 13:59:35,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2ac5ed7/c4656dec99274fa2aaa34531550d4451/FLAGb7a596afd [2019-12-18 13:59:35,491 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2ac5ed7/c4656dec99274fa2aaa34531550d4451 [2019-12-18 13:59:35,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:59:35,501 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:59:35,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:59:35,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:59:35,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:59:35,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:59:35" (1/1) ... [2019-12-18 13:59:35,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:35, skipping insertion in model container [2019-12-18 13:59:35,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:59:35" (1/1) ... [2019-12-18 13:59:35,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:59:35,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:59:36,079 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:59:36,092 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:59:36,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:59:36,232 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:59:36,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:36 WrapperNode [2019-12-18 13:59:36,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:59:36,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:59:36,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:59:36,234 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:59:36,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:36" (1/1) ... [2019-12-18 13:59:36,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:36" (1/1) ... [2019-12-18 13:59:36,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:59:36,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:59:36,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:59:36,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:59:36,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:36" (1/1) ... [2019-12-18 13:59:36,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:36" (1/1) ... [2019-12-18 13:59:36,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:36" (1/1) ... [2019-12-18 13:59:36,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:36" (1/1) ... [2019-12-18 13:59:36,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:36" (1/1) ... [2019-12-18 13:59:36,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:36" (1/1) ... [2019-12-18 13:59:36,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:36" (1/1) ... [2019-12-18 13:59:36,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:59:36,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:59:36,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:59:36,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:59:36,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:59:36,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:59:36,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:59:36,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:59:36,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:59:36,433 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:59:36,433 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:59:36,434 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:59:36,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:59:36,434 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:59:36,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:59:36,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:59:36,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:59:36,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:59:36,436 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:59:37,202 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:59:37,202 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:59:37,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:59:37 BoogieIcfgContainer [2019-12-18 13:59:37,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:59:37,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:59:37,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:59:37,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:59:37,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:59:35" (1/3) ... [2019-12-18 13:59:37,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254dfce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:59:37, skipping insertion in model container [2019-12-18 13:59:37,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:36" (2/3) ... [2019-12-18 13:59:37,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254dfce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:59:37, skipping insertion in model container [2019-12-18 13:59:37,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:59:37" (3/3) ... [2019-12-18 13:59:37,213 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_rmo.oepc.i [2019-12-18 13:59:37,222 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:59:37,222 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:59:37,230 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:59:37,231 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:59:37,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,278 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,279 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,279 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,279 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,280 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,291 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,292 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,322 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,322 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,350 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,351 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,351 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,353 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,354 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,358 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,360 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:37,384 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:59:37,405 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:59:37,405 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:59:37,405 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:59:37,406 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:59:37,406 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:59:37,406 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:59:37,406 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:59:37,406 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:59:37,423 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 13:59:37,426 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 13:59:37,514 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 13:59:37,515 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:59:37,538 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:59:37,568 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 13:59:37,620 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 13:59:37,620 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:59:37,633 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:59:37,654 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:59:37,655 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:59:43,466 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 13:59:43,597 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 13:59:43,621 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77200 [2019-12-18 13:59:43,621 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 13:59:43,624 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-18 13:59:57,472 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-18 13:59:57,474 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-18 13:59:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:59:57,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:57,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:59:57,480 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:57,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:57,484 INFO L82 PathProgramCache]: Analyzing trace with hash 909908, now seen corresponding path program 1 times [2019-12-18 13:59:57,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:57,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100491802] [2019-12-18 13:59:57,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:59:57,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:59:57,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100491802] [2019-12-18 13:59:57,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:59:57,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:59:57,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906885534] [2019-12-18 13:59:57,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:59:57,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:59:57,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:59:57,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:59:57,766 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-18 14:00:00,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:00,427 INFO L93 Difference]: Finished difference Result 101472 states and 432734 transitions. [2019-12-18 14:00:00,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:00,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 14:00:00,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:03,351 INFO L225 Difference]: With dead ends: 101472 [2019-12-18 14:00:03,352 INFO L226 Difference]: Without dead ends: 95232 [2019-12-18 14:00:03,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:08,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95232 states. [2019-12-18 14:00:11,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95232 to 95232. [2019-12-18 14:00:11,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95232 states. [2019-12-18 14:00:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95232 states to 95232 states and 405538 transitions. [2019-12-18 14:00:11,569 INFO L78 Accepts]: Start accepts. Automaton has 95232 states and 405538 transitions. Word has length 3 [2019-12-18 14:00:11,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:11,569 INFO L462 AbstractCegarLoop]: Abstraction has 95232 states and 405538 transitions. [2019-12-18 14:00:11,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:11,569 INFO L276 IsEmpty]: Start isEmpty. Operand 95232 states and 405538 transitions. [2019-12-18 14:00:11,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:00:11,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:11,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:11,574 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:11,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:11,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1729820714, now seen corresponding path program 1 times [2019-12-18 14:00:11,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:11,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572404526] [2019-12-18 14:00:11,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:11,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572404526] [2019-12-18 14:00:11,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:11,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:11,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684164539] [2019-12-18 14:00:11,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:00:11,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:11,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:00:11,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:00:11,708 INFO L87 Difference]: Start difference. First operand 95232 states and 405538 transitions. Second operand 4 states. [2019-12-18 14:00:16,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:16,012 INFO L93 Difference]: Finished difference Result 151692 states and 619304 transitions. [2019-12-18 14:00:16,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:00:16,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:00:16,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:17,138 INFO L225 Difference]: With dead ends: 151692 [2019-12-18 14:00:17,138 INFO L226 Difference]: Without dead ends: 151643 [2019-12-18 14:00:17,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:21,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151643 states. [2019-12-18 14:00:25,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151643 to 138429. [2019-12-18 14:00:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138429 states. [2019-12-18 14:00:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138429 states to 138429 states and 572602 transitions. [2019-12-18 14:00:32,230 INFO L78 Accepts]: Start accepts. Automaton has 138429 states and 572602 transitions. Word has length 11 [2019-12-18 14:00:32,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:32,230 INFO L462 AbstractCegarLoop]: Abstraction has 138429 states and 572602 transitions. [2019-12-18 14:00:32,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:00:32,230 INFO L276 IsEmpty]: Start isEmpty. Operand 138429 states and 572602 transitions. [2019-12-18 14:00:32,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:00:32,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:32,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:32,238 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:32,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:32,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1791451612, now seen corresponding path program 1 times [2019-12-18 14:00:32,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:32,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346611407] [2019-12-18 14:00:32,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:32,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:32,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346611407] [2019-12-18 14:00:32,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:32,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:32,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389200742] [2019-12-18 14:00:32,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:32,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:32,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:32,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:32,318 INFO L87 Difference]: Start difference. First operand 138429 states and 572602 transitions. Second operand 3 states. [2019-12-18 14:00:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:32,453 INFO L93 Difference]: Finished difference Result 30955 states and 100617 transitions. [2019-12-18 14:00:32,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:32,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:00:32,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:32,524 INFO L225 Difference]: With dead ends: 30955 [2019-12-18 14:00:32,525 INFO L226 Difference]: Without dead ends: 30955 [2019-12-18 14:00:32,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:32,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30955 states. [2019-12-18 14:00:34,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30955 to 30955. [2019-12-18 14:00:34,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30955 states. [2019-12-18 14:00:34,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30955 states to 30955 states and 100617 transitions. [2019-12-18 14:00:34,313 INFO L78 Accepts]: Start accepts. Automaton has 30955 states and 100617 transitions. Word has length 13 [2019-12-18 14:00:34,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:34,314 INFO L462 AbstractCegarLoop]: Abstraction has 30955 states and 100617 transitions. [2019-12-18 14:00:34,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 30955 states and 100617 transitions. [2019-12-18 14:00:34,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:00:34,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:34,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:34,318 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:34,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:34,318 INFO L82 PathProgramCache]: Analyzing trace with hash -137996123, now seen corresponding path program 1 times [2019-12-18 14:00:34,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:34,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197011570] [2019-12-18 14:00:34,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:34,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:34,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197011570] [2019-12-18 14:00:34,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:34,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:34,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619183799] [2019-12-18 14:00:34,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:34,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:34,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:34,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:34,386 INFO L87 Difference]: Start difference. First operand 30955 states and 100617 transitions. Second operand 3 states. [2019-12-18 14:00:34,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:34,581 INFO L93 Difference]: Finished difference Result 47061 states and 152507 transitions. [2019-12-18 14:00:34,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:34,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 14:00:34,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:34,682 INFO L225 Difference]: With dead ends: 47061 [2019-12-18 14:00:34,683 INFO L226 Difference]: Without dead ends: 47061 [2019-12-18 14:00:34,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:34,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47061 states. [2019-12-18 14:00:36,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47061 to 33925. [2019-12-18 14:00:36,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33925 states. [2019-12-18 14:00:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33925 states to 33925 states and 111057 transitions. [2019-12-18 14:00:36,174 INFO L78 Accepts]: Start accepts. Automaton has 33925 states and 111057 transitions. Word has length 16 [2019-12-18 14:00:36,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:36,175 INFO L462 AbstractCegarLoop]: Abstraction has 33925 states and 111057 transitions. [2019-12-18 14:00:36,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:36,175 INFO L276 IsEmpty]: Start isEmpty. Operand 33925 states and 111057 transitions. [2019-12-18 14:00:36,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:00:36,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:36,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:36,178 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:36,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:36,178 INFO L82 PathProgramCache]: Analyzing trace with hash -137876649, now seen corresponding path program 1 times [2019-12-18 14:00:36,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:36,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059798515] [2019-12-18 14:00:36,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:36,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059798515] [2019-12-18 14:00:36,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:36,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:36,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772289556] [2019-12-18 14:00:36,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:00:36,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:36,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:00:36,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:00:36,240 INFO L87 Difference]: Start difference. First operand 33925 states and 111057 transitions. Second operand 4 states. [2019-12-18 14:00:36,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:36,626 INFO L93 Difference]: Finished difference Result 41000 states and 132194 transitions. [2019-12-18 14:00:36,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:00:36,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 14:00:36,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:36,692 INFO L225 Difference]: With dead ends: 41000 [2019-12-18 14:00:36,693 INFO L226 Difference]: Without dead ends: 41000 [2019-12-18 14:00:36,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:36,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41000 states. [2019-12-18 14:00:38,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41000 to 37405. [2019-12-18 14:00:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37405 states. [2019-12-18 14:00:38,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37405 states to 37405 states and 121522 transitions. [2019-12-18 14:00:38,117 INFO L78 Accepts]: Start accepts. Automaton has 37405 states and 121522 transitions. Word has length 16 [2019-12-18 14:00:38,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:38,117 INFO L462 AbstractCegarLoop]: Abstraction has 37405 states and 121522 transitions. [2019-12-18 14:00:38,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:00:38,117 INFO L276 IsEmpty]: Start isEmpty. Operand 37405 states and 121522 transitions. [2019-12-18 14:00:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:00:38,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:38,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:38,120 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:38,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:38,120 INFO L82 PathProgramCache]: Analyzing trace with hash -219444717, now seen corresponding path program 1 times [2019-12-18 14:00:38,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:38,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44721103] [2019-12-18 14:00:38,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:38,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-18 14:00:38,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44721103] [2019-12-18 14:00:38,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:38,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:38,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802078975] [2019-12-18 14:00:38,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:00:38,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:38,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:00:38,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:00:38,178 INFO L87 Difference]: Start difference. First operand 37405 states and 121522 transitions. Second operand 4 states. [2019-12-18 14:00:38,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:38,524 INFO L93 Difference]: Finished difference Result 45062 states and 145323 transitions. [2019-12-18 14:00:38,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:00:38,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 14:00:38,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:38,597 INFO L225 Difference]: With dead ends: 45062 [2019-12-18 14:00:38,598 INFO L226 Difference]: Without dead ends: 45062 [2019-12-18 14:00:38,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:38,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45062 states. [2019-12-18 14:00:41,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45062 to 38365. [2019-12-18 14:00:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38365 states. [2019-12-18 14:00:41,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38365 states to 38365 states and 124903 transitions. [2019-12-18 14:00:41,383 INFO L78 Accepts]: Start accepts. Automaton has 38365 states and 124903 transitions. Word has length 16 [2019-12-18 14:00:41,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:41,383 INFO L462 AbstractCegarLoop]: Abstraction has 38365 states and 124903 transitions. [2019-12-18 14:00:41,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:00:41,384 INFO L276 IsEmpty]: Start isEmpty. Operand 38365 states and 124903 transitions. [2019-12-18 14:00:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:00:41,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:41,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:41,395 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:41,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:41,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1066994180, now seen corresponding path program 1 times [2019-12-18 14:00:41,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:41,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770369240] [2019-12-18 14:00:41,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:41,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770369240] [2019-12-18 14:00:41,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:41,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:41,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777544962] [2019-12-18 14:00:41,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:41,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:41,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:41,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:41,546 INFO L87 Difference]: Start difference. First operand 38365 states and 124903 transitions. Second operand 5 states. [2019-12-18 14:00:42,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:42,204 INFO L93 Difference]: Finished difference Result 53898 states and 171065 transitions. [2019-12-18 14:00:42,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:00:42,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 14:00:42,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:42,295 INFO L225 Difference]: With dead ends: 53898 [2019-12-18 14:00:42,295 INFO L226 Difference]: Without dead ends: 53891 [2019-12-18 14:00:42,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:00:42,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53891 states. [2019-12-18 14:00:43,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53891 to 39721. [2019-12-18 14:00:43,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39721 states. [2019-12-18 14:00:43,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39721 states to 39721 states and 129036 transitions. [2019-12-18 14:00:43,344 INFO L78 Accepts]: Start accepts. Automaton has 39721 states and 129036 transitions. Word has length 22 [2019-12-18 14:00:43,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:43,344 INFO L462 AbstractCegarLoop]: Abstraction has 39721 states and 129036 transitions. [2019-12-18 14:00:43,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:43,344 INFO L276 IsEmpty]: Start isEmpty. Operand 39721 states and 129036 transitions. [2019-12-18 14:00:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:00:43,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:43,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:43,354 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:43,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:43,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1734556852, now seen corresponding path program 1 times [2019-12-18 14:00:43,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:43,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524098324] [2019-12-18 14:00:43,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:43,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524098324] [2019-12-18 14:00:43,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:43,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:43,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936414082] [2019-12-18 14:00:43,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:43,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:43,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:43,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:43,414 INFO L87 Difference]: Start difference. First operand 39721 states and 129036 transitions. Second operand 5 states. [2019-12-18 14:00:44,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:44,011 INFO L93 Difference]: Finished difference Result 56181 states and 177938 transitions. [2019-12-18 14:00:44,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:00:44,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 14:00:44,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:44,108 INFO L225 Difference]: With dead ends: 56181 [2019-12-18 14:00:44,108 INFO L226 Difference]: Without dead ends: 56174 [2019-12-18 14:00:44,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:00:44,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56174 states. [2019-12-18 14:00:45,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56174 to 38054. [2019-12-18 14:00:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38054 states. [2019-12-18 14:00:45,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38054 states to 38054 states and 123745 transitions. [2019-12-18 14:00:45,260 INFO L78 Accepts]: Start accepts. Automaton has 38054 states and 123745 transitions. Word has length 22 [2019-12-18 14:00:45,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:45,261 INFO L462 AbstractCegarLoop]: Abstraction has 38054 states and 123745 transitions. [2019-12-18 14:00:45,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:45,261 INFO L276 IsEmpty]: Start isEmpty. Operand 38054 states and 123745 transitions. [2019-12-18 14:00:45,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:00:45,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:45,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:45,275 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:45,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:45,275 INFO L82 PathProgramCache]: Analyzing trace with hash -779030427, now seen corresponding path program 1 times [2019-12-18 14:00:45,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:45,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466536939] [2019-12-18 14:00:45,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:45,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466536939] [2019-12-18 14:00:45,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:45,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:45,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645885793] [2019-12-18 14:00:45,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:00:45,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:45,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:00:45,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:00:45,328 INFO L87 Difference]: Start difference. First operand 38054 states and 123745 transitions. Second operand 4 states. [2019-12-18 14:00:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:45,414 INFO L93 Difference]: Finished difference Result 15260 states and 46817 transitions. [2019-12-18 14:00:45,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:00:45,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:00:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:45,446 INFO L225 Difference]: With dead ends: 15260 [2019-12-18 14:00:45,447 INFO L226 Difference]: Without dead ends: 15260 [2019-12-18 14:00:45,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:00:45,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15260 states. [2019-12-18 14:00:45,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15260 to 14988. [2019-12-18 14:00:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14988 states. [2019-12-18 14:00:45,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14988 states to 14988 states and 46041 transitions. [2019-12-18 14:00:45,790 INFO L78 Accepts]: Start accepts. Automaton has 14988 states and 46041 transitions. Word has length 25 [2019-12-18 14:00:45,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:45,792 INFO L462 AbstractCegarLoop]: Abstraction has 14988 states and 46041 transitions. [2019-12-18 14:00:45,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:00:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 14988 states and 46041 transitions. [2019-12-18 14:00:45,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:00:45,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:45,809 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-18 14:00:45,809 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:45,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:45,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1740727520, now seen corresponding path program 1 times [2019-12-18 14:00:45,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:45,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96166402] [2019-12-18 14:00:45,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:45,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:45,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96166402] [2019-12-18 14:00:45,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:45,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:45,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766745757] [2019-12-18 14:00:45,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:45,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:45,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:45,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:45,893 INFO L87 Difference]: Start difference. First operand 14988 states and 46041 transitions. Second operand 5 states. [2019-12-18 14:00:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:46,310 INFO L93 Difference]: Finished difference Result 19496 states and 58771 transitions. [2019-12-18 14:00:46,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:00:46,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 14:00:46,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:46,357 INFO L225 Difference]: With dead ends: 19496 [2019-12-18 14:00:46,357 INFO L226 Difference]: Without dead ends: 19496 [2019-12-18 14:00:46,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:00:46,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19496 states. [2019-12-18 14:00:47,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19496 to 18230. [2019-12-18 14:00:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18230 states. [2019-12-18 14:00:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18230 states to 18230 states and 55601 transitions. [2019-12-18 14:00:47,124 INFO L78 Accepts]: Start accepts. Automaton has 18230 states and 55601 transitions. Word has length 27 [2019-12-18 14:00:47,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:47,124 INFO L462 AbstractCegarLoop]: Abstraction has 18230 states and 55601 transitions. [2019-12-18 14:00:47,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand 18230 states and 55601 transitions. [2019-12-18 14:00:47,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 14:00:47,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:47,137 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-18 14:00:47,138 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:47,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:47,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1978987791, now seen corresponding path program 1 times [2019-12-18 14:00:47,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:47,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935912897] [2019-12-18 14:00:47,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:47,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935912897] [2019-12-18 14:00:47,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:47,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:47,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052120815] [2019-12-18 14:00:47,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:47,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:47,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:47,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:47,193 INFO L87 Difference]: Start difference. First operand 18230 states and 55601 transitions. Second operand 5 states. [2019-12-18 14:00:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:47,530 INFO L93 Difference]: Finished difference Result 21384 states and 64177 transitions. [2019-12-18 14:00:47,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:00:47,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 14:00:47,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:47,569 INFO L225 Difference]: With dead ends: 21384 [2019-12-18 14:00:47,569 INFO L226 Difference]: Without dead ends: 21384 [2019-12-18 14:00:47,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:00:47,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21384 states. [2019-12-18 14:00:47,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21384 to 17323. [2019-12-18 14:00:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17323 states. [2019-12-18 14:00:47,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17323 states to 17323 states and 52883 transitions. [2019-12-18 14:00:47,842 INFO L78 Accepts]: Start accepts. Automaton has 17323 states and 52883 transitions. Word has length 28 [2019-12-18 14:00:47,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:47,843 INFO L462 AbstractCegarLoop]: Abstraction has 17323 states and 52883 transitions. [2019-12-18 14:00:47,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 17323 states and 52883 transitions. [2019-12-18 14:00:47,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 14:00:47,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:47,860 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] [2019-12-18 14:00:47,860 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:47,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:47,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1850577991, now seen corresponding path program 1 times [2019-12-18 14:00:47,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:47,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990236380] [2019-12-18 14:00:47,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:48,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990236380] [2019-12-18 14:00:48,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:48,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:00:48,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512247089] [2019-12-18 14:00:48,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:00:48,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:48,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:00:48,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:00:48,014 INFO L87 Difference]: Start difference. First operand 17323 states and 52883 transitions. Second operand 7 states. [2019-12-18 14:00:49,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:49,010 INFO L93 Difference]: Finished difference Result 25126 states and 74494 transitions. [2019-12-18 14:00:49,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 14:00:49,011 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 14:00:49,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:49,059 INFO L225 Difference]: With dead ends: 25126 [2019-12-18 14:00:49,059 INFO L226 Difference]: Without dead ends: 25126 [2019-12-18 14:00:49,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:00:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25126 states. [2019-12-18 14:00:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25126 to 18107. [2019-12-18 14:00:49,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18107 states. [2019-12-18 14:00:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18107 states to 18107 states and 55159 transitions. [2019-12-18 14:00:49,563 INFO L78 Accepts]: Start accepts. Automaton has 18107 states and 55159 transitions. Word has length 33 [2019-12-18 14:00:49,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:49,563 INFO L462 AbstractCegarLoop]: Abstraction has 18107 states and 55159 transitions. [2019-12-18 14:00:49,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:00:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 18107 states and 55159 transitions. [2019-12-18 14:00:49,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 14:00:49,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:49,583 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] [2019-12-18 14:00:49,583 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:49,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:49,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1137221687, now seen corresponding path program 2 times [2019-12-18 14:00:49,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:49,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509454776] [2019-12-18 14:00:49,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:49,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509454776] [2019-12-18 14:00:49,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:49,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:00:49,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134928435] [2019-12-18 14:00:49,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:00:49,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:49,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:00:49,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:00:49,656 INFO L87 Difference]: Start difference. First operand 18107 states and 55159 transitions. Second operand 6 states. [2019-12-18 14:00:50,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:50,338 INFO L93 Difference]: Finished difference Result 22885 states and 68158 transitions. [2019-12-18 14:00:50,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:00:50,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 14:00:50,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:50,374 INFO L225 Difference]: With dead ends: 22885 [2019-12-18 14:00:50,375 INFO L226 Difference]: Without dead ends: 22885 [2019-12-18 14:00:50,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:00:50,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22885 states. [2019-12-18 14:00:50,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22885 to 18692. [2019-12-18 14:00:50,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18692 states. [2019-12-18 14:00:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18692 states to 18692 states and 56821 transitions. [2019-12-18 14:00:50,680 INFO L78 Accepts]: Start accepts. Automaton has 18692 states and 56821 transitions. Word has length 33 [2019-12-18 14:00:50,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:50,680 INFO L462 AbstractCegarLoop]: Abstraction has 18692 states and 56821 transitions. [2019-12-18 14:00:50,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:00:50,680 INFO L276 IsEmpty]: Start isEmpty. Operand 18692 states and 56821 transitions. [2019-12-18 14:00:50,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 14:00:50,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:50,700 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] [2019-12-18 14:00:50,700 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:50,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:50,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1933444630, now seen corresponding path program 1 times [2019-12-18 14:00:50,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:50,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643651365] [2019-12-18 14:00:50,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:50,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:50,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643651365] [2019-12-18 14:00:50,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:50,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:00:50,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714769730] [2019-12-18 14:00:50,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:00:50,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:50,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:00:50,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:00:50,780 INFO L87 Difference]: Start difference. First operand 18692 states and 56821 transitions. Second operand 6 states. [2019-12-18 14:00:51,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:51,457 INFO L93 Difference]: Finished difference Result 23844 states and 71231 transitions. [2019-12-18 14:00:51,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:00:51,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 14:00:51,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:51,492 INFO L225 Difference]: With dead ends: 23844 [2019-12-18 14:00:51,492 INFO L226 Difference]: Without dead ends: 23844 [2019-12-18 14:00:51,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:00:51,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23844 states. [2019-12-18 14:00:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23844 to 15691. [2019-12-18 14:00:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15691 states. [2019-12-18 14:00:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15691 states to 15691 states and 48077 transitions. [2019-12-18 14:00:51,773 INFO L78 Accepts]: Start accepts. Automaton has 15691 states and 48077 transitions. Word has length 34 [2019-12-18 14:00:51,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:51,774 INFO L462 AbstractCegarLoop]: Abstraction has 15691 states and 48077 transitions. [2019-12-18 14:00:51,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:00:51,774 INFO L276 IsEmpty]: Start isEmpty. Operand 15691 states and 48077 transitions. [2019-12-18 14:00:51,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 14:00:51,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:51,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:51,790 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:51,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:51,791 INFO L82 PathProgramCache]: Analyzing trace with hash -390301387, now seen corresponding path program 1 times [2019-12-18 14:00:51,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:51,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728443779] [2019-12-18 14:00:51,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:51,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:51,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728443779] [2019-12-18 14:00:51,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:51,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:51,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129107902] [2019-12-18 14:00:51,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:51,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:51,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:51,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:51,834 INFO L87 Difference]: Start difference. First operand 15691 states and 48077 transitions. Second operand 3 states. [2019-12-18 14:00:51,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:51,951 INFO L93 Difference]: Finished difference Result 29593 states and 90773 transitions. [2019-12-18 14:00:51,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:51,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 14:00:51,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:51,981 INFO L225 Difference]: With dead ends: 29593 [2019-12-18 14:00:51,981 INFO L226 Difference]: Without dead ends: 16129 [2019-12-18 14:00:51,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:52,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16129 states. [2019-12-18 14:00:52,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16129 to 16073. [2019-12-18 14:00:52,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16073 states. [2019-12-18 14:00:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16073 states to 16073 states and 48010 transitions. [2019-12-18 14:00:52,323 INFO L78 Accepts]: Start accepts. Automaton has 16073 states and 48010 transitions. Word has length 39 [2019-12-18 14:00:52,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:52,323 INFO L462 AbstractCegarLoop]: Abstraction has 16073 states and 48010 transitions. [2019-12-18 14:00:52,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:52,323 INFO L276 IsEmpty]: Start isEmpty. Operand 16073 states and 48010 transitions. [2019-12-18 14:00:52,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:00:52,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:52,340 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:52,340 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:52,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:52,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1543157030, now seen corresponding path program 1 times [2019-12-18 14:00:52,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:52,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653066536] [2019-12-18 14:00:52,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:52,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653066536] [2019-12-18 14:00:52,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:52,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:00:52,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984829983] [2019-12-18 14:00:52,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:52,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:52,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:52,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:52,408 INFO L87 Difference]: Start difference. First operand 16073 states and 48010 transitions. Second operand 5 states. [2019-12-18 14:00:52,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:52,954 INFO L93 Difference]: Finished difference Result 23632 states and 69938 transitions. [2019-12-18 14:00:52,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:00:52,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 14:00:52,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:52,987 INFO L225 Difference]: With dead ends: 23632 [2019-12-18 14:00:52,987 INFO L226 Difference]: Without dead ends: 23632 [2019-12-18 14:00:52,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:00:53,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23632 states. [2019-12-18 14:00:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23632 to 21777. [2019-12-18 14:00:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21777 states. [2019-12-18 14:00:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21777 states to 21777 states and 64983 transitions. [2019-12-18 14:00:53,323 INFO L78 Accepts]: Start accepts. Automaton has 21777 states and 64983 transitions. Word has length 40 [2019-12-18 14:00:53,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:53,324 INFO L462 AbstractCegarLoop]: Abstraction has 21777 states and 64983 transitions. [2019-12-18 14:00:53,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 21777 states and 64983 transitions. [2019-12-18 14:00:53,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:00:53,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:53,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:53,353 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:53,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:53,353 INFO L82 PathProgramCache]: Analyzing trace with hash 838743556, now seen corresponding path program 2 times [2019-12-18 14:00:53,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:53,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411173460] [2019-12-18 14:00:53,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:53,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411173460] [2019-12-18 14:00:53,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:53,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:00:53,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952531924] [2019-12-18 14:00:53,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:53,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:53,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:53,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:53,412 INFO L87 Difference]: Start difference. First operand 21777 states and 64983 transitions. Second operand 5 states. [2019-12-18 14:00:53,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:53,524 INFO L93 Difference]: Finished difference Result 20526 states and 62067 transitions. [2019-12-18 14:00:53,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:00:53,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 14:00:53,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:53,565 INFO L225 Difference]: With dead ends: 20526 [2019-12-18 14:00:53,565 INFO L226 Difference]: Without dead ends: 18967 [2019-12-18 14:00:53,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:53,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18967 states. [2019-12-18 14:00:53,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18967 to 18092. [2019-12-18 14:00:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18092 states. [2019-12-18 14:00:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18092 states to 18092 states and 56295 transitions. [2019-12-18 14:00:54,003 INFO L78 Accepts]: Start accepts. Automaton has 18092 states and 56295 transitions. Word has length 40 [2019-12-18 14:00:54,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:54,004 INFO L462 AbstractCegarLoop]: Abstraction has 18092 states and 56295 transitions. [2019-12-18 14:00:54,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 18092 states and 56295 transitions. [2019-12-18 14:00:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:00:54,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:54,036 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:54,036 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:54,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:54,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1449191354, now seen corresponding path program 1 times [2019-12-18 14:00:54,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:54,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810161346] [2019-12-18 14:00:54,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:54,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810161346] [2019-12-18 14:00:54,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:54,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:54,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401513548] [2019-12-18 14:00:54,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:54,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:54,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:54,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:54,103 INFO L87 Difference]: Start difference. First operand 18092 states and 56295 transitions. Second operand 3 states. [2019-12-18 14:00:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:54,302 INFO L93 Difference]: Finished difference Result 24294 states and 73055 transitions. [2019-12-18 14:00:54,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:54,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 14:00:54,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:54,333 INFO L225 Difference]: With dead ends: 24294 [2019-12-18 14:00:54,333 INFO L226 Difference]: Without dead ends: 24294 [2019-12-18 14:00:54,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:54,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24294 states. [2019-12-18 14:00:54,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24294 to 18274. [2019-12-18 14:00:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18274 states. [2019-12-18 14:00:54,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18274 states to 18274 states and 55190 transitions. [2019-12-18 14:00:54,634 INFO L78 Accepts]: Start accepts. Automaton has 18274 states and 55190 transitions. Word has length 64 [2019-12-18 14:00:54,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:54,635 INFO L462 AbstractCegarLoop]: Abstraction has 18274 states and 55190 transitions. [2019-12-18 14:00:54,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:54,635 INFO L276 IsEmpty]: Start isEmpty. Operand 18274 states and 55190 transitions. [2019-12-18 14:00:54,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:00:54,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:54,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:54,663 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:54,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:54,664 INFO L82 PathProgramCache]: Analyzing trace with hash -237391966, now seen corresponding path program 1 times [2019-12-18 14:00:54,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:54,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667119974] [2019-12-18 14:00:54,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:54,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667119974] [2019-12-18 14:00:54,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:54,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:00:54,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131842764] [2019-12-18 14:00:54,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:00:54,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:54,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:00:54,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:00:54,765 INFO L87 Difference]: Start difference. First operand 18274 states and 55190 transitions. Second operand 8 states. [2019-12-18 14:00:56,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:56,045 INFO L93 Difference]: Finished difference Result 80145 states and 240194 transitions. [2019-12-18 14:00:56,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:00:56,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 14:00:56,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:56,164 INFO L225 Difference]: With dead ends: 80145 [2019-12-18 14:00:56,164 INFO L226 Difference]: Without dead ends: 58918 [2019-12-18 14:00:56,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 14:00:56,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58918 states. [2019-12-18 14:00:57,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58918 to 21155. [2019-12-18 14:00:57,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21155 states. [2019-12-18 14:00:57,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21155 states to 21155 states and 64148 transitions. [2019-12-18 14:00:57,080 INFO L78 Accepts]: Start accepts. Automaton has 21155 states and 64148 transitions. Word has length 64 [2019-12-18 14:00:57,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:57,080 INFO L462 AbstractCegarLoop]: Abstraction has 21155 states and 64148 transitions. [2019-12-18 14:00:57,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:00:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 21155 states and 64148 transitions. [2019-12-18 14:00:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:00:57,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:57,104 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:57,104 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:57,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:57,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1797634292, now seen corresponding path program 2 times [2019-12-18 14:00:57,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:57,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348059634] [2019-12-18 14:00:57,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:57,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:57,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348059634] [2019-12-18 14:00:57,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:57,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:00:57,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201485176] [2019-12-18 14:00:57,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:00:57,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:57,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:00:57,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:00:57,183 INFO L87 Difference]: Start difference. First operand 21155 states and 64148 transitions. Second operand 7 states. [2019-12-18 14:00:57,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:57,655 INFO L93 Difference]: Finished difference Result 60723 states and 180590 transitions. [2019-12-18 14:00:57,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:00:57,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 14:00:57,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:57,713 INFO L225 Difference]: With dead ends: 60723 [2019-12-18 14:00:57,713 INFO L226 Difference]: Without dead ends: 42175 [2019-12-18 14:00:57,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:00:57,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42175 states. [2019-12-18 14:00:58,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42175 to 24456. [2019-12-18 14:00:58,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24456 states. [2019-12-18 14:00:58,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24456 states to 24456 states and 73578 transitions. [2019-12-18 14:00:58,215 INFO L78 Accepts]: Start accepts. Automaton has 24456 states and 73578 transitions. Word has length 64 [2019-12-18 14:00:58,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:58,216 INFO L462 AbstractCegarLoop]: Abstraction has 24456 states and 73578 transitions. [2019-12-18 14:00:58,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:00:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand 24456 states and 73578 transitions. [2019-12-18 14:00:58,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:00:58,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:58,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:58,240 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:58,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:58,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1864819808, now seen corresponding path program 3 times [2019-12-18 14:00:58,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:58,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559436987] [2019-12-18 14:00:58,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:58,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559436987] [2019-12-18 14:00:58,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:58,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:00:58,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403549301] [2019-12-18 14:00:58,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:00:58,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:58,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:00:58,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:00:58,374 INFO L87 Difference]: Start difference. First operand 24456 states and 73578 transitions. Second operand 9 states. [2019-12-18 14:00:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:59,950 INFO L93 Difference]: Finished difference Result 82000 states and 242893 transitions. [2019-12-18 14:00:59,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 14:00:59,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 14:00:59,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:00,055 INFO L225 Difference]: With dead ends: 82000 [2019-12-18 14:01:00,055 INFO L226 Difference]: Without dead ends: 78263 [2019-12-18 14:01:00,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-18 14:01:00,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78263 states. [2019-12-18 14:01:00,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78263 to 24486. [2019-12-18 14:01:00,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24486 states. [2019-12-18 14:01:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24486 states to 24486 states and 73706 transitions. [2019-12-18 14:01:00,802 INFO L78 Accepts]: Start accepts. Automaton has 24486 states and 73706 transitions. Word has length 64 [2019-12-18 14:01:00,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:00,802 INFO L462 AbstractCegarLoop]: Abstraction has 24486 states and 73706 transitions. [2019-12-18 14:01:00,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:01:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 24486 states and 73706 transitions. [2019-12-18 14:01:00,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:01:00,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:00,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:00,835 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:00,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:00,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1743895244, now seen corresponding path program 4 times [2019-12-18 14:01:00,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:00,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259973585] [2019-12-18 14:01:00,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:00,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:00,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259973585] [2019-12-18 14:01:00,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:00,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:01:00,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652263854] [2019-12-18 14:01:00,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:01:00,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:00,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:01:00,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:01:00,951 INFO L87 Difference]: Start difference. First operand 24486 states and 73706 transitions. Second operand 9 states. [2019-12-18 14:01:02,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:02,351 INFO L93 Difference]: Finished difference Result 98855 states and 292935 transitions. [2019-12-18 14:01:02,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:01:02,351 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 14:01:02,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:02,505 INFO L225 Difference]: With dead ends: 98855 [2019-12-18 14:01:02,505 INFO L226 Difference]: Without dead ends: 95231 [2019-12-18 14:01:02,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:01:03,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95231 states. [2019-12-18 14:01:03,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95231 to 24523. [2019-12-18 14:01:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24523 states. [2019-12-18 14:01:03,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24523 states to 24523 states and 73910 transitions. [2019-12-18 14:01:03,602 INFO L78 Accepts]: Start accepts. Automaton has 24523 states and 73910 transitions. Word has length 64 [2019-12-18 14:01:03,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:03,602 INFO L462 AbstractCegarLoop]: Abstraction has 24523 states and 73910 transitions. [2019-12-18 14:01:03,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:01:03,602 INFO L276 IsEmpty]: Start isEmpty. Operand 24523 states and 73910 transitions. [2019-12-18 14:01:03,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:01:03,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:03,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:03,629 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:03,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:03,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1299608434, now seen corresponding path program 5 times [2019-12-18 14:01:03,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:03,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924703399] [2019-12-18 14:01:03,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:03,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924703399] [2019-12-18 14:01:03,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:03,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:01:03,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244672203] [2019-12-18 14:01:03,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:01:03,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:03,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:01:03,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:01:03,727 INFO L87 Difference]: Start difference. First operand 24523 states and 73910 transitions. Second operand 7 states. [2019-12-18 14:01:04,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:04,289 INFO L93 Difference]: Finished difference Result 51563 states and 153345 transitions. [2019-12-18 14:01:04,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:01:04,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 14:01:04,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:04,400 INFO L225 Difference]: With dead ends: 51563 [2019-12-18 14:01:04,400 INFO L226 Difference]: Without dead ends: 44912 [2019-12-18 14:01:04,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:01:04,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44912 states. [2019-12-18 14:01:05,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44912 to 24831. [2019-12-18 14:01:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24831 states. [2019-12-18 14:01:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24831 states to 24831 states and 74861 transitions. [2019-12-18 14:01:05,320 INFO L78 Accepts]: Start accepts. Automaton has 24831 states and 74861 transitions. Word has length 64 [2019-12-18 14:01:05,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:05,321 INFO L462 AbstractCegarLoop]: Abstraction has 24831 states and 74861 transitions. [2019-12-18 14:01:05,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:01:05,321 INFO L276 IsEmpty]: Start isEmpty. Operand 24831 states and 74861 transitions. [2019-12-18 14:01:05,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:01:05,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:05,359 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:05,359 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:05,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:05,359 INFO L82 PathProgramCache]: Analyzing trace with hash 2138548684, now seen corresponding path program 6 times [2019-12-18 14:01:05,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:05,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937942486] [2019-12-18 14:01:05,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:05,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:05,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937942486] [2019-12-18 14:01:05,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:05,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:01:05,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999791792] [2019-12-18 14:01:05,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:01:05,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:05,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:01:05,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:01:05,683 INFO L87 Difference]: Start difference. First operand 24831 states and 74861 transitions. Second operand 3 states. [2019-12-18 14:01:05,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:05,915 INFO L93 Difference]: Finished difference Result 30036 states and 90273 transitions. [2019-12-18 14:01:05,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:01:05,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 14:01:05,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:05,982 INFO L225 Difference]: With dead ends: 30036 [2019-12-18 14:01:05,982 INFO L226 Difference]: Without dead ends: 30036 [2019-12-18 14:01:05,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:01:06,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30036 states. [2019-12-18 14:01:06,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30036 to 25720. [2019-12-18 14:01:06,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25720 states. [2019-12-18 14:01:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25720 states to 25720 states and 77719 transitions. [2019-12-18 14:01:06,733 INFO L78 Accepts]: Start accepts. Automaton has 25720 states and 77719 transitions. Word has length 64 [2019-12-18 14:01:06,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:06,733 INFO L462 AbstractCegarLoop]: Abstraction has 25720 states and 77719 transitions. [2019-12-18 14:01:06,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:01:06,733 INFO L276 IsEmpty]: Start isEmpty. Operand 25720 states and 77719 transitions. [2019-12-18 14:01:06,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:01:06,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:06,771 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:06,772 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:06,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:06,772 INFO L82 PathProgramCache]: Analyzing trace with hash 649944659, now seen corresponding path program 1 times [2019-12-18 14:01:06,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:06,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142904969] [2019-12-18 14:01:06,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:06,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142904969] [2019-12-18 14:01:06,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:06,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:01:06,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981462101] [2019-12-18 14:01:06,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:01:06,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:06,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:01:06,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:01:06,870 INFO L87 Difference]: Start difference. First operand 25720 states and 77719 transitions. Second operand 8 states. [2019-12-18 14:01:07,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:07,790 INFO L93 Difference]: Finished difference Result 68691 states and 204481 transitions. [2019-12-18 14:01:07,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 14:01:07,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 14:01:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:07,883 INFO L225 Difference]: With dead ends: 68691 [2019-12-18 14:01:07,883 INFO L226 Difference]: Without dead ends: 64109 [2019-12-18 14:01:07,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 14:01:08,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64109 states. [2019-12-18 14:01:08,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64109 to 25809. [2019-12-18 14:01:08,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25809 states. [2019-12-18 14:01:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25809 states to 25809 states and 78069 transitions. [2019-12-18 14:01:08,928 INFO L78 Accepts]: Start accepts. Automaton has 25809 states and 78069 transitions. Word has length 65 [2019-12-18 14:01:08,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:08,929 INFO L462 AbstractCegarLoop]: Abstraction has 25809 states and 78069 transitions. [2019-12-18 14:01:08,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:01:08,929 INFO L276 IsEmpty]: Start isEmpty. Operand 25809 states and 78069 transitions. [2019-12-18 14:01:08,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:01:08,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:08,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:08,960 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:08,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:08,961 INFO L82 PathProgramCache]: Analyzing trace with hash -824760731, now seen corresponding path program 2 times [2019-12-18 14:01:08,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:08,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018723932] [2019-12-18 14:01:08,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:09,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018723932] [2019-12-18 14:01:09,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:09,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:01:09,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042638346] [2019-12-18 14:01:09,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:01:09,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:09,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:01:09,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:01:09,080 INFO L87 Difference]: Start difference. First operand 25809 states and 78069 transitions. Second operand 9 states. [2019-12-18 14:01:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:10,325 INFO L93 Difference]: Finished difference Result 79915 states and 236179 transitions. [2019-12-18 14:01:10,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 14:01:10,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 14:01:10,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:10,434 INFO L225 Difference]: With dead ends: 79915 [2019-12-18 14:01:10,435 INFO L226 Difference]: Without dead ends: 75333 [2019-12-18 14:01:10,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:01:10,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75333 states. [2019-12-18 14:01:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75333 to 25817. [2019-12-18 14:01:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25817 states. [2019-12-18 14:01:11,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25817 states to 25817 states and 78084 transitions. [2019-12-18 14:01:11,204 INFO L78 Accepts]: Start accepts. Automaton has 25817 states and 78084 transitions. Word has length 65 [2019-12-18 14:01:11,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:11,205 INFO L462 AbstractCegarLoop]: Abstraction has 25817 states and 78084 transitions. [2019-12-18 14:01:11,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:01:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 25817 states and 78084 transitions. [2019-12-18 14:01:11,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:01:11,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:11,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:11,233 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:11,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1258547867, now seen corresponding path program 3 times [2019-12-18 14:01:11,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:11,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331927937] [2019-12-18 14:01:11,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:11,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:11,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331927937] [2019-12-18 14:01:11,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:11,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:01:11,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325195235] [2019-12-18 14:01:11,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:01:11,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:11,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:01:11,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:01:11,346 INFO L87 Difference]: Start difference. First operand 25817 states and 78084 transitions. Second operand 9 states. [2019-12-18 14:01:12,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:12,769 INFO L93 Difference]: Finished difference Result 88714 states and 261426 transitions. [2019-12-18 14:01:12,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 14:01:12,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 14:01:12,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:12,888 INFO L225 Difference]: With dead ends: 88714 [2019-12-18 14:01:12,889 INFO L226 Difference]: Without dead ends: 84158 [2019-12-18 14:01:12,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2019-12-18 14:01:13,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84158 states. [2019-12-18 14:01:13,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84158 to 25729. [2019-12-18 14:01:13,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25729 states. [2019-12-18 14:01:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25729 states to 25729 states and 77660 transitions. [2019-12-18 14:01:13,692 INFO L78 Accepts]: Start accepts. Automaton has 25729 states and 77660 transitions. Word has length 65 [2019-12-18 14:01:13,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:13,693 INFO L462 AbstractCegarLoop]: Abstraction has 25729 states and 77660 transitions. [2019-12-18 14:01:13,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:01:13,693 INFO L276 IsEmpty]: Start isEmpty. Operand 25729 states and 77660 transitions. [2019-12-18 14:01:13,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:01:13,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:13,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:13,718 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:13,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:13,719 INFO L82 PathProgramCache]: Analyzing trace with hash -374970767, now seen corresponding path program 4 times [2019-12-18 14:01:13,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:13,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333620930] [2019-12-18 14:01:13,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:13,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333620930] [2019-12-18 14:01:13,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:13,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:01:13,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719703638] [2019-12-18 14:01:13,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:01:13,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:13,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:01:13,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:01:13,779 INFO L87 Difference]: Start difference. First operand 25729 states and 77660 transitions. Second operand 4 states. [2019-12-18 14:01:13,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:13,953 INFO L93 Difference]: Finished difference Result 25729 states and 77465 transitions. [2019-12-18 14:01:13,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:01:13,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 14:01:13,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:14,011 INFO L225 Difference]: With dead ends: 25729 [2019-12-18 14:01:14,011 INFO L226 Difference]: Without dead ends: 25729 [2019-12-18 14:01:14,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:01:14,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25729 states. [2019-12-18 14:01:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25729 to 24043. [2019-12-18 14:01:14,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24043 states. [2019-12-18 14:01:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24043 states to 24043 states and 72396 transitions. [2019-12-18 14:01:14,616 INFO L78 Accepts]: Start accepts. Automaton has 24043 states and 72396 transitions. Word has length 65 [2019-12-18 14:01:14,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:14,616 INFO L462 AbstractCegarLoop]: Abstraction has 24043 states and 72396 transitions. [2019-12-18 14:01:14,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:01:14,617 INFO L276 IsEmpty]: Start isEmpty. Operand 24043 states and 72396 transitions. [2019-12-18 14:01:14,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:01:14,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:14,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:14,643 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:14,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:14,643 INFO L82 PathProgramCache]: Analyzing trace with hash -704047196, now seen corresponding path program 1 times [2019-12-18 14:01:14,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:14,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071217907] [2019-12-18 14:01:14,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:14,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071217907] [2019-12-18 14:01:14,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:14,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:01:14,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895019432] [2019-12-18 14:01:14,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:01:14,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:14,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:01:14,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:01:14,924 INFO L87 Difference]: Start difference. First operand 24043 states and 72396 transitions. Second operand 3 states. [2019-12-18 14:01:15,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:15,048 INFO L93 Difference]: Finished difference Result 24043 states and 72395 transitions. [2019-12-18 14:01:15,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:01:15,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:01:15,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:15,106 INFO L225 Difference]: With dead ends: 24043 [2019-12-18 14:01:15,106 INFO L226 Difference]: Without dead ends: 24043 [2019-12-18 14:01:15,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:01:15,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24043 states. [2019-12-18 14:01:15,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24043 to 19293. [2019-12-18 14:01:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19293 states. [2019-12-18 14:01:15,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19293 states to 19293 states and 59234 transitions. [2019-12-18 14:01:15,623 INFO L78 Accepts]: Start accepts. Automaton has 19293 states and 59234 transitions. Word has length 65 [2019-12-18 14:01:15,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:15,624 INFO L462 AbstractCegarLoop]: Abstraction has 19293 states and 59234 transitions. [2019-12-18 14:01:15,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:01:15,624 INFO L276 IsEmpty]: Start isEmpty. Operand 19293 states and 59234 transitions. [2019-12-18 14:01:15,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:01:15,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:15,652 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:15,652 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:15,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:15,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1061804981, now seen corresponding path program 1 times [2019-12-18 14:01:15,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:15,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482915315] [2019-12-18 14:01:15,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:15,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482915315] [2019-12-18 14:01:15,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:15,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:01:15,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443319683] [2019-12-18 14:01:15,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:01:15,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:15,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:01:15,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:01:15,727 INFO L87 Difference]: Start difference. First operand 19293 states and 59234 transitions. Second operand 3 states. [2019-12-18 14:01:15,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:15,825 INFO L93 Difference]: Finished difference Result 16601 states and 49800 transitions. [2019-12-18 14:01:15,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:01:15,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 14:01:15,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:15,864 INFO L225 Difference]: With dead ends: 16601 [2019-12-18 14:01:15,865 INFO L226 Difference]: Without dead ends: 16601 [2019-12-18 14:01:15,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:01:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16601 states. [2019-12-18 14:01:16,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16601 to 15601. [2019-12-18 14:01:16,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15601 states. [2019-12-18 14:01:16,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15601 states to 15601 states and 46767 transitions. [2019-12-18 14:01:16,307 INFO L78 Accepts]: Start accepts. Automaton has 15601 states and 46767 transitions. Word has length 66 [2019-12-18 14:01:16,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:16,307 INFO L462 AbstractCegarLoop]: Abstraction has 15601 states and 46767 transitions. [2019-12-18 14:01:16,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:01:16,308 INFO L276 IsEmpty]: Start isEmpty. Operand 15601 states and 46767 transitions. [2019-12-18 14:01:16,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:01:16,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:16,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:16,333 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:16,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:16,333 INFO L82 PathProgramCache]: Analyzing trace with hash 28997027, now seen corresponding path program 1 times [2019-12-18 14:01:16,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:16,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077559083] [2019-12-18 14:01:16,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:16,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077559083] [2019-12-18 14:01:16,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:16,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:01:16,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250757119] [2019-12-18 14:01:16,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:01:16,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:16,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:01:16,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:01:16,841 INFO L87 Difference]: Start difference. First operand 15601 states and 46767 transitions. Second operand 16 states. [2019-12-18 14:01:22,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:22,048 INFO L93 Difference]: Finished difference Result 29344 states and 86729 transitions. [2019-12-18 14:01:22,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-18 14:01:22,049 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 14:01:22,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:22,080 INFO L225 Difference]: With dead ends: 29344 [2019-12-18 14:01:22,080 INFO L226 Difference]: Without dead ends: 23655 [2019-12-18 14:01:22,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=551, Invalid=2641, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 14:01:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23655 states. [2019-12-18 14:01:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23655 to 16555. [2019-12-18 14:01:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16555 states. [2019-12-18 14:01:22,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16555 states to 16555 states and 49199 transitions. [2019-12-18 14:01:22,361 INFO L78 Accepts]: Start accepts. Automaton has 16555 states and 49199 transitions. Word has length 67 [2019-12-18 14:01:22,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:22,362 INFO L462 AbstractCegarLoop]: Abstraction has 16555 states and 49199 transitions. [2019-12-18 14:01:22,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:01:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 16555 states and 49199 transitions. [2019-12-18 14:01:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:01:22,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:22,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:22,379 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:22,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:22,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1388361059, now seen corresponding path program 2 times [2019-12-18 14:01:22,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:22,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188485578] [2019-12-18 14:01:22,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:22,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188485578] [2019-12-18 14:01:22,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:22,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:01:22,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161781094] [2019-12-18 14:01:22,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:01:22,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:22,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:01:22,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:01:22,558 INFO L87 Difference]: Start difference. First operand 16555 states and 49199 transitions. Second operand 11 states. [2019-12-18 14:01:23,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:23,605 INFO L93 Difference]: Finished difference Result 34419 states and 102212 transitions. [2019-12-18 14:01:23,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 14:01:23,606 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 14:01:23,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:23,649 INFO L225 Difference]: With dead ends: 34419 [2019-12-18 14:01:23,650 INFO L226 Difference]: Without dead ends: 32504 [2019-12-18 14:01:23,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 14:01:23,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32504 states. [2019-12-18 14:01:24,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32504 to 20085. [2019-12-18 14:01:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20085 states. [2019-12-18 14:01:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20085 states to 20085 states and 59803 transitions. [2019-12-18 14:01:24,043 INFO L78 Accepts]: Start accepts. Automaton has 20085 states and 59803 transitions. Word has length 67 [2019-12-18 14:01:24,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:24,044 INFO L462 AbstractCegarLoop]: Abstraction has 20085 states and 59803 transitions. [2019-12-18 14:01:24,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:01:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 20085 states and 59803 transitions. [2019-12-18 14:01:24,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:01:24,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:24,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:24,064 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:24,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:24,064 INFO L82 PathProgramCache]: Analyzing trace with hash -899417817, now seen corresponding path program 3 times [2019-12-18 14:01:24,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:24,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324954187] [2019-12-18 14:01:24,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:24,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324954187] [2019-12-18 14:01:24,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:24,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:01:24,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265973133] [2019-12-18 14:01:24,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:01:24,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:24,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:01:24,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:01:24,227 INFO L87 Difference]: Start difference. First operand 20085 states and 59803 transitions. Second operand 11 states. [2019-12-18 14:01:25,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:25,164 INFO L93 Difference]: Finished difference Result 33243 states and 98031 transitions. [2019-12-18 14:01:25,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:01:25,165 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 14:01:25,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:25,201 INFO L225 Difference]: With dead ends: 33243 [2019-12-18 14:01:25,201 INFO L226 Difference]: Without dead ends: 26799 [2019-12-18 14:01:25,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:01:25,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26799 states. [2019-12-18 14:01:25,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26799 to 15809. [2019-12-18 14:01:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15809 states. [2019-12-18 14:01:25,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15809 states to 15809 states and 46963 transitions. [2019-12-18 14:01:25,624 INFO L78 Accepts]: Start accepts. Automaton has 15809 states and 46963 transitions. Word has length 67 [2019-12-18 14:01:25,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:25,624 INFO L462 AbstractCegarLoop]: Abstraction has 15809 states and 46963 transitions. [2019-12-18 14:01:25,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:01:25,625 INFO L276 IsEmpty]: Start isEmpty. Operand 15809 states and 46963 transitions. [2019-12-18 14:01:25,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:01:25,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:25,640 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:25,640 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:25,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:25,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1689948735, now seen corresponding path program 4 times [2019-12-18 14:01:25,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:25,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096173168] [2019-12-18 14:01:25,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:26,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096173168] [2019-12-18 14:01:26,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:26,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 14:01:26,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277124087] [2019-12-18 14:01:26,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 14:01:26,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:26,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 14:01:26,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:01:26,102 INFO L87 Difference]: Start difference. First operand 15809 states and 46963 transitions. Second operand 17 states. [2019-12-18 14:01:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:29,826 INFO L93 Difference]: Finished difference Result 21902 states and 64134 transitions. [2019-12-18 14:01:29,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 14:01:29,827 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 14:01:29,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:29,855 INFO L225 Difference]: With dead ends: 21902 [2019-12-18 14:01:29,855 INFO L226 Difference]: Without dead ends: 21575 [2019-12-18 14:01:29,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=331, Invalid=1475, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 14:01:29,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21575 states. [2019-12-18 14:01:30,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21575 to 15833. [2019-12-18 14:01:30,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15833 states. [2019-12-18 14:01:30,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15833 states to 15833 states and 47025 transitions. [2019-12-18 14:01:30,116 INFO L78 Accepts]: Start accepts. Automaton has 15833 states and 47025 transitions. Word has length 67 [2019-12-18 14:01:30,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:30,116 INFO L462 AbstractCegarLoop]: Abstraction has 15833 states and 47025 transitions. [2019-12-18 14:01:30,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 14:01:30,116 INFO L276 IsEmpty]: Start isEmpty. Operand 15833 states and 47025 transitions. [2019-12-18 14:01:30,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:01:30,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:30,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:30,131 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:30,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:30,132 INFO L82 PathProgramCache]: Analyzing trace with hash 145290943, now seen corresponding path program 5 times [2019-12-18 14:01:30,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:30,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813618114] [2019-12-18 14:01:30,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:30,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813618114] [2019-12-18 14:01:30,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:30,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:01:30,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847004653] [2019-12-18 14:01:30,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:01:30,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:30,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:01:30,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:01:30,238 INFO L87 Difference]: Start difference. First operand 15833 states and 47025 transitions. Second operand 9 states. [2019-12-18 14:01:31,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:31,477 INFO L93 Difference]: Finished difference Result 24815 states and 72954 transitions. [2019-12-18 14:01:31,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 14:01:31,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 14:01:31,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:31,510 INFO L225 Difference]: With dead ends: 24815 [2019-12-18 14:01:31,510 INFO L226 Difference]: Without dead ends: 24094 [2019-12-18 14:01:31,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:01:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24094 states. [2019-12-18 14:01:31,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24094 to 15279. [2019-12-18 14:01:31,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15279 states. [2019-12-18 14:01:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15279 states to 15279 states and 45491 transitions. [2019-12-18 14:01:31,884 INFO L78 Accepts]: Start accepts. Automaton has 15279 states and 45491 transitions. Word has length 67 [2019-12-18 14:01:31,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:31,885 INFO L462 AbstractCegarLoop]: Abstraction has 15279 states and 45491 transitions. [2019-12-18 14:01:31,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:01:31,885 INFO L276 IsEmpty]: Start isEmpty. Operand 15279 states and 45491 transitions. [2019-12-18 14:01:31,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:01:31,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:31,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:31,901 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:31,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:31,901 INFO L82 PathProgramCache]: Analyzing trace with hash -778064925, now seen corresponding path program 6 times [2019-12-18 14:01:31,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:31,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482111477] [2019-12-18 14:01:31,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:01:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:01:32,024 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:01:32,024 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:01:32,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= v_~z$r_buff0_thd0~0_144 0) (= v_~z$r_buff0_thd1~0_230 0) (= v_~z$w_buff0_used~0_947 0) (= v_~z$r_buff1_thd1~0_185 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1501~0.base_44| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1501~0.base_44|) |v_ULTIMATE.start_main_~#t1501~0.offset_28| 0)) |v_#memory_int_19|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1501~0.base_44| 4)) (= v_~z$w_buff1_used~0_563 0) (= v_~weak$$choice2~0_147 0) (= 0 v_~z$r_buff1_thd3~0_352) (= 0 v_~x~0_159) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$read_delayed~0_6 0) (= v_~z$mem_tmp~0_24 0) (= v_~z$r_buff0_thd2~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= |v_#valid_80| (store .cse0 |v_ULTIMATE.start_main_~#t1501~0.base_44| 1)) (= |v_ULTIMATE.start_main_~#t1501~0.offset_28| 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_cnt~0_155 0) (= v_~z$r_buff1_thd2~0_201 0) (= 0 v_~z$r_buff0_thd3~0_371) (= v_~main$tmp_guard1~0_38 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1501~0.base_44|) 0) (= v_~z$r_buff1_thd0~0_199 0) (= 0 |v_#NULL.base_7|) (= 0 v_~weak$$choice0~0_19) (= v_~z$w_buff1~0_328 0) (= v_~z~0_152 0) (= v_~z$w_buff0~0_540 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$flush_delayed~0_35) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1501~0.base_44|) (= v_~y~0_49 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1501~0.base=|v_ULTIMATE.start_main_~#t1501~0.base_44|, ULTIMATE.start_main_~#t1501~0.offset=|v_ULTIMATE.start_main_~#t1501~0.offset_28|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_201, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_59|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_328, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_37|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_99|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_75|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_144, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_199, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ~y~0=v_~y~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_126, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_947, ~z$w_buff0~0=v_~z$w_buff0~0_540, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_352, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ULTIMATE.start_main_~#t1502~0.offset=|v_ULTIMATE.start_main_~#t1502~0.offset_28|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_563, ~z$flush_delayed~0=v_~z$flush_delayed~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t1503~0.base=|v_ULTIMATE.start_main_~#t1503~0.base_25|, #NULL.base=|v_#NULL.base_7|, ~weak$$choice0~0=v_~weak$$choice0~0_19, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1503~0.offset=|v_ULTIMATE.start_main_~#t1503~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_80|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_185, #memory_int=|v_#memory_int_19|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_371, ULTIMATE.start_main_~#t1502~0.base=|v_ULTIMATE.start_main_~#t1502~0.base_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~z~0=v_~z~0_152, ~weak$$choice2~0=v_~weak$$choice2~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_230, ~x~0=v_~x~0_159} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1501~0.base, ULTIMATE.start_main_~#t1501~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t1502~0.offset, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1503~0.base, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t1503~0.offset, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t1502~0.base, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 14:01:32,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L818-1-->L820: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1502~0.base_13| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1502~0.base_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1502~0.base_13| 1)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1502~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1502~0.base_13|) |v_ULTIMATE.start_main_~#t1502~0.offset_11| 1))) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1502~0.base_13| 4)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1502~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1502~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1502~0.offset=|v_ULTIMATE.start_main_~#t1502~0.offset_11|, ULTIMATE.start_main_~#t1502~0.base=|v_ULTIMATE.start_main_~#t1502~0.base_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1502~0.offset, ULTIMATE.start_main_~#t1502~0.base, #length] because there is no mapped edge [2019-12-18 14:01:32,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L820-1-->L822: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1503~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1503~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1503~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1503~0.base_13|) |v_ULTIMATE.start_main_~#t1503~0.offset_11| 2)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t1503~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1503~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1503~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1503~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1503~0.offset=|v_ULTIMATE.start_main_~#t1503~0.offset_11|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1503~0.base=|v_ULTIMATE.start_main_~#t1503~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1503~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1503~0.base] because there is no mapped edge [2019-12-18 14:01:32,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_163 v_~z$w_buff1_used~0_112) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= v_~z$w_buff0~0_38 v_~z$w_buff1~0_37) (= v_P0Thread1of1ForFork0_~arg.base_14 |v_P0Thread1of1ForFork0_#in~arg.base_14|) (= v_~z$w_buff0_used~0_162 1) (= 1 v_~z$w_buff0~0_37) (= v_P0Thread1of1ForFork0_~arg.offset_14 |v_P0Thread1of1ForFork0_#in~arg.offset_14|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_16 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= (mod v_~z$w_buff1_used~0_112 256) 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_14|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_163, ~z$w_buff0~0=v_~z$w_buff0~0_38, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_14|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_14|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_162, ~z$w_buff0~0=v_~z$w_buff0~0_37, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_16, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_14|, ~z$w_buff1~0=v_~z$w_buff1~0_37, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_14, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_14} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 14:01:32,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In517553470 256)))) (or (and (= ~z$w_buff0~0_In517553470 |P2Thread1of1ForFork2_#t~ite20_Out517553470|) (= |P2Thread1of1ForFork2_#t~ite21_Out517553470| |P2Thread1of1ForFork2_#t~ite20_Out517553470|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In517553470 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In517553470 256)) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In517553470 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In517553470 256))))) (and (= ~z$w_buff0~0_In517553470 |P2Thread1of1ForFork2_#t~ite21_Out517553470|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite20_In517553470| |P2Thread1of1ForFork2_#t~ite20_Out517553470|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In517553470, ~z$w_buff0_used~0=~z$w_buff0_used~0_In517553470, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_In517553470|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In517553470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In517553470, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In517553470, ~weak$$choice2~0=~weak$$choice2~0_In517553470} OutVars{~z$w_buff0~0=~z$w_buff0~0_In517553470, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out517553470|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In517553470, P2Thread1of1ForFork2_#t~ite21=|P2Thread1of1ForFork2_#t~ite21_Out517553470|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In517553470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In517553470, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In517553470, ~weak$$choice2~0=~weak$$choice2~0_In517553470} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 14:01:32,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L762-2-->L762-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1118954900 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1118954900 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-1118954900| |P1Thread1of1ForFork1_#t~ite10_Out-1118954900|))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-1118954900| ~z~0_In-1118954900) .cse2) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out-1118954900| ~z$w_buff1~0_In-1118954900) (not .cse1) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1118954900, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1118954900, ~z$w_buff1~0=~z$w_buff1~0_In-1118954900, ~z~0=~z~0_In-1118954900} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1118954900|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1118954900, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1118954900, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1118954900|, ~z$w_buff1~0=~z$w_buff1~0_In-1118954900, ~z~0=~z~0_In-1118954900} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 14:01:32,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In107551657 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In107551657 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out107551657|) (not .cse1)) (and (= ~z$w_buff0_used~0_In107551657 |P0Thread1of1ForFork0_#t~ite5_Out107551657|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In107551657, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In107551657} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out107551657|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In107551657, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In107551657} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:01:32,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L744-->L744-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-1853296790 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1853296790 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1853296790 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1853296790 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1853296790| ~z$w_buff1_used~0_In-1853296790) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1853296790| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1853296790, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1853296790, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1853296790, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1853296790} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1853296790|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1853296790, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1853296790, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1853296790, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1853296790} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:01:32,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L745-->L746: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-1760149556 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1760149556 256)))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out-1760149556 0)) (and (= ~z$r_buff0_thd1~0_In-1760149556 ~z$r_buff0_thd1~0_Out-1760149556) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1760149556, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1760149556} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1760149556, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1760149556|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1760149556} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:01:32,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-671459282 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-671459282 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-671459282| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-671459282| ~z$w_buff0_used~0_In-671459282) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-671459282, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-671459282} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-671459282, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-671459282|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-671459282} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 14:01:32,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L764-->L764-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In1446003037 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1446003037 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1446003037 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1446003037 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out1446003037| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite12_Out1446003037| ~z$w_buff1_used~0_In1446003037)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1446003037, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1446003037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1446003037, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1446003037} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1446003037, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1446003037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1446003037, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1446003037|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1446003037} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 14:01:32,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1923532022 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1923532022 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1923532022| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1923532022| ~z$r_buff0_thd2~0_In-1923532022) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1923532022, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1923532022} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1923532022, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1923532022|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1923532022} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 14:01:32,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2068028392 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In2068028392 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In2068028392 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In2068028392 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out2068028392|)) (and (= ~z$r_buff1_thd2~0_In2068028392 |P1Thread1of1ForFork1_#t~ite14_Out2068028392|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2068028392, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2068028392, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2068028392, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2068028392} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2068028392, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2068028392, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2068028392, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out2068028392|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2068028392} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:01:32,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~z$r_buff1_thd2~0_92) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 14:01:32,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L788-->L789: Formula: (and (= v_~z$r_buff0_thd3~0_137 v_~z$r_buff0_thd3~0_136) (not (= (mod v_~weak$$choice2~0_34 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_34} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_12|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 14:01:32,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1952993030 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite35_In-1952993030| |P2Thread1of1ForFork2_#t~ite35_Out-1952993030|) (= |P2Thread1of1ForFork2_#t~ite36_Out-1952993030| ~z$r_buff1_thd3~0_In-1952993030)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite36_Out-1952993030| |P2Thread1of1ForFork2_#t~ite35_Out-1952993030|) (= |P2Thread1of1ForFork2_#t~ite35_Out-1952993030| ~z$r_buff1_thd3~0_In-1952993030) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1952993030 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1952993030 256)) (and (= (mod ~z$w_buff1_used~0_In-1952993030 256) 0) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In-1952993030 256) 0) .cse1)))))) InVars {P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_In-1952993030|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1952993030, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1952993030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1952993030, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1952993030, ~weak$$choice2~0=~weak$$choice2~0_In-1952993030} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out-1952993030|, P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-1952993030|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1952993030, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1952993030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1952993030, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1952993030, ~weak$$choice2~0=~weak$$choice2~0_In-1952993030} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35, P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-18 14:01:32,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L791-->L795: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_62 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_62} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 14:01:32,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-2-->L795-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1094075034 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1094075034 256))) (.cse1 (= |P2Thread1of1ForFork2_#t~ite38_Out1094075034| |P2Thread1of1ForFork2_#t~ite39_Out1094075034|))) (or (and (not .cse0) .cse1 (= |P2Thread1of1ForFork2_#t~ite38_Out1094075034| ~z$w_buff1~0_In1094075034) (not .cse2)) (and (or .cse0 .cse2) .cse1 (= |P2Thread1of1ForFork2_#t~ite38_Out1094075034| ~z~0_In1094075034)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1094075034, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1094075034, ~z$w_buff1~0=~z$w_buff1~0_In1094075034, ~z~0=~z~0_In1094075034} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1094075034, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1094075034, ~z$w_buff1~0=~z$w_buff1~0_In1094075034, ~z~0=~z~0_In1094075034, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out1094075034|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out1094075034|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 14:01:32,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1915968651 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1915968651 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out-1915968651| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite40_Out-1915968651| ~z$w_buff0_used~0_In-1915968651)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1915968651, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1915968651} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1915968651, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1915968651, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-1915968651|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 14:01:32,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2121818841 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-2121818841 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-2121818841 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-2121818841 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-2121818841 |P2Thread1of1ForFork2_#t~ite41_Out-2121818841|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-2121818841|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2121818841, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2121818841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2121818841, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2121818841} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-2121818841|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2121818841, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2121818841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2121818841, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2121818841} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 14:01:32,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1151706998 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1151706998 256)))) (or (and (= ~z$r_buff0_thd3~0_In-1151706998 |P2Thread1of1ForFork2_#t~ite42_Out-1151706998|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-1151706998|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1151706998, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1151706998} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-1151706998|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1151706998, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1151706998} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 14:01:32,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1844581194 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1844581194 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1844581194 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1844581194 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite43_Out-1844581194| ~z$r_buff1_thd3~0_In-1844581194) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite43_Out-1844581194| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1844581194, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1844581194, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1844581194, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1844581194} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1844581194, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1844581194, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1844581194|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1844581194, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1844581194} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 14:01:32,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_167 |v_P2Thread1of1ForFork2_#t~ite43_40|)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_167, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_39|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 14:01:32,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-24371176 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-24371176 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-24371176 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-24371176 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-24371176| ~z$r_buff1_thd1~0_In-24371176) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-24371176| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-24371176, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-24371176, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-24371176, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-24371176} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-24371176, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-24371176|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-24371176, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-24371176, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-24371176} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:01:32,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L746-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_159 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_159, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} 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-18 14:01:32,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L822-1-->L828: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:01:32,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L828-2-->L828-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In597187649 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In597187649 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out597187649| |ULTIMATE.start_main_#t~ite47_Out597187649|))) (or (and (= ~z~0_In597187649 |ULTIMATE.start_main_#t~ite47_Out597187649|) (or .cse0 .cse1) .cse2) (and (= ~z$w_buff1~0_In597187649 |ULTIMATE.start_main_#t~ite47_Out597187649|) (not .cse0) (not .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In597187649, ~z$w_buff1_used~0=~z$w_buff1_used~0_In597187649, ~z$w_buff1~0=~z$w_buff1~0_In597187649, ~z~0=~z~0_In597187649} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In597187649, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out597187649|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In597187649, ~z$w_buff1~0=~z$w_buff1~0_In597187649, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out597187649|, ~z~0=~z~0_In597187649} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 14:01:32,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1790235750 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1790235750 256) 0))) (or (and (= ~z$w_buff0_used~0_In1790235750 |ULTIMATE.start_main_#t~ite49_Out1790235750|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out1790235750|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1790235750, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1790235750} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1790235750, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1790235750, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1790235750|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 14:01:32,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1693065378 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1693065378 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1693065378 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1693065378 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-1693065378| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-1693065378 |ULTIMATE.start_main_#t~ite50_Out-1693065378|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1693065378, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693065378, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1693065378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1693065378} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1693065378|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1693065378, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693065378, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1693065378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1693065378} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 14:01:32,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In852332795 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In852332795 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In852332795 |ULTIMATE.start_main_#t~ite51_Out852332795|)) (and (= 0 |ULTIMATE.start_main_#t~ite51_Out852332795|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In852332795, ~z$w_buff0_used~0=~z$w_buff0_used~0_In852332795} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In852332795, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out852332795|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In852332795} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 14:01:32,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In1502813682 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1502813682 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1502813682 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1502813682 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out1502813682| ~z$r_buff1_thd0~0_In1502813682)) (and (= |ULTIMATE.start_main_#t~ite52_Out1502813682| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1502813682, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1502813682, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1502813682, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1502813682} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1502813682|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1502813682, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1502813682, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1502813682, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1502813682} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 14:01:32,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= 2 v_~x~0_130) (= 0 v_~__unbuffered_p2_EAX~0_21) (= v_~z$r_buff1_thd0~0_167 |v_ULTIMATE.start_main_#t~ite52_35|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y~0_23 2)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_167, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_23, ~x~0=v_~x~0_130, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:01:32,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:01:32 BasicIcfg [2019-12-18 14:01:32,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:01:32,152 INFO L168 Benchmark]: Toolchain (without parser) took 116652.04 ms. Allocated memory was 144.2 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 99.4 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 816.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:01:32,153 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 14:01:32,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 731.85 ms. Allocated memory was 144.2 MB in the beginning and 200.3 MB in the end (delta: 56.1 MB). Free memory was 99.0 MB in the beginning and 153.7 MB in the end (delta: -54.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:01:32,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.07 ms. Allocated memory is still 200.3 MB. Free memory was 153.7 MB in the beginning and 150.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:01:32,154 INFO L168 Benchmark]: Boogie Preprocessor took 41.64 ms. Allocated memory is still 200.3 MB. Free memory was 150.9 MB in the beginning and 148.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:01:32,154 INFO L168 Benchmark]: RCFGBuilder took 860.60 ms. Allocated memory is still 200.3 MB. Free memory was 148.2 MB in the beginning and 98.5 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:01:32,155 INFO L168 Benchmark]: TraceAbstraction took 114943.56 ms. Allocated memory was 200.3 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 98.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 759.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:01:32,156 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.49 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 731.85 ms. Allocated memory was 144.2 MB in the beginning and 200.3 MB in the end (delta: 56.1 MB). Free memory was 99.0 MB in the beginning and 153.7 MB in the end (delta: -54.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.07 ms. Allocated memory is still 200.3 MB. Free memory was 153.7 MB in the beginning and 150.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.64 ms. Allocated memory is still 200.3 MB. Free memory was 150.9 MB in the beginning and 148.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 860.60 ms. Allocated memory is still 200.3 MB. Free memory was 148.2 MB in the beginning and 98.5 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 114943.56 ms. Allocated memory was 200.3 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 98.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 759.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 174 ProgramPointsBefore, 92 ProgramPointsAfterwards, 211 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 6843 VarBasedMoverChecksPositive, 273 VarBasedMoverChecksNegative, 91 SemBasedMoverChecksPositive, 240 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 77200 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1501, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L820] FCALL, FORK 0 pthread_create(&t1502, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L822] FCALL, FORK 0 pthread_create(&t1503, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L742] 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_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L776] 3 y = 2 [L779] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 3 z$flush_delayed = weak$$choice2 [L782] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L783] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L783] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L784] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L785] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L785] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L786] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L786] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L762] EXPR 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=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L742] 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) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 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 [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 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 [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L787] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L787] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L795] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L828] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L828] 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) [L829] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 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 [L831] 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 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 114.6s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 41.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9222 SDtfs, 11964 SDslu, 31075 SDs, 0 SdLazy, 19176 SolverSat, 492 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 523 GetRequests, 91 SyntacticMatches, 21 SemanticMatches, 411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2586 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138429occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 47.6s AutomataMinimizationTime, 35 MinimizatonAttempts, 505813 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1659 NumberOfCodeBlocks, 1659 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1557 ConstructedInterpolants, 0 QuantifiedInterpolants, 300814 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...