/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/mix002_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:05:54,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:05:54,287 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:05:54,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:05:54,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:05:54,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:05:54,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:05:54,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:05:54,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:05:54,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:05:54,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:05:54,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:05:54,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:05:54,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:05:54,333 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:05:54,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:05:54,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:05:54,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:05:54,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:05:54,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:05:54,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:05:54,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:05:54,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:05:54,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:05:54,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:05:54,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:05:54,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:05:54,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:05:54,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:05:54,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:05:54,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:05:54,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:05:54,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:05:54,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:05:54,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:05:54,364 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:05:54,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:05:54,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:05:54,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:05:54,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:05:54,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:05:54,368 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:05:54,399 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:05:54,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:05:54,400 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:05:54,401 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:05:54,401 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:05:54,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:05:54,401 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:05:54,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:05:54,402 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:05:54,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:05:54,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:05:54,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:05:54,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:05:54,403 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:05:54,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:05:54,403 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:05:54,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:05:54,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:05:54,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:05:54,404 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:05:54,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:05:54,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:05:54,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:05:54,404 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:05:54,405 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:05:54,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:05:54,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:05:54,405 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:05:54,405 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:05:54,405 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:05:54,674 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:05:54,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:05:54,696 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:05:54,697 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:05:54,698 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:05:54,699 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_rmo.oepc.i [2019-12-18 12:05:54,776 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5bdfc22/ee353881339d4551b877fc506e43bb11/FLAG92f5b410c [2019-12-18 12:05:55,338 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:05:55,339 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_rmo.oepc.i [2019-12-18 12:05:55,355 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5bdfc22/ee353881339d4551b877fc506e43bb11/FLAG92f5b410c [2019-12-18 12:05:55,592 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5bdfc22/ee353881339d4551b877fc506e43bb11 [2019-12-18 12:05:55,601 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:05:55,603 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:05:55,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:05:55,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:05:55,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:05:55,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:05:55" (1/1) ... [2019-12-18 12:05:55,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2109e484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:55, skipping insertion in model container [2019-12-18 12:05:55,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:05:55" (1/1) ... [2019-12-18 12:05:55,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:05:55,681 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:05:56,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:05:56,216 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:05:56,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:05:56,369 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:05:56,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:56 WrapperNode [2019-12-18 12:05:56,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:05:56,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:05:56,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:05:56,371 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:05:56,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:56" (1/1) ... [2019-12-18 12:05:56,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:56" (1/1) ... [2019-12-18 12:05:56,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:05:56,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:05:56,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:05:56,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:05:56,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:56" (1/1) ... [2019-12-18 12:05:56,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:56" (1/1) ... [2019-12-18 12:05:56,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:56" (1/1) ... [2019-12-18 12:05:56,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:56" (1/1) ... [2019-12-18 12:05:56,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:56" (1/1) ... [2019-12-18 12:05:56,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:56" (1/1) ... [2019-12-18 12:05:56,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:56" (1/1) ... [2019-12-18 12:05:56,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:05:56,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:05:56,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:05:56,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:05:56,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:05:56,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:05:56,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:05:56,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:05:56,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:05:56,549 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:05:56,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:05:56,549 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:05:56,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:05:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:05:56,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:05:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:05:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:05:56,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:05:56,552 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:05:57,301 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:05:57,301 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:05:57,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:05:57 BoogieIcfgContainer [2019-12-18 12:05:57,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:05:57,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:05:57,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:05:57,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:05:57,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:05:55" (1/3) ... [2019-12-18 12:05:57,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2771685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:05:57, skipping insertion in model container [2019-12-18 12:05:57,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:56" (2/3) ... [2019-12-18 12:05:57,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2771685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:05:57, skipping insertion in model container [2019-12-18 12:05:57,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:05:57" (3/3) ... [2019-12-18 12:05:57,311 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_rmo.oepc.i [2019-12-18 12:05:57,322 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:05:57,323 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:05:57,336 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:05:57,337 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:05:57,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,401 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,404 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,404 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,405 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,405 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,418 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,441 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,449 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,450 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,491 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,491 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,497 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,499 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,507 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,508 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,508 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:57,525 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:05:57,548 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:05:57,548 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:05:57,548 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:05:57,549 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:05:57,549 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:05:57,549 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:05:57,549 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:05:57,549 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:05:57,567 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-18 12:05:57,569 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-18 12:05:57,668 INFO L126 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-18 12:05:57,668 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:05:57,689 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:05:57,721 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-18 12:05:57,774 INFO L126 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-18 12:05:57,774 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:05:57,784 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:05:57,806 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:05:57,808 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:06:03,460 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 12:06:03,615 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 12:06:03,782 INFO L206 etLargeBlockEncoding]: Checked pairs total: 93316 [2019-12-18 12:06:03,782 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 12:06:03,786 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 104 transitions [2019-12-18 12:06:22,667 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-18 12:06:22,669 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-18 12:06:22,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:06:22,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:22,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:06:22,674 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 12:06:22,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:22,680 INFO L82 PathProgramCache]: Analyzing trace with hash 922900, now seen corresponding path program 1 times [2019-12-18 12:06:22,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:22,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608792514] [2019-12-18 12:06:22,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:22,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608792514] [2019-12-18 12:06:22,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:22,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:06:22,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999290185] [2019-12-18 12:06:22,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:06:22,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:22,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:06:22,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:22,924 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-18 12:06:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:26,426 INFO L93 Difference]: Finished difference Result 119349 states and 508327 transitions. [2019-12-18 12:06:26,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:06:26,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:06:26,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:27,122 INFO L225 Difference]: With dead ends: 119349 [2019-12-18 12:06:27,123 INFO L226 Difference]: Without dead ends: 112420 [2019-12-18 12:06:27,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:32,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112420 states. [2019-12-18 12:06:37,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112420 to 112420. [2019-12-18 12:06:37,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112420 states. [2019-12-18 12:06:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112420 states to 112420 states and 478219 transitions. [2019-12-18 12:06:38,005 INFO L78 Accepts]: Start accepts. Automaton has 112420 states and 478219 transitions. Word has length 3 [2019-12-18 12:06:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:38,005 INFO L462 AbstractCegarLoop]: Abstraction has 112420 states and 478219 transitions. [2019-12-18 12:06:38,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:06:38,005 INFO L276 IsEmpty]: Start isEmpty. Operand 112420 states and 478219 transitions. [2019-12-18 12:06:38,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:06:38,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:38,011 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:06:38,011 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 12:06:38,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:38,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1739393843, now seen corresponding path program 1 times [2019-12-18 12:06:38,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:38,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454198242] [2019-12-18 12:06:38,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:38,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454198242] [2019-12-18 12:06:38,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:38,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:06:38,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884040957] [2019-12-18 12:06:38,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:06:38,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:38,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:06:38,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:06:38,161 INFO L87 Difference]: Start difference. First operand 112420 states and 478219 transitions. Second operand 4 states. [2019-12-18 12:06:44,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:44,295 INFO L93 Difference]: Finished difference Result 179210 states and 732067 transitions. [2019-12-18 12:06:44,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:06:44,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:06:44,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:45,055 INFO L225 Difference]: With dead ends: 179210 [2019-12-18 12:06:45,056 INFO L226 Difference]: Without dead ends: 179161 [2019-12-18 12:06:45,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:06:50,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179161 states. [2019-12-18 12:06:54,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179161 to 162301. [2019-12-18 12:06:54,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162301 states. [2019-12-18 12:06:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162301 states to 162301 states and 672031 transitions. [2019-12-18 12:06:54,527 INFO L78 Accepts]: Start accepts. Automaton has 162301 states and 672031 transitions. Word has length 11 [2019-12-18 12:06:54,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:54,528 INFO L462 AbstractCegarLoop]: Abstraction has 162301 states and 672031 transitions. [2019-12-18 12:06:54,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:06:54,528 INFO L276 IsEmpty]: Start isEmpty. Operand 162301 states and 672031 transitions. [2019-12-18 12:06:54,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:06:54,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:54,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:06:54,536 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 12:06:54,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:54,536 INFO L82 PathProgramCache]: Analyzing trace with hash 53844596, now seen corresponding path program 1 times [2019-12-18 12:06:54,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:54,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345851158] [2019-12-18 12:06:54,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:54,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345851158] [2019-12-18 12:06:54,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:54,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:06:54,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233997314] [2019-12-18 12:06:54,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:06:54,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:54,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:06:54,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:54,595 INFO L87 Difference]: Start difference. First operand 162301 states and 672031 transitions. Second operand 3 states. [2019-12-18 12:06:59,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:59,421 INFO L93 Difference]: Finished difference Result 34811 states and 113031 transitions. [2019-12-18 12:06:59,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:06:59,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:06:59,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:59,525 INFO L225 Difference]: With dead ends: 34811 [2019-12-18 12:06:59,526 INFO L226 Difference]: Without dead ends: 34811 [2019-12-18 12:06:59,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34811 states. [2019-12-18 12:07:00,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34811 to 34811. [2019-12-18 12:07:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34811 states. [2019-12-18 12:07:00,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34811 states to 34811 states and 113031 transitions. [2019-12-18 12:07:00,192 INFO L78 Accepts]: Start accepts. Automaton has 34811 states and 113031 transitions. Word has length 13 [2019-12-18 12:07:00,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:00,192 INFO L462 AbstractCegarLoop]: Abstraction has 34811 states and 113031 transitions. [2019-12-18 12:07:00,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:07:00,192 INFO L276 IsEmpty]: Start isEmpty. Operand 34811 states and 113031 transitions. [2019-12-18 12:07:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:07:00,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:00,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:07:00,195 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 12:07:00,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:00,196 INFO L82 PathProgramCache]: Analyzing trace with hash -2104175705, now seen corresponding path program 1 times [2019-12-18 12:07:00,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:00,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703497827] [2019-12-18 12:07:00,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:00,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:00,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703497827] [2019-12-18 12:07:00,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:00,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:07:00,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781298507] [2019-12-18 12:07:00,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:07:00,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:00,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:07:00,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:07:00,307 INFO L87 Difference]: Start difference. First operand 34811 states and 113031 transitions. Second operand 5 states. [2019-12-18 12:07:00,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:00,955 INFO L93 Difference]: Finished difference Result 48236 states and 154913 transitions. [2019-12-18 12:07:00,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:07:00,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 12:07:00,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:01,062 INFO L225 Difference]: With dead ends: 48236 [2019-12-18 12:07:01,063 INFO L226 Difference]: Without dead ends: 48236 [2019-12-18 12:07:01,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:07:01,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-12-18 12:07:02,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 41215. [2019-12-18 12:07:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41215 states. [2019-12-18 12:07:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41215 states to 41215 states and 133442 transitions. [2019-12-18 12:07:02,224 INFO L78 Accepts]: Start accepts. Automaton has 41215 states and 133442 transitions. Word has length 16 [2019-12-18 12:07:02,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:02,225 INFO L462 AbstractCegarLoop]: Abstraction has 41215 states and 133442 transitions. [2019-12-18 12:07:02,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:07:02,225 INFO L276 IsEmpty]: Start isEmpty. Operand 41215 states and 133442 transitions. [2019-12-18 12:07:02,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:07:02,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:02,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:07:02,236 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 12:07:02,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:02,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1566659883, now seen corresponding path program 1 times [2019-12-18 12:07:02,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:02,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010996239] [2019-12-18 12:07:02,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:02,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010996239] [2019-12-18 12:07:02,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:02,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:07:02,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299637549] [2019-12-18 12:07:02,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:07:02,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:02,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:07:02,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:07:02,364 INFO L87 Difference]: Start difference. First operand 41215 states and 133442 transitions. Second operand 6 states. [2019-12-18 12:07:03,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:03,250 INFO L93 Difference]: Finished difference Result 62182 states and 196414 transitions. [2019-12-18 12:07:03,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:07:03,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 12:07:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:03,383 INFO L225 Difference]: With dead ends: 62182 [2019-12-18 12:07:03,383 INFO L226 Difference]: Without dead ends: 62175 [2019-12-18 12:07:03,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:07:03,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62175 states. [2019-12-18 12:07:04,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62175 to 40995. [2019-12-18 12:07:04,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40995 states. [2019-12-18 12:07:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40995 states to 40995 states and 132031 transitions. [2019-12-18 12:07:04,458 INFO L78 Accepts]: Start accepts. Automaton has 40995 states and 132031 transitions. Word has length 22 [2019-12-18 12:07:04,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:04,458 INFO L462 AbstractCegarLoop]: Abstraction has 40995 states and 132031 transitions. [2019-12-18 12:07:04,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:07:04,458 INFO L276 IsEmpty]: Start isEmpty. Operand 40995 states and 132031 transitions. [2019-12-18 12:07:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:07:04,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:04,473 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:07:04,473 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 12:07:04,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:04,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1076429505, now seen corresponding path program 1 times [2019-12-18 12:07:04,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:04,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065075179] [2019-12-18 12:07:04,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:04,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065075179] [2019-12-18 12:07:04,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:04,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:07:04,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302080043] [2019-12-18 12:07:04,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:07:04,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:04,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:07:04,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:07:04,544 INFO L87 Difference]: Start difference. First operand 40995 states and 132031 transitions. Second operand 4 states. [2019-12-18 12:07:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:04,613 INFO L93 Difference]: Finished difference Result 16196 states and 49196 transitions. [2019-12-18 12:07:04,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:07:04,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:07:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:04,634 INFO L225 Difference]: With dead ends: 16196 [2019-12-18 12:07:04,635 INFO L226 Difference]: Without dead ends: 16196 [2019-12-18 12:07:04,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:07:04,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16196 states. [2019-12-18 12:07:05,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16196 to 15833. [2019-12-18 12:07:05,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15833 states. [2019-12-18 12:07:05,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15833 states to 15833 states and 48160 transitions. [2019-12-18 12:07:05,214 INFO L78 Accepts]: Start accepts. Automaton has 15833 states and 48160 transitions. Word has length 25 [2019-12-18 12:07:05,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:05,214 INFO L462 AbstractCegarLoop]: Abstraction has 15833 states and 48160 transitions. [2019-12-18 12:07:05,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:07:05,214 INFO L276 IsEmpty]: Start isEmpty. Operand 15833 states and 48160 transitions. [2019-12-18 12:07:05,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:07:05,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:05,227 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 12:07:05,227 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 12:07:05,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:05,228 INFO L82 PathProgramCache]: Analyzing trace with hash -877586735, now seen corresponding path program 1 times [2019-12-18 12:07:05,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:05,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120595420] [2019-12-18 12:07:05,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:05,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:05,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120595420] [2019-12-18 12:07:05,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:05,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:07:05,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671491251] [2019-12-18 12:07:05,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:07:05,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:05,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:07:05,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:05,279 INFO L87 Difference]: Start difference. First operand 15833 states and 48160 transitions. Second operand 3 states. [2019-12-18 12:07:05,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:05,406 INFO L93 Difference]: Finished difference Result 23073 states and 68792 transitions. [2019-12-18 12:07:05,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:07:05,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:07:05,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:05,451 INFO L225 Difference]: With dead ends: 23073 [2019-12-18 12:07:05,451 INFO L226 Difference]: Without dead ends: 23073 [2019-12-18 12:07:05,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:05,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23073 states. [2019-12-18 12:07:05,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23073 to 17600. [2019-12-18 12:07:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17600 states. [2019-12-18 12:07:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17600 states to 17600 states and 53010 transitions. [2019-12-18 12:07:05,787 INFO L78 Accepts]: Start accepts. Automaton has 17600 states and 53010 transitions. Word has length 27 [2019-12-18 12:07:05,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:05,787 INFO L462 AbstractCegarLoop]: Abstraction has 17600 states and 53010 transitions. [2019-12-18 12:07:05,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:07:05,788 INFO L276 IsEmpty]: Start isEmpty. Operand 17600 states and 53010 transitions. [2019-12-18 12:07:05,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:07:05,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:05,801 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 12:07:05,801 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 12:07:05,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:05,801 INFO L82 PathProgramCache]: Analyzing trace with hash -603523497, now seen corresponding path program 1 times [2019-12-18 12:07:05,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:05,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954018151] [2019-12-18 12:07:05,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:05,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954018151] [2019-12-18 12:07:05,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:05,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:07:05,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278806677] [2019-12-18 12:07:05,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:07:05,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:05,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:07:05,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:07:05,882 INFO L87 Difference]: Start difference. First operand 17600 states and 53010 transitions. Second operand 6 states. [2019-12-18 12:07:06,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:06,416 INFO L93 Difference]: Finished difference Result 24767 states and 72789 transitions. [2019-12-18 12:07:06,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:07:06,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:07:06,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:06,449 INFO L225 Difference]: With dead ends: 24767 [2019-12-18 12:07:06,449 INFO L226 Difference]: Without dead ends: 24767 [2019-12-18 12:07:06,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:07:06,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24767 states. [2019-12-18 12:07:06,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24767 to 20286. [2019-12-18 12:07:06,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20286 states. [2019-12-18 12:07:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20286 states to 20286 states and 60759 transitions. [2019-12-18 12:07:06,768 INFO L78 Accepts]: Start accepts. Automaton has 20286 states and 60759 transitions. Word has length 27 [2019-12-18 12:07:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:06,769 INFO L462 AbstractCegarLoop]: Abstraction has 20286 states and 60759 transitions. [2019-12-18 12:07:06,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:07:06,769 INFO L276 IsEmpty]: Start isEmpty. Operand 20286 states and 60759 transitions. [2019-12-18 12:07:06,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:07:06,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:06,789 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 12:07:06,790 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 12:07:06,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:06,790 INFO L82 PathProgramCache]: Analyzing trace with hash 94968403, now seen corresponding path program 1 times [2019-12-18 12:07:06,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:06,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69060971] [2019-12-18 12:07:06,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:06,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:06,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69060971] [2019-12-18 12:07:06,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:06,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:07:06,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088579504] [2019-12-18 12:07:06,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:07:06,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:06,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:07:06,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:07:06,885 INFO L87 Difference]: Start difference. First operand 20286 states and 60759 transitions. Second operand 7 states. [2019-12-18 12:07:08,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:08,075 INFO L93 Difference]: Finished difference Result 27601 states and 80773 transitions. [2019-12-18 12:07:08,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:07:08,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 12:07:08,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:08,112 INFO L225 Difference]: With dead ends: 27601 [2019-12-18 12:07:08,112 INFO L226 Difference]: Without dead ends: 27601 [2019-12-18 12:07:08,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:07:08,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27601 states. [2019-12-18 12:07:08,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27601 to 18412. [2019-12-18 12:07:08,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18412 states. [2019-12-18 12:07:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18412 states to 18412 states and 55362 transitions. [2019-12-18 12:07:08,609 INFO L78 Accepts]: Start accepts. Automaton has 18412 states and 55362 transitions. Word has length 33 [2019-12-18 12:07:08,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:08,610 INFO L462 AbstractCegarLoop]: Abstraction has 18412 states and 55362 transitions. [2019-12-18 12:07:08,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:07:08,610 INFO L276 IsEmpty]: Start isEmpty. Operand 18412 states and 55362 transitions. [2019-12-18 12:07:08,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:07:08,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:08,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:07:08,633 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 12:07:08,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:08,634 INFO L82 PathProgramCache]: Analyzing trace with hash 994852703, now seen corresponding path program 1 times [2019-12-18 12:07:08,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:08,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038444791] [2019-12-18 12:07:08,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:08,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038444791] [2019-12-18 12:07:08,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:08,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:07:08,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577088647] [2019-12-18 12:07:08,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:07:08,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:08,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:07:08,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:08,719 INFO L87 Difference]: Start difference. First operand 18412 states and 55362 transitions. Second operand 3 states. [2019-12-18 12:07:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:08,811 INFO L93 Difference]: Finished difference Result 18411 states and 55360 transitions. [2019-12-18 12:07:08,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:07:08,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:07:08,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:08,854 INFO L225 Difference]: With dead ends: 18411 [2019-12-18 12:07:08,854 INFO L226 Difference]: Without dead ends: 18411 [2019-12-18 12:07:08,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2019-12-18 12:07:09,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 18411. [2019-12-18 12:07:09,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18411 states. [2019-12-18 12:07:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18411 states to 18411 states and 55360 transitions. [2019-12-18 12:07:09,278 INFO L78 Accepts]: Start accepts. Automaton has 18411 states and 55360 transitions. Word has length 39 [2019-12-18 12:07:09,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:09,279 INFO L462 AbstractCegarLoop]: Abstraction has 18411 states and 55360 transitions. [2019-12-18 12:07:09,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:07:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand 18411 states and 55360 transitions. [2019-12-18 12:07:09,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:07:09,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:09,309 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 12:07:09,309 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 12:07:09,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:09,310 INFO L82 PathProgramCache]: Analyzing trace with hash 467911076, now seen corresponding path program 1 times [2019-12-18 12:07:09,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:09,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907008075] [2019-12-18 12:07:09,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:09,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:09,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907008075] [2019-12-18 12:07:09,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:09,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:07:09,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11721938] [2019-12-18 12:07:09,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:07:09,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:09,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:07:09,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:09,406 INFO L87 Difference]: Start difference. First operand 18411 states and 55360 transitions. Second operand 3 states. [2019-12-18 12:07:09,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:09,494 INFO L93 Difference]: Finished difference Result 18325 states and 55099 transitions. [2019-12-18 12:07:09,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:07:09,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 12:07:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:09,525 INFO L225 Difference]: With dead ends: 18325 [2019-12-18 12:07:09,525 INFO L226 Difference]: Without dead ends: 18325 [2019-12-18 12:07:09,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:09,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18325 states. [2019-12-18 12:07:09,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18325 to 16323. [2019-12-18 12:07:09,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16323 states. [2019-12-18 12:07:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16323 states to 16323 states and 49617 transitions. [2019-12-18 12:07:09,788 INFO L78 Accepts]: Start accepts. Automaton has 16323 states and 49617 transitions. Word has length 40 [2019-12-18 12:07:09,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:09,789 INFO L462 AbstractCegarLoop]: Abstraction has 16323 states and 49617 transitions. [2019-12-18 12:07:09,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:07:09,789 INFO L276 IsEmpty]: Start isEmpty. Operand 16323 states and 49617 transitions. [2019-12-18 12:07:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 12:07:09,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:09,805 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] [2019-12-18 12:07:09,805 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 12:07:09,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:09,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1873584483, now seen corresponding path program 1 times [2019-12-18 12:07:09,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:09,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641509786] [2019-12-18 12:07:09,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:09,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:09,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641509786] [2019-12-18 12:07:09,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:09,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:07:09,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085788587] [2019-12-18 12:07:09,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:07:09,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:09,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:07:09,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:07:09,871 INFO L87 Difference]: Start difference. First operand 16323 states and 49617 transitions. Second operand 5 states. [2019-12-18 12:07:09,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:09,945 INFO L93 Difference]: Finished difference Result 15143 states and 47024 transitions. [2019-12-18 12:07:09,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:07:09,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 12:07:09,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:09,973 INFO L225 Difference]: With dead ends: 15143 [2019-12-18 12:07:09,973 INFO L226 Difference]: Without dead ends: 15143 [2019-12-18 12:07:09,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:07:10,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15143 states. [2019-12-18 12:07:10,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15143 to 15143. [2019-12-18 12:07:10,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15143 states. [2019-12-18 12:07:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15143 states to 15143 states and 47024 transitions. [2019-12-18 12:07:10,211 INFO L78 Accepts]: Start accepts. Automaton has 15143 states and 47024 transitions. Word has length 41 [2019-12-18 12:07:10,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:10,211 INFO L462 AbstractCegarLoop]: Abstraction has 15143 states and 47024 transitions. [2019-12-18 12:07:10,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:07:10,211 INFO L276 IsEmpty]: Start isEmpty. Operand 15143 states and 47024 transitions. [2019-12-18 12:07:10,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:07:10,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:10,227 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 12:07:10,227 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 12:07:10,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:10,228 INFO L82 PathProgramCache]: Analyzing trace with hash 628999064, now seen corresponding path program 1 times [2019-12-18 12:07:10,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:10,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299658653] [2019-12-18 12:07:10,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:10,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299658653] [2019-12-18 12:07:10,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:10,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:07:10,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488545870] [2019-12-18 12:07:10,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:07:10,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:10,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:07:10,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:10,282 INFO L87 Difference]: Start difference. First operand 15143 states and 47024 transitions. Second operand 3 states. [2019-12-18 12:07:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:10,367 INFO L93 Difference]: Finished difference Result 19655 states and 59985 transitions. [2019-12-18 12:07:10,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:07:10,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:07:10,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:10,392 INFO L225 Difference]: With dead ends: 19655 [2019-12-18 12:07:10,393 INFO L226 Difference]: Without dead ends: 19655 [2019-12-18 12:07:10,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:10,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19655 states. [2019-12-18 12:07:10,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19655 to 14961. [2019-12-18 12:07:10,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14961 states. [2019-12-18 12:07:10,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14961 states to 14961 states and 45870 transitions. [2019-12-18 12:07:10,666 INFO L78 Accepts]: Start accepts. Automaton has 14961 states and 45870 transitions. Word has length 65 [2019-12-18 12:07:10,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:10,666 INFO L462 AbstractCegarLoop]: Abstraction has 14961 states and 45870 transitions. [2019-12-18 12:07:10,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:07:10,667 INFO L276 IsEmpty]: Start isEmpty. Operand 14961 states and 45870 transitions. [2019-12-18 12:07:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:07:10,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:10,689 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 12:07:10,690 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 12:07:10,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:10,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1958678932, now seen corresponding path program 1 times [2019-12-18 12:07:10,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:10,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990011511] [2019-12-18 12:07:10,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:10,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990011511] [2019-12-18 12:07:10,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:10,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:07:10,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602062375] [2019-12-18 12:07:10,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:07:10,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:10,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:07:10,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:07:10,784 INFO L87 Difference]: Start difference. First operand 14961 states and 45870 transitions. Second operand 7 states. [2019-12-18 12:07:11,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:11,340 INFO L93 Difference]: Finished difference Result 43069 states and 131367 transitions. [2019-12-18 12:07:11,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:07:11,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:07:11,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:11,385 INFO L225 Difference]: With dead ends: 43069 [2019-12-18 12:07:11,385 INFO L226 Difference]: Without dead ends: 33469 [2019-12-18 12:07:11,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:07:11,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33469 states. [2019-12-18 12:07:11,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33469 to 18596. [2019-12-18 12:07:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18596 states. [2019-12-18 12:07:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18596 states to 18596 states and 57138 transitions. [2019-12-18 12:07:11,765 INFO L78 Accepts]: Start accepts. Automaton has 18596 states and 57138 transitions. Word has length 65 [2019-12-18 12:07:11,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:11,765 INFO L462 AbstractCegarLoop]: Abstraction has 18596 states and 57138 transitions. [2019-12-18 12:07:11,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:07:11,765 INFO L276 IsEmpty]: Start isEmpty. Operand 18596 states and 57138 transitions. [2019-12-18 12:07:11,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:07:11,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:11,788 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 12:07:11,788 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 12:07:11,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:11,789 INFO L82 PathProgramCache]: Analyzing trace with hash -29541862, now seen corresponding path program 2 times [2019-12-18 12:07:11,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:11,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509302330] [2019-12-18 12:07:11,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:11,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509302330] [2019-12-18 12:07:11,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:11,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:07:11,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066520422] [2019-12-18 12:07:11,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:07:11,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:11,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:07:11,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:07:11,869 INFO L87 Difference]: Start difference. First operand 18596 states and 57138 transitions. Second operand 7 states. [2019-12-18 12:07:12,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:12,284 INFO L93 Difference]: Finished difference Result 48601 states and 146797 transitions. [2019-12-18 12:07:12,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:07:12,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:07:12,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:12,353 INFO L225 Difference]: With dead ends: 48601 [2019-12-18 12:07:12,353 INFO L226 Difference]: Without dead ends: 35759 [2019-12-18 12:07:12,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:07:12,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35759 states. [2019-12-18 12:07:12,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35759 to 21981. [2019-12-18 12:07:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21981 states. [2019-12-18 12:07:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21981 states to 21981 states and 67224 transitions. [2019-12-18 12:07:12,789 INFO L78 Accepts]: Start accepts. Automaton has 21981 states and 67224 transitions. Word has length 65 [2019-12-18 12:07:12,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:12,789 INFO L462 AbstractCegarLoop]: Abstraction has 21981 states and 67224 transitions. [2019-12-18 12:07:12,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:07:12,789 INFO L276 IsEmpty]: Start isEmpty. Operand 21981 states and 67224 transitions. [2019-12-18 12:07:12,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:07:12,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:12,812 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 12:07:12,812 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 12:07:12,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:12,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1604322860, now seen corresponding path program 3 times [2019-12-18 12:07:12,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:12,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291883057] [2019-12-18 12:07:12,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:12,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291883057] [2019-12-18 12:07:12,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:12,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:07:12,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515399703] [2019-12-18 12:07:12,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:07:12,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:12,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:07:12,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:07:12,935 INFO L87 Difference]: Start difference. First operand 21981 states and 67224 transitions. Second operand 9 states. [2019-12-18 12:07:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:14,280 INFO L93 Difference]: Finished difference Result 65932 states and 199427 transitions. [2019-12-18 12:07:14,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:07:14,280 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:07:14,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:14,385 INFO L225 Difference]: With dead ends: 65932 [2019-12-18 12:07:14,386 INFO L226 Difference]: Without dead ends: 63310 [2019-12-18 12:07:14,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:07:14,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63310 states. [2019-12-18 12:07:15,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63310 to 22137. [2019-12-18 12:07:15,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22137 states. [2019-12-18 12:07:15,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22137 states to 22137 states and 67886 transitions. [2019-12-18 12:07:15,271 INFO L78 Accepts]: Start accepts. Automaton has 22137 states and 67886 transitions. Word has length 65 [2019-12-18 12:07:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:15,271 INFO L462 AbstractCegarLoop]: Abstraction has 22137 states and 67886 transitions. [2019-12-18 12:07:15,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:07:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 22137 states and 67886 transitions. [2019-12-18 12:07:15,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:07:15,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:15,293 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 12:07:15,293 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 12:07:15,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:15,294 INFO L82 PathProgramCache]: Analyzing trace with hash -2017880016, now seen corresponding path program 4 times [2019-12-18 12:07:15,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:15,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344887540] [2019-12-18 12:07:15,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:15,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:15,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344887540] [2019-12-18 12:07:15,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:15,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:07:15,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383104330] [2019-12-18 12:07:15,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:07:15,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:15,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:07:15,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:07:15,407 INFO L87 Difference]: Start difference. First operand 22137 states and 67886 transitions. Second operand 9 states. [2019-12-18 12:07:16,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:16,671 INFO L93 Difference]: Finished difference Result 78329 states and 236465 transitions. [2019-12-18 12:07:16,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:07:16,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:07:16,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:16,776 INFO L225 Difference]: With dead ends: 78329 [2019-12-18 12:07:16,776 INFO L226 Difference]: Without dead ends: 75771 [2019-12-18 12:07:16,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:07:16,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75771 states. [2019-12-18 12:07:17,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75771 to 22174. [2019-12-18 12:07:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22174 states. [2019-12-18 12:07:17,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22174 states to 22174 states and 68084 transitions. [2019-12-18 12:07:17,496 INFO L78 Accepts]: Start accepts. Automaton has 22174 states and 68084 transitions. Word has length 65 [2019-12-18 12:07:17,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:17,496 INFO L462 AbstractCegarLoop]: Abstraction has 22174 states and 68084 transitions. [2019-12-18 12:07:17,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:07:17,496 INFO L276 IsEmpty]: Start isEmpty. Operand 22174 states and 68084 transitions. [2019-12-18 12:07:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:07:17,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:17,517 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 12:07:17,518 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 12:07:17,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:17,518 INFO L82 PathProgramCache]: Analyzing trace with hash -841108452, now seen corresponding path program 5 times [2019-12-18 12:07:17,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:17,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780807519] [2019-12-18 12:07:17,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:17,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780807519] [2019-12-18 12:07:17,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:17,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:07:17,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378282123] [2019-12-18 12:07:17,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:07:17,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:17,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:07:17,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:17,587 INFO L87 Difference]: Start difference. First operand 22174 states and 68084 transitions. Second operand 3 states. [2019-12-18 12:07:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:17,711 INFO L93 Difference]: Finished difference Result 25241 states and 77567 transitions. [2019-12-18 12:07:17,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:07:17,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:07:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:17,745 INFO L225 Difference]: With dead ends: 25241 [2019-12-18 12:07:17,745 INFO L226 Difference]: Without dead ends: 25241 [2019-12-18 12:07:17,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:17,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25241 states. [2019-12-18 12:07:18,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25241 to 21050. [2019-12-18 12:07:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21050 states. [2019-12-18 12:07:18,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21050 states to 21050 states and 65371 transitions. [2019-12-18 12:07:18,256 INFO L78 Accepts]: Start accepts. Automaton has 21050 states and 65371 transitions. Word has length 65 [2019-12-18 12:07:18,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:18,256 INFO L462 AbstractCegarLoop]: Abstraction has 21050 states and 65371 transitions. [2019-12-18 12:07:18,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:07:18,256 INFO L276 IsEmpty]: Start isEmpty. Operand 21050 states and 65371 transitions. [2019-12-18 12:07:18,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:07:18,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:18,276 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 12:07:18,276 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 12:07:18,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:18,276 INFO L82 PathProgramCache]: Analyzing trace with hash -23971085, now seen corresponding path program 1 times [2019-12-18 12:07:18,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:18,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488338704] [2019-12-18 12:07:18,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:18,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 12:07:18,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488338704] [2019-12-18 12:07:18,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:18,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:07:18,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549571142] [2019-12-18 12:07:18,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:07:18,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:18,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:07:18,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:07:18,386 INFO L87 Difference]: Start difference. First operand 21050 states and 65371 transitions. Second operand 8 states. [2019-12-18 12:07:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:19,342 INFO L93 Difference]: Finished difference Result 52001 states and 158465 transitions. [2019-12-18 12:07:19,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:07:19,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 12:07:19,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:19,411 INFO L225 Difference]: With dead ends: 52001 [2019-12-18 12:07:19,411 INFO L226 Difference]: Without dead ends: 48845 [2019-12-18 12:07:19,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:07:19,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48845 states. [2019-12-18 12:07:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48845 to 21134. [2019-12-18 12:07:19,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21134 states. [2019-12-18 12:07:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21134 states to 21134 states and 65711 transitions. [2019-12-18 12:07:19,939 INFO L78 Accepts]: Start accepts. Automaton has 21134 states and 65711 transitions. Word has length 66 [2019-12-18 12:07:19,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:19,939 INFO L462 AbstractCegarLoop]: Abstraction has 21134 states and 65711 transitions. [2019-12-18 12:07:19,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:07:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 21134 states and 65711 transitions. [2019-12-18 12:07:19,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:07:19,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:19,963 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 12:07:19,963 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 12:07:19,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:19,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1713623309, now seen corresponding path program 2 times [2019-12-18 12:07:19,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:19,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239992854] [2019-12-18 12:07:19,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:20,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239992854] [2019-12-18 12:07:20,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:20,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:07:20,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775524436] [2019-12-18 12:07:20,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:07:20,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:20,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:07:20,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:07:20,082 INFO L87 Difference]: Start difference. First operand 21134 states and 65711 transitions. Second operand 9 states. [2019-12-18 12:07:21,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:21,375 INFO L93 Difference]: Finished difference Result 59225 states and 178920 transitions. [2019-12-18 12:07:21,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:07:21,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:07:21,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:21,500 INFO L225 Difference]: With dead ends: 59225 [2019-12-18 12:07:21,500 INFO L226 Difference]: Without dead ends: 56069 [2019-12-18 12:07:21,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:07:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56069 states. [2019-12-18 12:07:22,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56069 to 21156. [2019-12-18 12:07:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21156 states. [2019-12-18 12:07:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21156 states to 21156 states and 65782 transitions. [2019-12-18 12:07:22,416 INFO L78 Accepts]: Start accepts. Automaton has 21156 states and 65782 transitions. Word has length 66 [2019-12-18 12:07:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:22,417 INFO L462 AbstractCegarLoop]: Abstraction has 21156 states and 65782 transitions. [2019-12-18 12:07:22,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:07:22,417 INFO L276 IsEmpty]: Start isEmpty. Operand 21156 states and 65782 transitions. [2019-12-18 12:07:22,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:07:22,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:22,437 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 12:07:22,437 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 12:07:22,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:22,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1583227917, now seen corresponding path program 3 times [2019-12-18 12:07:22,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:22,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428061023] [2019-12-18 12:07:22,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:22,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428061023] [2019-12-18 12:07:22,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:22,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:07:22,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47455067] [2019-12-18 12:07:22,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:07:22,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:22,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:07:22,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:07:22,554 INFO L87 Difference]: Start difference. First operand 21156 states and 65782 transitions. Second operand 9 states. [2019-12-18 12:07:23,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:23,827 INFO L93 Difference]: Finished difference Result 65701 states and 198070 transitions. [2019-12-18 12:07:23,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:07:23,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:07:23,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:23,911 INFO L225 Difference]: With dead ends: 65701 [2019-12-18 12:07:23,911 INFO L226 Difference]: Without dead ends: 62568 [2019-12-18 12:07:23,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:07:24,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62568 states. [2019-12-18 12:07:24,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62568 to 21037. [2019-12-18 12:07:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21037 states. [2019-12-18 12:07:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21037 states to 21037 states and 65199 transitions. [2019-12-18 12:07:24,511 INFO L78 Accepts]: Start accepts. Automaton has 21037 states and 65199 transitions. Word has length 66 [2019-12-18 12:07:24,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:24,511 INFO L462 AbstractCegarLoop]: Abstraction has 21037 states and 65199 transitions. [2019-12-18 12:07:24,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:07:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 21037 states and 65199 transitions. [2019-12-18 12:07:24,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:07:24,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:24,536 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 12:07:24,536 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 12:07:24,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:24,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1805047887, now seen corresponding path program 4 times [2019-12-18 12:07:24,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:24,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883607869] [2019-12-18 12:07:24,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:24,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883607869] [2019-12-18 12:07:24,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:24,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:07:24,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913397725] [2019-12-18 12:07:24,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:07:24,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:24,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:07:24,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:07:24,651 INFO L87 Difference]: Start difference. First operand 21037 states and 65199 transitions. Second operand 7 states. [2019-12-18 12:07:25,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:25,621 INFO L93 Difference]: Finished difference Result 33222 states and 101569 transitions. [2019-12-18 12:07:25,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 12:07:25,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 12:07:25,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:25,692 INFO L225 Difference]: With dead ends: 33222 [2019-12-18 12:07:25,692 INFO L226 Difference]: Without dead ends: 33222 [2019-12-18 12:07:25,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:07:25,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33222 states. [2019-12-18 12:07:26,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33222 to 20376. [2019-12-18 12:07:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20376 states. [2019-12-18 12:07:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20376 states to 20376 states and 62283 transitions. [2019-12-18 12:07:26,228 INFO L78 Accepts]: Start accepts. Automaton has 20376 states and 62283 transitions. Word has length 66 [2019-12-18 12:07:26,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:26,228 INFO L462 AbstractCegarLoop]: Abstraction has 20376 states and 62283 transitions. [2019-12-18 12:07:26,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:07:26,228 INFO L276 IsEmpty]: Start isEmpty. Operand 20376 states and 62283 transitions. [2019-12-18 12:07:26,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:07:26,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:26,251 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 12:07:26,251 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 12:07:26,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:26,252 INFO L82 PathProgramCache]: Analyzing trace with hash -707932787, now seen corresponding path program 1 times [2019-12-18 12:07:26,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:26,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613655400] [2019-12-18 12:07:26,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:26,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613655400] [2019-12-18 12:07:26,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:26,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:07:26,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902841539] [2019-12-18 12:07:26,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:07:26,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:26,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:07:26,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:07:26,323 INFO L87 Difference]: Start difference. First operand 20376 states and 62283 transitions. Second operand 4 states. [2019-12-18 12:07:26,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:26,476 INFO L93 Difference]: Finished difference Result 20191 states and 61547 transitions. [2019-12-18 12:07:26,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:07:26,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 12:07:26,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:26,515 INFO L225 Difference]: With dead ends: 20191 [2019-12-18 12:07:26,515 INFO L226 Difference]: Without dead ends: 20191 [2019-12-18 12:07:26,516 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 12:07:26,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20191 states. [2019-12-18 12:07:26,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20191 to 18496. [2019-12-18 12:07:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18496 states. [2019-12-18 12:07:26,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18496 states to 18496 states and 56455 transitions. [2019-12-18 12:07:26,984 INFO L78 Accepts]: Start accepts. Automaton has 18496 states and 56455 transitions. Word has length 66 [2019-12-18 12:07:26,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:26,984 INFO L462 AbstractCegarLoop]: Abstraction has 18496 states and 56455 transitions. [2019-12-18 12:07:26,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:07:26,984 INFO L276 IsEmpty]: Start isEmpty. Operand 18496 states and 56455 transitions. [2019-12-18 12:07:27,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:07:27,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:27,003 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 12:07:27,003 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 12:07:27,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:27,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1506873112, now seen corresponding path program 1 times [2019-12-18 12:07:27,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:27,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441508817] [2019-12-18 12:07:27,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:27,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 12:07:27,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441508817] [2019-12-18 12:07:27,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:27,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:07:27,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289734907] [2019-12-18 12:07:27,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:07:27,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:27,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:07:27,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:27,098 INFO L87 Difference]: Start difference. First operand 18496 states and 56455 transitions. Second operand 3 states. [2019-12-18 12:07:27,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:27,166 INFO L93 Difference]: Finished difference Result 16117 states and 48226 transitions. [2019-12-18 12:07:27,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:07:27,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:07:27,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:27,194 INFO L225 Difference]: With dead ends: 16117 [2019-12-18 12:07:27,194 INFO L226 Difference]: Without dead ends: 16117 [2019-12-18 12:07:27,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:27,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16117 states. [2019-12-18 12:07:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16117 to 14647. [2019-12-18 12:07:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14647 states. [2019-12-18 12:07:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14647 states to 14647 states and 43816 transitions. [2019-12-18 12:07:27,465 INFO L78 Accepts]: Start accepts. Automaton has 14647 states and 43816 transitions. Word has length 66 [2019-12-18 12:07:27,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:27,465 INFO L462 AbstractCegarLoop]: Abstraction has 14647 states and 43816 transitions. [2019-12-18 12:07:27,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:07:27,465 INFO L276 IsEmpty]: Start isEmpty. Operand 14647 states and 43816 transitions. [2019-12-18 12:07:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:07:27,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:27,480 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 12:07:27,480 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 12:07:27,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:27,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1717710349, now seen corresponding path program 1 times [2019-12-18 12:07:27,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:27,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138960938] [2019-12-18 12:07:27,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:27,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:27,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138960938] [2019-12-18 12:07:27,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:27,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:07:27,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221455987] [2019-12-18 12:07:27,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:07:27,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:27,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:07:27,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:07:27,578 INFO L87 Difference]: Start difference. First operand 14647 states and 43816 transitions. Second operand 9 states. [2019-12-18 12:07:28,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:28,929 INFO L93 Difference]: Finished difference Result 28454 states and 84160 transitions. [2019-12-18 12:07:28,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:07:28,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 12:07:28,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:28,962 INFO L225 Difference]: With dead ends: 28454 [2019-12-18 12:07:28,962 INFO L226 Difference]: Without dead ends: 23657 [2019-12-18 12:07:28,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:07:29,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23657 states. [2019-12-18 12:07:29,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23657 to 15071. [2019-12-18 12:07:29,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15071 states. [2019-12-18 12:07:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15071 states to 15071 states and 44798 transitions. [2019-12-18 12:07:29,233 INFO L78 Accepts]: Start accepts. Automaton has 15071 states and 44798 transitions. Word has length 67 [2019-12-18 12:07:29,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:29,233 INFO L462 AbstractCegarLoop]: Abstraction has 15071 states and 44798 transitions. [2019-12-18 12:07:29,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:07:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 15071 states and 44798 transitions. [2019-12-18 12:07:29,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:07:29,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:29,248 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 12:07:29,248 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 12:07:29,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:29,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1715738515, now seen corresponding path program 2 times [2019-12-18 12:07:29,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:29,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759038846] [2019-12-18 12:07:29,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:29,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 12:07:29,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759038846] [2019-12-18 12:07:29,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:29,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:07:29,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706421782] [2019-12-18 12:07:29,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:07:29,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:29,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:07:29,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:07:29,408 INFO L87 Difference]: Start difference. First operand 15071 states and 44798 transitions. Second operand 11 states. [2019-12-18 12:07:30,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:30,449 INFO L93 Difference]: Finished difference Result 31554 states and 93034 transitions. [2019-12-18 12:07:30,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 12:07:30,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:07:30,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:30,482 INFO L225 Difference]: With dead ends: 31554 [2019-12-18 12:07:30,482 INFO L226 Difference]: Without dead ends: 25553 [2019-12-18 12:07:30,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 12:07:30,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25553 states. [2019-12-18 12:07:30,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25553 to 14407. [2019-12-18 12:07:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14407 states. [2019-12-18 12:07:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14407 states to 14407 states and 42784 transitions. [2019-12-18 12:07:30,751 INFO L78 Accepts]: Start accepts. Automaton has 14407 states and 42784 transitions. Word has length 67 [2019-12-18 12:07:30,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:30,751 INFO L462 AbstractCegarLoop]: Abstraction has 14407 states and 42784 transitions. [2019-12-18 12:07:30,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:07:30,751 INFO L276 IsEmpty]: Start isEmpty. Operand 14407 states and 42784 transitions. [2019-12-18 12:07:30,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:07:30,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:30,765 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 12:07:30,765 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 12:07:30,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:30,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1475658587, now seen corresponding path program 3 times [2019-12-18 12:07:30,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:30,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246535416] [2019-12-18 12:07:30,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:30,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:30,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246535416] [2019-12-18 12:07:30,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:30,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:07:30,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264121330] [2019-12-18 12:07:30,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:07:30,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:30,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:07:30,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:07:30,905 INFO L87 Difference]: Start difference. First operand 14407 states and 42784 transitions. Second operand 11 states. [2019-12-18 12:07:31,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:31,811 INFO L93 Difference]: Finished difference Result 25540 states and 75375 transitions. [2019-12-18 12:07:31,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:07:31,811 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:07:31,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:31,848 INFO L225 Difference]: With dead ends: 25540 [2019-12-18 12:07:31,848 INFO L226 Difference]: Without dead ends: 25325 [2019-12-18 12:07:31,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:07:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25325 states. [2019-12-18 12:07:32,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25325 to 14231. [2019-12-18 12:07:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14231 states. [2019-12-18 12:07:32,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14231 states to 14231 states and 42300 transitions. [2019-12-18 12:07:32,270 INFO L78 Accepts]: Start accepts. Automaton has 14231 states and 42300 transitions. Word has length 67 [2019-12-18 12:07:32,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:32,271 INFO L462 AbstractCegarLoop]: Abstraction has 14231 states and 42300 transitions. [2019-12-18 12:07:32,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:07:32,271 INFO L276 IsEmpty]: Start isEmpty. Operand 14231 states and 42300 transitions. [2019-12-18 12:07:32,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:07:32,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:32,284 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 12:07:32,285 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 12:07:32,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:32,285 INFO L82 PathProgramCache]: Analyzing trace with hash -200373485, now seen corresponding path program 4 times [2019-12-18 12:07:32,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:32,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836723505] [2019-12-18 12:07:32,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:07:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:07:32,397 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:07:32,397 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:07:32,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_134 0) (= v_~a$r_buff1_thd0~0_110 0) (= v_~x~0_44 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd1~0_147) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= 0 v_~a$w_buff0_used~0_862) (= v_~__unbuffered_p0_EBX~0_60 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t50~0.base_23| 1) |v_#valid_62|) (= 0 v_~a$r_buff1_thd1~0_105) (= v_~main$tmp_guard1~0_27 0) (= v_~a$flush_delayed~0_24 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~a~0_173 0) (= v_~a$r_buff1_thd3~0_219 0) (< 0 |v_#StackHeapBarrier_18|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t50~0.base_23|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t50~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t50~0.base_23|) |v_ULTIMATE.start_main_~#t50~0.offset_18| 0)) |v_#memory_int_21|) (= v_~a$r_buff0_thd3~0_314 0) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~__unbuffered_p2_EBX~0_35 0) (= 0 v_~a$r_buff1_thd2~0_106) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$w_buff0~0_390 0) (= 0 v_~a$r_buff0_thd2~0_104) (= (select .cse0 |v_ULTIMATE.start_main_~#t50~0.base_23|) 0) (= v_~y~0_53 0) (= v_~a$mem_tmp~0_13 0) (= |v_ULTIMATE.start_main_~#t50~0.offset_18| 0) (= |v_#NULL.offset_4| 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t50~0.base_23| 4) |v_#length_23|) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_20 0) (= 0 v_~a$w_buff1~0_260) (= v_~weak$$choice2~0_108 0) (= v_~a$r_buff0_thd0~0_142 0) (= 0 v_~a$w_buff1_used~0_471) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t52~0.offset=|v_ULTIMATE.start_main_~#t52~0.offset_15|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_83|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_241|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_142, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_~#t52~0.base=|v_ULTIMATE.start_main_~#t52~0.base_20|, ~a~0=v_~a~0_173, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_219, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_862, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_147, ULTIMATE.start_main_~#t50~0.offset=|v_ULTIMATE.start_main_~#t50~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_390, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, ~x~0=v_~x~0_44, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_61|, ULTIMATE.start_main_~#t51~0.base=|v_ULTIMATE.start_main_~#t51~0.base_23|, ~a$mem_tmp~0=v_~a$mem_tmp~0_13, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~a$w_buff1~0=v_~a$w_buff1~0_260, ~y~0=v_~y~0_53, ULTIMATE.start_main_~#t51~0.offset=|v_ULTIMATE.start_main_~#t51~0.offset_18|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_105, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_314, ULTIMATE.start_main_~#t50~0.base=|v_ULTIMATE.start_main_~#t50~0.base_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_24, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_471, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t52~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t52~0.base, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t50~0.offset, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t51~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t51~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ULTIMATE.start_main_~#t50~0.base, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 12:07:32,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] P0ENTRY-->L4-3: Formula: (and (= 1 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-1913612467|) (= P0Thread1of1ForFork2_~arg.offset_Out-1913612467 |P0Thread1of1ForFork2_#in~arg.offset_In-1913612467|) (= ~a$w_buff1_used~0_Out-1913612467 ~a$w_buff0_used~0_In-1913612467) (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out-1913612467 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-1913612467|) (= |P0Thread1of1ForFork2_#in~arg.base_In-1913612467| P0Thread1of1ForFork2_~arg.base_Out-1913612467) (= (mod ~a$w_buff1_used~0_Out-1913612467 256) 0) (= ~a$w_buff1~0_Out-1913612467 ~a$w_buff0~0_In-1913612467) (= 1 ~a$w_buff0_used~0_Out-1913612467) (= ~a$w_buff0~0_Out-1913612467 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In-1913612467|, ~a$w_buff0~0=~a$w_buff0~0_In-1913612467, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1913612467, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In-1913612467|} OutVars{~a$w_buff1~0=~a$w_buff1~0_Out-1913612467, P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In-1913612467|, ~a$w_buff0~0=~a$w_buff0~0_Out-1913612467, P0Thread1of1ForFork2_~arg.offset=P0Thread1of1ForFork2_~arg.offset_Out-1913612467, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-1913612467, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out-1913612467, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In-1913612467|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-1913612467, P0Thread1of1ForFork2_~arg.base=P0Thread1of1ForFork2_~arg.base_Out-1913612467, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-1913612467|} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork2_~arg.offset, ~a$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~a$w_buff1_used~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:07:32,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L842-1-->L844: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t51~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t51~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t51~0.base_13|)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t51~0.base_13| 1) |v_#valid_36|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t51~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t51~0.base_13|) |v_ULTIMATE.start_main_~#t51~0.offset_11| 1)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t51~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t51~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t51~0.base=|v_ULTIMATE.start_main_~#t51~0.base_13|, ULTIMATE.start_main_~#t51~0.offset=|v_ULTIMATE.start_main_~#t51~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t51~0.base, ULTIMATE.start_main_~#t51~0.offset] because there is no mapped edge [2019-12-18 12:07:32,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L783-2-->L783-5: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In1452738787 256))) (.cse2 (= |P1Thread1of1ForFork0_#t~ite10_Out1452738787| |P1Thread1of1ForFork0_#t~ite9_Out1452738787|)) (.cse1 (= (mod ~a$w_buff1_used~0_In1452738787 256) 0))) (or (and (= ~a~0_In1452738787 |P1Thread1of1ForFork0_#t~ite9_Out1452738787|) (or .cse0 .cse1) .cse2) (and (not .cse0) .cse2 (not .cse1) (= |P1Thread1of1ForFork0_#t~ite9_Out1452738787| ~a$w_buff1~0_In1452738787)))) InVars {~a~0=~a~0_In1452738787, ~a$w_buff1~0=~a$w_buff1~0_In1452738787, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1452738787, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1452738787} OutVars{~a~0=~a~0_In1452738787, ~a$w_buff1~0=~a$w_buff1~0_In1452738787, P1Thread1of1ForFork0_#t~ite10=|P1Thread1of1ForFork0_#t~ite10_Out1452738787|, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1452738787, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out1452738787|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1452738787} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-18 12:07:32,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-436065853 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-436065853 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite11_Out-436065853| ~a$w_buff0_used~0_In-436065853)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite11_Out-436065853|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-436065853, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-436065853} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-436065853, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-436065853|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-436065853} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 12:07:32,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1105071898 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1105071898 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In1105071898 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd2~0_In1105071898 256) 0))) (or (and (= ~a$w_buff1_used~0_In1105071898 |P1Thread1of1ForFork0_#t~ite12_Out1105071898|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite12_Out1105071898|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1105071898, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1105071898, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1105071898, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1105071898} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1105071898, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1105071898, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out1105071898|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1105071898, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1105071898} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 12:07:32,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1468157527 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1468157527 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite13_Out1468157527|) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd2~0_In1468157527 |P1Thread1of1ForFork0_#t~ite13_Out1468157527|) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1468157527, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1468157527} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1468157527, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1468157527, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out1468157527|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 12:07:32,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L787-->L787-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1560267941 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-1560267941 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1560267941 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1560267941 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite14_Out-1560267941| 0)) (and (= |P1Thread1of1ForFork0_#t~ite14_Out-1560267941| ~a$r_buff1_thd2~0_In-1560267941) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1560267941, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1560267941, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1560267941, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1560267941} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1560267941, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1560267941, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1560267941, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-1560267941|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1560267941} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 12:07:32,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L787-2-->P1EXIT: Formula: (and (= v_~a$r_buff1_thd2~0_53 |v_P1Thread1of1ForFork0_#t~ite14_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_28|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_53, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_27|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 12:07:32,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t52~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t52~0.base_12| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t52~0.base_12| 4)) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t52~0.base_12| 1) |v_#valid_34|) (= 0 |v_ULTIMATE.start_main_~#t52~0.offset_10|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t52~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t52~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t52~0.base_12|) |v_ULTIMATE.start_main_~#t52~0.offset_10| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t52~0.base=|v_ULTIMATE.start_main_~#t52~0.base_12|, ULTIMATE.start_main_~#t52~0.offset=|v_ULTIMATE.start_main_~#t52~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t52~0.base, ULTIMATE.start_main_~#t52~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-18 12:07:32,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1846851186 256)))) (or (and .cse0 (= ~a$w_buff0~0_In-1846851186 |P2Thread1of1ForFork1_#t~ite20_Out-1846851186|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1846851186 256)))) (or (and (= 0 (mod ~a$w_buff1_used~0_In-1846851186 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-1846851186 256)) (and (= (mod ~a$r_buff1_thd3~0_In-1846851186 256) 0) .cse1))) (= |P2Thread1of1ForFork1_#t~ite21_Out-1846851186| |P2Thread1of1ForFork1_#t~ite20_Out-1846851186|)) (and (= ~a$w_buff0~0_In-1846851186 |P2Thread1of1ForFork1_#t~ite21_Out-1846851186|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite20_In-1846851186| |P2Thread1of1ForFork1_#t~ite20_Out-1846851186|)))) InVars {P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In-1846851186|, ~a$w_buff0~0=~a$w_buff0~0_In-1846851186, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1846851186, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1846851186, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1846851186, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1846851186, ~weak$$choice2~0=~weak$$choice2~0_In-1846851186} OutVars{P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out-1846851186|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out-1846851186|, ~a$w_buff0~0=~a$w_buff0~0_In-1846851186, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1846851186, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1846851186, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1846851186, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1846851186, ~weak$$choice2~0=~weak$$choice2~0_In-1846851186} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 12:07:32,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In486243727 256)))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite27_Out486243727| |P2Thread1of1ForFork1_#t~ite26_Out486243727|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In486243727 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In486243727 256)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In486243727 256))) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In486243727 256))))) (= ~a$w_buff0_used~0_In486243727 |P2Thread1of1ForFork1_#t~ite26_Out486243727|)) (and (= ~a$w_buff0_used~0_In486243727 |P2Thread1of1ForFork1_#t~ite27_Out486243727|) (= |P2Thread1of1ForFork1_#t~ite26_In486243727| |P2Thread1of1ForFork1_#t~ite26_Out486243727|) (not .cse0)))) InVars {P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In486243727|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In486243727, ~a$w_buff0_used~0=~a$w_buff0_used~0_In486243727, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In486243727, ~a$w_buff1_used~0=~a$w_buff1_used~0_In486243727, ~weak$$choice2~0=~weak$$choice2~0_In486243727} OutVars{P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out486243727|, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out486243727|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In486243727, ~a$w_buff0_used~0=~a$w_buff0_used~0_In486243727, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In486243727, ~a$w_buff1_used~0=~a$w_buff1_used~0_In486243727, ~weak$$choice2~0=~weak$$choice2~0_In486243727} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-18 12:07:32,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L812-->L813: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33, ~a$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 12:07:32,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L815-->L819: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_42 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_42, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite37, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 12:07:32,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L819-2-->L819-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1879023686 256))) (.cse1 (= (mod ~a$r_buff1_thd3~0_In-1879023686 256) 0))) (or (and (not .cse0) (= ~a$w_buff1~0_In-1879023686 |P2Thread1of1ForFork1_#t~ite38_Out-1879023686|) (not .cse1)) (and (= ~a~0_In-1879023686 |P2Thread1of1ForFork1_#t~ite38_Out-1879023686|) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-1879023686, ~a$w_buff1~0=~a$w_buff1~0_In-1879023686, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1879023686, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1879023686} OutVars{~a~0=~a~0_In-1879023686, P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-1879023686|, ~a$w_buff1~0=~a$w_buff1~0_In-1879023686, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1879023686, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1879023686} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-18 12:07:32,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-4-->L820: Formula: (= v_~a~0_31 |v_P2Thread1of1ForFork1_#t~ite38_14|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_14|} OutVars{~a~0=v_~a~0_31, P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_13|, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_13|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite38, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-18 12:07:32,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-636706115 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-636706115 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite40_Out-636706115| ~a$w_buff0_used~0_In-636706115) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite40_Out-636706115| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-636706115, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-636706115} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-636706115, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-636706115, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-636706115|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-18 12:07:32,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-->L821-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In-1095937449 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd3~0_In-1095937449 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1095937449 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd3~0_In-1095937449 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite41_Out-1095937449| 0)) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-1095937449 |P2Thread1of1ForFork1_#t~ite41_Out-1095937449|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1095937449, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1095937449, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1095937449, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1095937449} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1095937449, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1095937449, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1095937449, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out-1095937449|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1095937449} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-18 12:07:32,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1447123039 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1447123039 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd3~0_In-1447123039 |P2Thread1of1ForFork1_#t~ite42_Out-1447123039|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite42_Out-1447123039|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1447123039, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1447123039} OutVars{P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-1447123039|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1447123039, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1447123039} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-18 12:07:32,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1052830550 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1052830550 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-1052830550 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In-1052830550 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite43_Out-1052830550|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~a$r_buff1_thd3~0_In-1052830550 |P2Thread1of1ForFork1_#t~ite43_Out-1052830550|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1052830550, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1052830550, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1052830550, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1052830550} OutVars{P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-1052830550|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1052830550, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1052830550, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1052830550, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1052830550} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-18 12:07:32,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~a$r_buff1_thd3~0_109 |v_P2Thread1of1ForFork1_#t~ite43_34|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_33|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_109, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 12:07:32,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L761-->L761-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1784569484 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1784569484 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite5_Out-1784569484| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork2_#t~ite5_Out-1784569484| ~a$w_buff0_used~0_In-1784569484)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1784569484, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1784569484} OutVars{P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out-1784569484|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1784569484, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1784569484} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 12:07:32,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L762-->L762-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-1954264111 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1954264111 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In-1954264111 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1954264111 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork2_#t~ite6_Out-1954264111| ~a$w_buff1_used~0_In-1954264111) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork2_#t~ite6_Out-1954264111| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1954264111, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1954264111, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1954264111, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1954264111} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1954264111, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1954264111|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1954264111, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1954264111, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1954264111} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 12:07:32,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L763-->L764: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1008778789 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1008778789 256)))) (or (and (= ~a$r_buff0_thd1~0_In-1008778789 ~a$r_buff0_thd1~0_Out-1008778789) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~a$r_buff0_thd1~0_Out-1008778789 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1008778789, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1008778789} OutVars{P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-1008778789|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1008778789, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1008778789} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:07:32,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L764-->L764-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1841222186 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-1841222186 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1841222186 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1841222186 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_Out-1841222186| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork2_#t~ite8_Out-1841222186| ~a$r_buff1_thd1~0_In-1841222186)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1841222186, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1841222186, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1841222186, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1841222186} OutVars{P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1841222186|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1841222186, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1841222186, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1841222186, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1841222186} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 12:07:32,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L764-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_44| v_~a$r_buff1_thd1~0_72) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_43|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, ~a$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:07:32,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:07:32,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L852-2-->L852-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In-423787523 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-423787523 256)))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In-423787523 |ULTIMATE.start_main_#t~ite47_Out-423787523|)) (and (or .cse1 .cse0) (= ~a~0_In-423787523 |ULTIMATE.start_main_#t~ite47_Out-423787523|)))) InVars {~a~0=~a~0_In-423787523, ~a$w_buff1~0=~a$w_buff1~0_In-423787523, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-423787523, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-423787523} OutVars{~a~0=~a~0_In-423787523, ~a$w_buff1~0=~a$w_buff1~0_In-423787523, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-423787523|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-423787523, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-423787523} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:07:32,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L852-4-->L853: Formula: (= v_~a~0_58 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_58, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:07:32,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1460482655 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1460482655 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1460482655| ~a$w_buff0_used~0_In-1460482655)) (and (= |ULTIMATE.start_main_#t~ite49_Out-1460482655| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1460482655, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1460482655} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1460482655, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1460482655|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1460482655} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:07:32,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-647540794 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-647540794 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-647540794 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In-647540794 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-647540794|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In-647540794 |ULTIMATE.start_main_#t~ite50_Out-647540794|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-647540794, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-647540794, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-647540794, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-647540794} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-647540794|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-647540794, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-647540794, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-647540794, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-647540794} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:07:32,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L855-->L855-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-2054669377 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-2054669377 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-2054669377| 0)) (and (= ~a$r_buff0_thd0~0_In-2054669377 |ULTIMATE.start_main_#t~ite51_Out-2054669377|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2054669377, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2054669377} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-2054669377|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2054669377, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2054669377} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:07:32,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1328502906 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1328502906 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-1328502906 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In-1328502906 256)))) (or (and (= ~a$r_buff1_thd0~0_In-1328502906 |ULTIMATE.start_main_#t~ite52_Out-1328502906|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1328502906|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1328502906, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1328502906, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1328502906, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1328502906} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1328502906|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1328502906, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1328502906, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1328502906, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1328502906} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:07:32,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_21 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_21 256)) (= 1 v_~__unbuffered_p1_EAX~0_27) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~a$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite52_44|) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_54) (= 1 v_~__unbuffered_p2_EAX~0_24)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_44|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24, 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, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:07:32,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:07:32 BasicIcfg [2019-12-18 12:07:32,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:07:32,548 INFO L168 Benchmark]: Toolchain (without parser) took 96945.90 ms. Allocated memory was 138.4 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 101.0 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 12:07:32,549 INFO L168 Benchmark]: CDTParser took 1.35 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 12:07:32,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.13 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 155.9 MB in the end (delta: -55.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 12:07:32,550 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.74 ms. Allocated memory is still 202.9 MB. Free memory was 155.9 MB in the beginning and 153.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:07:32,550 INFO L168 Benchmark]: Boogie Preprocessor took 42.27 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:07:32,551 INFO L168 Benchmark]: RCFGBuilder took 813.00 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 99.7 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:07:32,551 INFO L168 Benchmark]: TraceAbstraction took 95242.56 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 99.7 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 12:07:32,554 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.35 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 766.13 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 155.9 MB in the end (delta: -55.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.74 ms. Allocated memory is still 202.9 MB. Free memory was 155.9 MB in the beginning and 153.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.27 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 813.00 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 99.7 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 95242.56 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 99.7 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 180 ProgramPointsBefore, 95 ProgramPointsAfterwards, 217 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7415 VarBasedMoverChecksPositive, 242 VarBasedMoverChecksNegative, 41 SemBasedMoverChecksPositive, 273 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 93316 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t50, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L744] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L745] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L746] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L747] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L748] 1 a$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 [L754] 1 __unbuffered_p0_EAX = x [L757] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t51, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L774] 2 y = 1 [L777] 2 __unbuffered_p1_EAX = y [L780] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L760] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L783] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L846] FCALL, FORK 0 pthread_create(&t52, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L797] 3 z = 1 [L800] 3 __unbuffered_p2_EAX = z [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L808] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L809] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L809] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L810] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L852] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L855] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 94.8s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 32.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6948 SDtfs, 10100 SDslu, 23759 SDs, 0 SdLazy, 8892 SolverSat, 454 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 330 GetRequests, 40 SyntacticMatches, 8 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162301occurred 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: 33.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 349867 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1351 NumberOfCodeBlocks, 1351 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1257 ConstructedInterpolants, 0 QuantifiedInterpolants, 245132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...