/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:48:17,310 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:48:17,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:48:17,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:48:17,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:48:17,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:48:17,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:48:17,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:48:17,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:48:17,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:48:17,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:48:17,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:48:17,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:48:17,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:48:17,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:48:17,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:48:17,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:48:17,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:48:17,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:48:17,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:48:17,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:48:17,344 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:48:17,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:48:17,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:48:17,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:48:17,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:48:17,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:48:17,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:48:17,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:48:17,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:48:17,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:48:17,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:48:17,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:48:17,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:48:17,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:48:17,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:48:17,355 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:48:17,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:48:17,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:48:17,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:48:17,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:48:17,358 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:48:17,372 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:48:17,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:48:17,373 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:48:17,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:48:17,374 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:48:17,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:48:17,374 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:48:17,374 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:48:17,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:48:17,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:48:17,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:48:17,375 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:48:17,375 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:48:17,375 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:48:17,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:48:17,376 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:48:17,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:48:17,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:48:17,376 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:48:17,377 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:48:17,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:48:17,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:48:17,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:48:17,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:48:17,378 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:48:17,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:48:17,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:48:17,378 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:48:17,378 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:48:17,628 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:48:17,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:48:17,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:48:17,648 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:48:17,648 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:48:17,649 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc.i [2019-12-18 16:48:17,721 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20d551092/3bb591220eca4b779d6530205c956d11/FLAG3e44fdedf [2019-12-18 16:48:18,300 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:48:18,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.oepc.i [2019-12-18 16:48:18,323 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20d551092/3bb591220eca4b779d6530205c956d11/FLAG3e44fdedf [2019-12-18 16:48:18,571 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20d551092/3bb591220eca4b779d6530205c956d11 [2019-12-18 16:48:18,580 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:48:18,582 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:48:18,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:48:18,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:48:18,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:48:18,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:48:18" (1/1) ... [2019-12-18 16:48:18,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32100126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:18, skipping insertion in model container [2019-12-18 16:48:18,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:48:18" (1/1) ... [2019-12-18 16:48:18,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:48:18,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:48:19,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:48:19,211 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:48:19,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:48:19,371 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:48:19,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:19 WrapperNode [2019-12-18 16:48:19,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:48:19,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:48:19,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:48:19,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:48:19,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:19" (1/1) ... [2019-12-18 16:48:19,401 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:19" (1/1) ... [2019-12-18 16:48:19,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:48:19,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:48:19,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:48:19,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:48:19,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:19" (1/1) ... [2019-12-18 16:48:19,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:19" (1/1) ... [2019-12-18 16:48:19,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:19" (1/1) ... [2019-12-18 16:48:19,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:19" (1/1) ... [2019-12-18 16:48:19,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:19" (1/1) ... [2019-12-18 16:48:19,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:19" (1/1) ... [2019-12-18 16:48:19,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:19" (1/1) ... [2019-12-18 16:48:19,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:48:19,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:48:19,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:48:19,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:48:19,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:19" (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 16:48:19,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:48:19,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:48:19,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:48:19,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:48:19,548 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:48:19,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:48:19,549 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:48:19,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:48:19,549 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:48:19,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:48:19,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:48:19,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:48:19,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:48:19,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 16:48:20,311 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:48:20,312 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:48:20,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:48:20 BoogieIcfgContainer [2019-12-18 16:48:20,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:48:20,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:48:20,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:48:20,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:48:20,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:48:18" (1/3) ... [2019-12-18 16:48:20,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41611a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:48:20, skipping insertion in model container [2019-12-18 16:48:20,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:19" (2/3) ... [2019-12-18 16:48:20,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41611a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:48:20, skipping insertion in model container [2019-12-18 16:48:20,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:48:20" (3/3) ... [2019-12-18 16:48:20,325 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc.i [2019-12-18 16:48:20,335 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:48:20,336 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:48:20,347 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:48:20,348 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:48:20,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,413 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,413 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,413 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,414 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,415 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,456 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,457 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,474 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,475 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,516 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,518 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,532 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,533 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,533 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,535 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,535 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:20,557 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 16:48:20,577 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:48:20,577 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:48:20,578 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:48:20,578 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:48:20,578 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:48:20,578 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:48:20,578 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:48:20,578 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:48:20,594 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 16:48:20,596 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 16:48:20,688 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 16:48:20,688 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:48:20,709 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:48:20,736 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 16:48:20,803 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 16:48:20,804 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:48:20,814 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:48:20,837 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 16:48:20,839 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:48:25,688 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-12-18 16:48:26,125 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 16:48:26,265 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 16:48:26,293 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78858 [2019-12-18 16:48:26,293 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 16:48:26,297 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-18 16:48:45,786 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-18 16:48:45,788 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-18 16:48:45,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 16:48:45,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:48:45,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 16:48:45,795 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 16:48:45,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:48:45,801 INFO L82 PathProgramCache]: Analyzing trace with hash 917918, now seen corresponding path program 1 times [2019-12-18 16:48:45,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:48:45,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047510383] [2019-12-18 16:48:45,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:48:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:48:46,046 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 16:48:46,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047510383] [2019-12-18 16:48:46,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:48:46,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:48:46,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49418284] [2019-12-18 16:48:46,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:48:46,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:48:46,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:48:46,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:48:46,075 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-18 16:48:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:48:49,182 INFO L93 Difference]: Finished difference Result 114110 states and 484570 transitions. [2019-12-18 16:48:49,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:48:49,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 16:48:49,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:48:49,832 INFO L225 Difference]: With dead ends: 114110 [2019-12-18 16:48:49,832 INFO L226 Difference]: Without dead ends: 107012 [2019-12-18 16:48:49,834 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 16:48:54,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107012 states. [2019-12-18 16:49:00,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107012 to 107012. [2019-12-18 16:49:00,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107012 states. [2019-12-18 16:49:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107012 states to 107012 states and 453812 transitions. [2019-12-18 16:49:00,990 INFO L78 Accepts]: Start accepts. Automaton has 107012 states and 453812 transitions. Word has length 3 [2019-12-18 16:49:00,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:00,991 INFO L462 AbstractCegarLoop]: Abstraction has 107012 states and 453812 transitions. [2019-12-18 16:49:00,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:49:00,991 INFO L276 IsEmpty]: Start isEmpty. Operand 107012 states and 453812 transitions. [2019-12-18 16:49:00,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 16:49:00,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:00,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:49:00,995 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 16:49:00,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:00,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1578322365, now seen corresponding path program 1 times [2019-12-18 16:49:00,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:00,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254965669] [2019-12-18 16:49:00,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:01,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 16:49:01,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254965669] [2019-12-18 16:49:01,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:01,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:49:01,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029252673] [2019-12-18 16:49:01,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:49:01,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:01,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:49:01,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:49:01,162 INFO L87 Difference]: Start difference. First operand 107012 states and 453812 transitions. Second operand 4 states. [2019-12-18 16:49:06,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:06,739 INFO L93 Difference]: Finished difference Result 166210 states and 677236 transitions. [2019-12-18 16:49:06,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:49:06,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 16:49:06,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:07,474 INFO L225 Difference]: With dead ends: 166210 [2019-12-18 16:49:07,474 INFO L226 Difference]: Without dead ends: 166161 [2019-12-18 16:49:07,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 16:49:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166161 states. [2019-12-18 16:49:16,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166161 to 151748. [2019-12-18 16:49:16,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151748 states. [2019-12-18 16:49:16,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151748 states to 151748 states and 626089 transitions. [2019-12-18 16:49:16,861 INFO L78 Accepts]: Start accepts. Automaton has 151748 states and 626089 transitions. Word has length 11 [2019-12-18 16:49:16,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:16,861 INFO L462 AbstractCegarLoop]: Abstraction has 151748 states and 626089 transitions. [2019-12-18 16:49:16,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:49:16,862 INFO L276 IsEmpty]: Start isEmpty. Operand 151748 states and 626089 transitions. [2019-12-18 16:49:16,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:49:16,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:16,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:49:16,868 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 16:49:16,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:16,869 INFO L82 PathProgramCache]: Analyzing trace with hash 608601994, now seen corresponding path program 1 times [2019-12-18 16:49:16,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:16,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754391738] [2019-12-18 16:49:16,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:16,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:16,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754391738] [2019-12-18 16:49:16,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:16,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:49:16,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899431417] [2019-12-18 16:49:16,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:49:16,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:16,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:49:16,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:49:16,963 INFO L87 Difference]: Start difference. First operand 151748 states and 626089 transitions. Second operand 3 states. [2019-12-18 16:49:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:17,098 INFO L93 Difference]: Finished difference Result 33068 states and 106908 transitions. [2019-12-18 16:49:17,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:49:17,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 16:49:17,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:17,156 INFO L225 Difference]: With dead ends: 33068 [2019-12-18 16:49:17,156 INFO L226 Difference]: Without dead ends: 33068 [2019-12-18 16:49:17,156 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 16:49:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33068 states. [2019-12-18 16:49:22,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33068 to 33068. [2019-12-18 16:49:22,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-18 16:49:22,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 106908 transitions. [2019-12-18 16:49:22,532 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 106908 transitions. Word has length 13 [2019-12-18 16:49:22,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:22,532 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 106908 transitions. [2019-12-18 16:49:22,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:49:22,532 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 106908 transitions. [2019-12-18 16:49:22,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:49:22,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:22,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:49:22,537 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 16:49:22,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:22,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1174763718, now seen corresponding path program 1 times [2019-12-18 16:49:22,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:22,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712753620] [2019-12-18 16:49:22,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:22,686 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 16:49:22,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712753620] [2019-12-18 16:49:22,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:22,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:49:22,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063430336] [2019-12-18 16:49:22,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:49:22,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:22,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:49:22,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:49:22,688 INFO L87 Difference]: Start difference. First operand 33068 states and 106908 transitions. Second operand 5 states. [2019-12-18 16:49:23,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:23,229 INFO L93 Difference]: Finished difference Result 45410 states and 145082 transitions. [2019-12-18 16:49:23,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:49:23,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 16:49:23,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:23,301 INFO L225 Difference]: With dead ends: 45410 [2019-12-18 16:49:23,302 INFO L226 Difference]: Without dead ends: 45410 [2019-12-18 16:49:23,302 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 16:49:23,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45410 states. [2019-12-18 16:49:23,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45410 to 38207. [2019-12-18 16:49:23,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38207 states. [2019-12-18 16:49:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38207 states to 38207 states and 123094 transitions. [2019-12-18 16:49:24,053 INFO L78 Accepts]: Start accepts. Automaton has 38207 states and 123094 transitions. Word has length 16 [2019-12-18 16:49:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:24,055 INFO L462 AbstractCegarLoop]: Abstraction has 38207 states and 123094 transitions. [2019-12-18 16:49:24,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:49:24,055 INFO L276 IsEmpty]: Start isEmpty. Operand 38207 states and 123094 transitions. [2019-12-18 16:49:24,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:49:24,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:24,065 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 16:49:24,065 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 16:49:24,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:24,065 INFO L82 PathProgramCache]: Analyzing trace with hash -219431606, now seen corresponding path program 1 times [2019-12-18 16:49:24,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:24,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407234781] [2019-12-18 16:49:24,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:24,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407234781] [2019-12-18 16:49:24,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:24,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:49:24,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625437898] [2019-12-18 16:49:24,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:49:24,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:24,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:49:24,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:49:24,552 INFO L87 Difference]: Start difference. First operand 38207 states and 123094 transitions. Second operand 6 states. [2019-12-18 16:49:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:25,683 INFO L93 Difference]: Finished difference Result 56872 states and 178934 transitions. [2019-12-18 16:49:25,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:49:25,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 16:49:25,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:25,777 INFO L225 Difference]: With dead ends: 56872 [2019-12-18 16:49:25,777 INFO L226 Difference]: Without dead ends: 56865 [2019-12-18 16:49:25,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:49:25,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56865 states. [2019-12-18 16:49:26,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56865 to 38602. [2019-12-18 16:49:26,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38602 states. [2019-12-18 16:49:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38602 states to 38602 states and 123793 transitions. [2019-12-18 16:49:26,557 INFO L78 Accepts]: Start accepts. Automaton has 38602 states and 123793 transitions. Word has length 22 [2019-12-18 16:49:26,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:26,557 INFO L462 AbstractCegarLoop]: Abstraction has 38602 states and 123793 transitions. [2019-12-18 16:49:26,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:49:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 38602 states and 123793 transitions. [2019-12-18 16:49:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 16:49:26,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:26,570 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 16:49:26,570 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 16:49:26,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:26,571 INFO L82 PathProgramCache]: Analyzing trace with hash -2132778958, now seen corresponding path program 1 times [2019-12-18 16:49:26,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:26,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710507892] [2019-12-18 16:49:26,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:26,656 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 16:49:26,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710507892] [2019-12-18 16:49:26,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:26,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:49:26,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872694273] [2019-12-18 16:49:26,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:49:26,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:26,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:49:26,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:49:26,659 INFO L87 Difference]: Start difference. First operand 38602 states and 123793 transitions. Second operand 4 states. [2019-12-18 16:49:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:26,732 INFO L93 Difference]: Finished difference Result 16014 states and 48574 transitions. [2019-12-18 16:49:26,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:49:26,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 16:49:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:26,757 INFO L225 Difference]: With dead ends: 16014 [2019-12-18 16:49:26,757 INFO L226 Difference]: Without dead ends: 16014 [2019-12-18 16:49:26,757 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 16:49:26,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-12-18 16:49:26,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 15686. [2019-12-18 16:49:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15686 states. [2019-12-18 16:49:26,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15686 states to 15686 states and 47638 transitions. [2019-12-18 16:49:26,994 INFO L78 Accepts]: Start accepts. Automaton has 15686 states and 47638 transitions. Word has length 25 [2019-12-18 16:49:26,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:26,994 INFO L462 AbstractCegarLoop]: Abstraction has 15686 states and 47638 transitions. [2019-12-18 16:49:26,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:49:26,995 INFO L276 IsEmpty]: Start isEmpty. Operand 15686 states and 47638 transitions. [2019-12-18 16:49:27,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 16:49:27,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:27,006 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 16:49:27,006 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 16:49:27,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:27,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1790545903, now seen corresponding path program 1 times [2019-12-18 16:49:27,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:27,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828787052] [2019-12-18 16:49:27,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:27,466 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 16:49:27,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828787052] [2019-12-18 16:49:27,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:27,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:49:27,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360675684] [2019-12-18 16:49:27,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:49:27,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:27,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:49:27,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:49:27,469 INFO L87 Difference]: Start difference. First operand 15686 states and 47638 transitions. Second operand 6 states. [2019-12-18 16:49:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:28,084 INFO L93 Difference]: Finished difference Result 22624 states and 66983 transitions. [2019-12-18 16:49:28,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 16:49:28,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 16:49:28,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:28,121 INFO L225 Difference]: With dead ends: 22624 [2019-12-18 16:49:28,121 INFO L226 Difference]: Without dead ends: 22624 [2019-12-18 16:49:28,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:49:28,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22624 states. [2019-12-18 16:49:28,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22624 to 18003. [2019-12-18 16:49:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18003 states. [2019-12-18 16:49:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18003 states to 18003 states and 54460 transitions. [2019-12-18 16:49:28,430 INFO L78 Accepts]: Start accepts. Automaton has 18003 states and 54460 transitions. Word has length 27 [2019-12-18 16:49:28,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:28,430 INFO L462 AbstractCegarLoop]: Abstraction has 18003 states and 54460 transitions. [2019-12-18 16:49:28,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:49:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 18003 states and 54460 transitions. [2019-12-18 16:49:28,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 16:49:28,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:28,449 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 16:49:28,449 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 16:49:28,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:28,449 INFO L82 PathProgramCache]: Analyzing trace with hash -718999585, now seen corresponding path program 1 times [2019-12-18 16:49:28,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:28,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584820746] [2019-12-18 16:49:28,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:28,599 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 16:49:28,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584820746] [2019-12-18 16:49:28,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:28,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:49:28,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732900015] [2019-12-18 16:49:28,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:49:28,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:28,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:49:28,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:49:28,601 INFO L87 Difference]: Start difference. First operand 18003 states and 54460 transitions. Second operand 7 states. [2019-12-18 16:49:29,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:29,872 INFO L93 Difference]: Finished difference Result 24689 states and 72792 transitions. [2019-12-18 16:49:29,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 16:49:29,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 16:49:29,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:29,909 INFO L225 Difference]: With dead ends: 24689 [2019-12-18 16:49:29,909 INFO L226 Difference]: Without dead ends: 24689 [2019-12-18 16:49:29,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 16:49:29,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24689 states. [2019-12-18 16:49:30,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24689 to 16556. [2019-12-18 16:49:30,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16556 states. [2019-12-18 16:49:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16556 states to 16556 states and 50149 transitions. [2019-12-18 16:49:30,206 INFO L78 Accepts]: Start accepts. Automaton has 16556 states and 50149 transitions. Word has length 33 [2019-12-18 16:49:30,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:30,207 INFO L462 AbstractCegarLoop]: Abstraction has 16556 states and 50149 transitions. [2019-12-18 16:49:30,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:49:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 16556 states and 50149 transitions. [2019-12-18 16:49:30,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:49:30,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:30,230 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 16:49:30,230 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 16:49:30,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:30,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1488715022, now seen corresponding path program 1 times [2019-12-18 16:49:30,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:30,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560632419] [2019-12-18 16:49:30,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:30,287 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 16:49:30,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560632419] [2019-12-18 16:49:30,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:30,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:49:30,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361871142] [2019-12-18 16:49:30,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:49:30,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:30,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:49:30,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:49:30,289 INFO L87 Difference]: Start difference. First operand 16556 states and 50149 transitions. Second operand 3 states. [2019-12-18 16:49:30,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:30,423 INFO L93 Difference]: Finished difference Result 31245 states and 94721 transitions. [2019-12-18 16:49:30,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:49:30,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 16:49:30,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:30,460 INFO L225 Difference]: With dead ends: 31245 [2019-12-18 16:49:30,461 INFO L226 Difference]: Without dead ends: 17019 [2019-12-18 16:49:30,461 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 16:49:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2019-12-18 16:49:30,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 16954. [2019-12-18 16:49:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-18 16:49:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50123 transitions. [2019-12-18 16:49:31,135 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50123 transitions. Word has length 39 [2019-12-18 16:49:31,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:31,135 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50123 transitions. [2019-12-18 16:49:31,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:49:31,135 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50123 transitions. [2019-12-18 16:49:31,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:49:31,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:31,157 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 16:49:31,157 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 16:49:31,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:31,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1258899919, now seen corresponding path program 1 times [2019-12-18 16:49:31,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:31,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600923421] [2019-12-18 16:49:31,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:31,220 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 16:49:31,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600923421] [2019-12-18 16:49:31,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:31,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:49:31,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591319647] [2019-12-18 16:49:31,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:49:31,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:31,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:49:31,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:49:31,223 INFO L87 Difference]: Start difference. First operand 16954 states and 50123 transitions. Second operand 4 states. [2019-12-18 16:49:31,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:31,326 INFO L93 Difference]: Finished difference Result 24032 states and 72414 transitions. [2019-12-18 16:49:31,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:49:31,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 16:49:31,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:31,342 INFO L225 Difference]: With dead ends: 24032 [2019-12-18 16:49:31,342 INFO L226 Difference]: Without dead ends: 10093 [2019-12-18 16:49:31,343 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 16:49:31,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2019-12-18 16:49:31,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 10019. [2019-12-18 16:49:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10019 states. [2019-12-18 16:49:31,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10019 states to 10019 states and 28985 transitions. [2019-12-18 16:49:31,489 INFO L78 Accepts]: Start accepts. Automaton has 10019 states and 28985 transitions. Word has length 40 [2019-12-18 16:49:31,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:31,489 INFO L462 AbstractCegarLoop]: Abstraction has 10019 states and 28985 transitions. [2019-12-18 16:49:31,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:49:31,489 INFO L276 IsEmpty]: Start isEmpty. Operand 10019 states and 28985 transitions. [2019-12-18 16:49:31,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:49:31,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:31,503 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 16:49:31,503 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 16:49:31,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:31,503 INFO L82 PathProgramCache]: Analyzing trace with hash -328554267, now seen corresponding path program 2 times [2019-12-18 16:49:31,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:31,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403327621] [2019-12-18 16:49:31,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:31,564 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 16:49:31,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403327621] [2019-12-18 16:49:31,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:31,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:49:31,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424737154] [2019-12-18 16:49:31,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:49:31,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:31,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:49:31,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:49:31,567 INFO L87 Difference]: Start difference. First operand 10019 states and 28985 transitions. Second operand 5 states. [2019-12-18 16:49:31,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:31,631 INFO L93 Difference]: Finished difference Result 9224 states and 27210 transitions. [2019-12-18 16:49:31,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:49:31,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 16:49:31,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:31,647 INFO L225 Difference]: With dead ends: 9224 [2019-12-18 16:49:31,648 INFO L226 Difference]: Without dead ends: 6480 [2019-12-18 16:49:31,648 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 16:49:31,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6480 states. [2019-12-18 16:49:31,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6480 to 6480. [2019-12-18 16:49:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6480 states. [2019-12-18 16:49:31,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6480 states to 6480 states and 20925 transitions. [2019-12-18 16:49:31,804 INFO L78 Accepts]: Start accepts. Automaton has 6480 states and 20925 transitions. Word has length 40 [2019-12-18 16:49:31,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:31,805 INFO L462 AbstractCegarLoop]: Abstraction has 6480 states and 20925 transitions. [2019-12-18 16:49:31,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:49:31,805 INFO L276 IsEmpty]: Start isEmpty. Operand 6480 states and 20925 transitions. [2019-12-18 16:49:31,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:49:31,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:31,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:49:31,814 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 16:49:31,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:31,814 INFO L82 PathProgramCache]: Analyzing trace with hash -195559637, now seen corresponding path program 1 times [2019-12-18 16:49:31,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:31,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292250991] [2019-12-18 16:49:31,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:31,864 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 16:49:31,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292250991] [2019-12-18 16:49:31,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:31,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:49:31,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537077739] [2019-12-18 16:49:31,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:49:31,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:31,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:49:31,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:49:31,866 INFO L87 Difference]: Start difference. First operand 6480 states and 20925 transitions. Second operand 3 states. [2019-12-18 16:49:31,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:31,937 INFO L93 Difference]: Finished difference Result 9612 states and 30454 transitions. [2019-12-18 16:49:31,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:49:31,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 16:49:31,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:31,954 INFO L225 Difference]: With dead ends: 9612 [2019-12-18 16:49:31,954 INFO L226 Difference]: Without dead ends: 9612 [2019-12-18 16:49:31,954 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 16:49:32,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9612 states. [2019-12-18 16:49:32,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9612 to 7416. [2019-12-18 16:49:32,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7416 states. [2019-12-18 16:49:32,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7416 states to 7416 states and 23733 transitions. [2019-12-18 16:49:32,089 INFO L78 Accepts]: Start accepts. Automaton has 7416 states and 23733 transitions. Word has length 64 [2019-12-18 16:49:32,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:32,090 INFO L462 AbstractCegarLoop]: Abstraction has 7416 states and 23733 transitions. [2019-12-18 16:49:32,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:49:32,090 INFO L276 IsEmpty]: Start isEmpty. Operand 7416 states and 23733 transitions. [2019-12-18 16:49:32,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:49:32,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:32,099 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:49:32,099 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 16:49:32,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:32,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1426110435, now seen corresponding path program 1 times [2019-12-18 16:49:32,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:32,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314328507] [2019-12-18 16:49:32,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:32,215 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 16:49:32,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314328507] [2019-12-18 16:49:32,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:32,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:49:32,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696368519] [2019-12-18 16:49:32,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:49:32,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:32,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:49:32,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:49:32,217 INFO L87 Difference]: Start difference. First operand 7416 states and 23733 transitions. Second operand 7 states. [2019-12-18 16:49:32,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:32,547 INFO L93 Difference]: Finished difference Result 14786 states and 46379 transitions. [2019-12-18 16:49:32,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:49:32,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:49:32,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:32,575 INFO L225 Difference]: With dead ends: 14786 [2019-12-18 16:49:32,576 INFO L226 Difference]: Without dead ends: 11103 [2019-12-18 16:49:32,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:49:32,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11103 states. [2019-12-18 16:49:32,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11103 to 9096. [2019-12-18 16:49:32,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9096 states. [2019-12-18 16:49:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9096 states to 9096 states and 28970 transitions. [2019-12-18 16:49:32,842 INFO L78 Accepts]: Start accepts. Automaton has 9096 states and 28970 transitions. Word has length 64 [2019-12-18 16:49:32,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:32,843 INFO L462 AbstractCegarLoop]: Abstraction has 9096 states and 28970 transitions. [2019-12-18 16:49:32,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:49:32,843 INFO L276 IsEmpty]: Start isEmpty. Operand 9096 states and 28970 transitions. [2019-12-18 16:49:32,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:49:32,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:32,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:49:32,858 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 16:49:32,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:32,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1226826331, now seen corresponding path program 2 times [2019-12-18 16:49:32,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:32,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141947816] [2019-12-18 16:49:32,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:32,948 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 16:49:32,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141947816] [2019-12-18 16:49:32,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:32,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:49:32,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233993236] [2019-12-18 16:49:32,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:49:32,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:32,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:49:32,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:49:32,950 INFO L87 Difference]: Start difference. First operand 9096 states and 28970 transitions. Second operand 7 states. [2019-12-18 16:49:33,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:33,247 INFO L93 Difference]: Finished difference Result 16709 states and 52072 transitions. [2019-12-18 16:49:33,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:49:33,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:49:33,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:33,270 INFO L225 Difference]: With dead ends: 16709 [2019-12-18 16:49:33,270 INFO L226 Difference]: Without dead ends: 12623 [2019-12-18 16:49:33,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:49:33,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12623 states. [2019-12-18 16:49:33,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12623 to 10382. [2019-12-18 16:49:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10382 states. [2019-12-18 16:49:33,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10382 states to 10382 states and 32866 transitions. [2019-12-18 16:49:33,581 INFO L78 Accepts]: Start accepts. Automaton has 10382 states and 32866 transitions. Word has length 64 [2019-12-18 16:49:33,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:33,582 INFO L462 AbstractCegarLoop]: Abstraction has 10382 states and 32866 transitions. [2019-12-18 16:49:33,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:49:33,582 INFO L276 IsEmpty]: Start isEmpty. Operand 10382 states and 32866 transitions. [2019-12-18 16:49:33,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:49:33,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:33,599 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:49:33,600 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 16:49:33,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:33,600 INFO L82 PathProgramCache]: Analyzing trace with hash -2098893209, now seen corresponding path program 3 times [2019-12-18 16:49:33,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:33,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269039748] [2019-12-18 16:49:33,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:33,731 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 16:49:33,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269039748] [2019-12-18 16:49:33,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:33,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:49:33,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473325071] [2019-12-18 16:49:33,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:49:33,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:33,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:49:33,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:49:33,733 INFO L87 Difference]: Start difference. First operand 10382 states and 32866 transitions. Second operand 9 states. [2019-12-18 16:49:35,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:35,139 INFO L93 Difference]: Finished difference Result 36233 states and 111090 transitions. [2019-12-18 16:49:35,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 16:49:35,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 16:49:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:35,197 INFO L225 Difference]: With dead ends: 36233 [2019-12-18 16:49:35,197 INFO L226 Difference]: Without dead ends: 32009 [2019-12-18 16:49:35,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-18 16:49:35,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32009 states. [2019-12-18 16:49:35,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32009 to 10214. [2019-12-18 16:49:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10214 states. [2019-12-18 16:49:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10214 states to 10214 states and 32290 transitions. [2019-12-18 16:49:35,491 INFO L78 Accepts]: Start accepts. Automaton has 10214 states and 32290 transitions. Word has length 64 [2019-12-18 16:49:35,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:35,491 INFO L462 AbstractCegarLoop]: Abstraction has 10214 states and 32290 transitions. [2019-12-18 16:49:35,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:49:35,492 INFO L276 IsEmpty]: Start isEmpty. Operand 10214 states and 32290 transitions. [2019-12-18 16:49:35,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:49:35,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:35,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:49:35,507 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 16:49:35,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:35,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1900940369, now seen corresponding path program 1 times [2019-12-18 16:49:35,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:35,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190335021] [2019-12-18 16:49:35,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:35,561 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 16:49:35,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190335021] [2019-12-18 16:49:35,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:35,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:49:35,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441631008] [2019-12-18 16:49:35,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:49:35,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:35,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:49:35,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:49:35,563 INFO L87 Difference]: Start difference. First operand 10214 states and 32290 transitions. Second operand 3 states. [2019-12-18 16:49:35,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:35,647 INFO L93 Difference]: Finished difference Result 12867 states and 40113 transitions. [2019-12-18 16:49:35,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:49:35,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 16:49:35,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:35,672 INFO L225 Difference]: With dead ends: 12867 [2019-12-18 16:49:35,672 INFO L226 Difference]: Without dead ends: 12867 [2019-12-18 16:49:35,672 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 16:49:35,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12867 states. [2019-12-18 16:49:35,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12867 to 10671. [2019-12-18 16:49:35,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10671 states. [2019-12-18 16:49:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10671 states to 10671 states and 33392 transitions. [2019-12-18 16:49:35,946 INFO L78 Accepts]: Start accepts. Automaton has 10671 states and 33392 transitions. Word has length 64 [2019-12-18 16:49:35,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:35,946 INFO L462 AbstractCegarLoop]: Abstraction has 10671 states and 33392 transitions. [2019-12-18 16:49:35,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:49:35,947 INFO L276 IsEmpty]: Start isEmpty. Operand 10671 states and 33392 transitions. [2019-12-18 16:49:35,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:49:35,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:35,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:49:35,965 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 16:49:35,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:35,965 INFO L82 PathProgramCache]: Analyzing trace with hash -612356637, now seen corresponding path program 4 times [2019-12-18 16:49:35,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:35,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608249592] [2019-12-18 16:49:35,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:36,093 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 16:49:36,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608249592] [2019-12-18 16:49:36,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:36,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:49:36,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642931091] [2019-12-18 16:49:36,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:49:36,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:36,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:49:36,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:49:36,096 INFO L87 Difference]: Start difference. First operand 10671 states and 33392 transitions. Second operand 9 states. [2019-12-18 16:49:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:37,106 INFO L93 Difference]: Finished difference Result 28791 states and 88355 transitions. [2019-12-18 16:49:37,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:49:37,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 16:49:37,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:37,143 INFO L225 Difference]: With dead ends: 28791 [2019-12-18 16:49:37,144 INFO L226 Difference]: Without dead ends: 26476 [2019-12-18 16:49:37,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 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 16:49:37,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26476 states. [2019-12-18 16:49:37,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26476 to 10699. [2019-12-18 16:49:37,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10699 states. [2019-12-18 16:49:37,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10699 states to 10699 states and 33546 transitions. [2019-12-18 16:49:37,408 INFO L78 Accepts]: Start accepts. Automaton has 10699 states and 33546 transitions. Word has length 64 [2019-12-18 16:49:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:37,408 INFO L462 AbstractCegarLoop]: Abstraction has 10699 states and 33546 transitions. [2019-12-18 16:49:37,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:49:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 10699 states and 33546 transitions. [2019-12-18 16:49:37,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:49:37,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:37,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:49:37,422 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 16:49:37,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:37,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1413769055, now seen corresponding path program 5 times [2019-12-18 16:49:37,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:37,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591766298] [2019-12-18 16:49:37,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:37,507 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 16:49:37,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591766298] [2019-12-18 16:49:37,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:37,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:49:37,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177484245] [2019-12-18 16:49:37,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:49:37,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:37,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:49:37,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:49:37,509 INFO L87 Difference]: Start difference. First operand 10699 states and 33546 transitions. Second operand 3 states. [2019-12-18 16:49:37,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:37,549 INFO L93 Difference]: Finished difference Result 8548 states and 26013 transitions. [2019-12-18 16:49:37,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:49:37,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 16:49:37,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:37,560 INFO L225 Difference]: With dead ends: 8548 [2019-12-18 16:49:37,560 INFO L226 Difference]: Without dead ends: 8548 [2019-12-18 16:49:37,561 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 16:49:37,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8548 states. [2019-12-18 16:49:37,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8548 to 8548. [2019-12-18 16:49:37,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8548 states. [2019-12-18 16:49:37,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8548 states to 8548 states and 26013 transitions. [2019-12-18 16:49:37,690 INFO L78 Accepts]: Start accepts. Automaton has 8548 states and 26013 transitions. Word has length 64 [2019-12-18 16:49:37,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:37,690 INFO L462 AbstractCegarLoop]: Abstraction has 8548 states and 26013 transitions. [2019-12-18 16:49:37,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:49:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 8548 states and 26013 transitions. [2019-12-18 16:49:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:49:37,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:37,699 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 16:49:37,699 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 16:49:37,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:37,700 INFO L82 PathProgramCache]: Analyzing trace with hash 950504329, now seen corresponding path program 1 times [2019-12-18 16:49:37,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:37,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730879256] [2019-12-18 16:49:37,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:37,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:37,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730879256] [2019-12-18 16:49:37,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:37,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:49:37,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666608849] [2019-12-18 16:49:37,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:49:37,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:37,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:49:37,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:49:37,796 INFO L87 Difference]: Start difference. First operand 8548 states and 26013 transitions. Second operand 8 states. [2019-12-18 16:49:38,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:38,569 INFO L93 Difference]: Finished difference Result 15106 states and 45404 transitions. [2019-12-18 16:49:38,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 16:49:38,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 16:49:38,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:38,586 INFO L225 Difference]: With dead ends: 15106 [2019-12-18 16:49:38,586 INFO L226 Difference]: Without dead ends: 11359 [2019-12-18 16:49:38,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:49:38,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11359 states. [2019-12-18 16:49:38,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11359 to 9012. [2019-12-18 16:49:38,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9012 states. [2019-12-18 16:49:38,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9012 states to 9012 states and 27166 transitions. [2019-12-18 16:49:38,908 INFO L78 Accepts]: Start accepts. Automaton has 9012 states and 27166 transitions. Word has length 65 [2019-12-18 16:49:38,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:38,908 INFO L462 AbstractCegarLoop]: Abstraction has 9012 states and 27166 transitions. [2019-12-18 16:49:38,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:49:38,908 INFO L276 IsEmpty]: Start isEmpty. Operand 9012 states and 27166 transitions. [2019-12-18 16:49:38,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:49:38,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:38,917 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 16:49:38,917 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 16:49:38,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:38,917 INFO L82 PathProgramCache]: Analyzing trace with hash 406915929, now seen corresponding path program 2 times [2019-12-18 16:49:38,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:38,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426987947] [2019-12-18 16:49:38,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:39,030 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 16:49:39,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426987947] [2019-12-18 16:49:39,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:39,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:49:39,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707168948] [2019-12-18 16:49:39,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:49:39,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:39,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:49:39,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:49:39,033 INFO L87 Difference]: Start difference. First operand 9012 states and 27166 transitions. Second operand 9 states. [2019-12-18 16:49:40,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:40,046 INFO L93 Difference]: Finished difference Result 14370 states and 42744 transitions. [2019-12-18 16:49:40,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 16:49:40,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 16:49:40,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:40,072 INFO L225 Difference]: With dead ends: 14370 [2019-12-18 16:49:40,073 INFO L226 Difference]: Without dead ends: 11039 [2019-12-18 16:49:40,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 16:49:40,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11039 states. [2019-12-18 16:49:40,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11039 to 8852. [2019-12-18 16:49:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8852 states. [2019-12-18 16:49:40,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8852 states to 8852 states and 26638 transitions. [2019-12-18 16:49:40,305 INFO L78 Accepts]: Start accepts. Automaton has 8852 states and 26638 transitions. Word has length 65 [2019-12-18 16:49:40,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:40,305 INFO L462 AbstractCegarLoop]: Abstraction has 8852 states and 26638 transitions. [2019-12-18 16:49:40,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:49:40,305 INFO L276 IsEmpty]: Start isEmpty. Operand 8852 states and 26638 transitions. [2019-12-18 16:49:40,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:49:40,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:40,319 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 16:49:40,319 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 16:49:40,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:40,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1792236963, now seen corresponding path program 3 times [2019-12-18 16:49:40,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:40,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636948427] [2019-12-18 16:49:40,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:40,495 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 16:49:40,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636948427] [2019-12-18 16:49:40,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:40,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:49:40,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360539534] [2019-12-18 16:49:40,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:49:40,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:40,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:49:40,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:49:40,497 INFO L87 Difference]: Start difference. First operand 8852 states and 26638 transitions. Second operand 10 states. [2019-12-18 16:49:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:42,144 INFO L93 Difference]: Finished difference Result 18176 states and 53149 transitions. [2019-12-18 16:49:42,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 16:49:42,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-18 16:49:42,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:42,169 INFO L225 Difference]: With dead ends: 18176 [2019-12-18 16:49:42,170 INFO L226 Difference]: Without dead ends: 17936 [2019-12-18 16:49:42,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:49:42,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17936 states. [2019-12-18 16:49:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17936 to 13739. [2019-12-18 16:49:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13739 states. [2019-12-18 16:49:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13739 states to 13739 states and 40385 transitions. [2019-12-18 16:49:42,414 INFO L78 Accepts]: Start accepts. Automaton has 13739 states and 40385 transitions. Word has length 65 [2019-12-18 16:49:42,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:42,414 INFO L462 AbstractCegarLoop]: Abstraction has 13739 states and 40385 transitions. [2019-12-18 16:49:42,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:49:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 13739 states and 40385 transitions. [2019-12-18 16:49:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:49:42,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:42,429 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 16:49:42,429 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 16:49:42,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:42,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2042131627, now seen corresponding path program 4 times [2019-12-18 16:49:42,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:42,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407381022] [2019-12-18 16:49:42,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:42,539 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 16:49:42,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407381022] [2019-12-18 16:49:42,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:42,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:49:42,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127017690] [2019-12-18 16:49:42,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:49:42,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:42,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:49:42,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:49:42,541 INFO L87 Difference]: Start difference. First operand 13739 states and 40385 transitions. Second operand 7 states. [2019-12-18 16:49:43,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:43,318 INFO L93 Difference]: Finished difference Result 24335 states and 69905 transitions. [2019-12-18 16:49:43,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 16:49:43,318 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 16:49:43,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:43,351 INFO L225 Difference]: With dead ends: 24335 [2019-12-18 16:49:43,351 INFO L226 Difference]: Without dead ends: 24167 [2019-12-18 16:49:43,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:49:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24167 states. [2019-12-18 16:49:43,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24167 to 16933. [2019-12-18 16:49:43,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16933 states. [2019-12-18 16:49:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16933 states to 16933 states and 49369 transitions. [2019-12-18 16:49:43,658 INFO L78 Accepts]: Start accepts. Automaton has 16933 states and 49369 transitions. Word has length 65 [2019-12-18 16:49:43,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:43,658 INFO L462 AbstractCegarLoop]: Abstraction has 16933 states and 49369 transitions. [2019-12-18 16:49:43,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:49:43,658 INFO L276 IsEmpty]: Start isEmpty. Operand 16933 states and 49369 transitions. [2019-12-18 16:49:43,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:49:43,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:43,674 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 16:49:43,674 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 16:49:43,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:43,675 INFO L82 PathProgramCache]: Analyzing trace with hash -505523827, now seen corresponding path program 5 times [2019-12-18 16:49:43,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:43,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734989564] [2019-12-18 16:49:43,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:43,848 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 16:49:43,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734989564] [2019-12-18 16:49:43,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:43,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 16:49:43,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007107247] [2019-12-18 16:49:43,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:49:43,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:43,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:49:43,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:49:43,851 INFO L87 Difference]: Start difference. First operand 16933 states and 49369 transitions. Second operand 11 states. [2019-12-18 16:49:45,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:45,664 INFO L93 Difference]: Finished difference Result 23420 states and 67432 transitions. [2019-12-18 16:49:45,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 16:49:45,665 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 16:49:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:45,695 INFO L225 Difference]: With dead ends: 23420 [2019-12-18 16:49:45,696 INFO L226 Difference]: Without dead ends: 23420 [2019-12-18 16:49:45,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-12-18 16:49:45,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23420 states. [2019-12-18 16:49:45,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23420 to 17005. [2019-12-18 16:49:45,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17005 states. [2019-12-18 16:49:45,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17005 states to 17005 states and 49569 transitions. [2019-12-18 16:49:45,981 INFO L78 Accepts]: Start accepts. Automaton has 17005 states and 49569 transitions. Word has length 65 [2019-12-18 16:49:45,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:45,981 INFO L462 AbstractCegarLoop]: Abstraction has 17005 states and 49569 transitions. [2019-12-18 16:49:45,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:49:45,981 INFO L276 IsEmpty]: Start isEmpty. Operand 17005 states and 49569 transitions. [2019-12-18 16:49:45,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:49:45,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:45,998 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 16:49:45,998 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 16:49:45,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:45,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1882026893, now seen corresponding path program 6 times [2019-12-18 16:49:45,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:45,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998890191] [2019-12-18 16:49:45,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:46,156 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 16:49:46,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998890191] [2019-12-18 16:49:46,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:46,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 16:49:46,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037713625] [2019-12-18 16:49:46,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:49:46,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:46,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:49:46,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:49:46,159 INFO L87 Difference]: Start difference. First operand 17005 states and 49569 transitions. Second operand 11 states. [2019-12-18 16:49:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:48,498 INFO L93 Difference]: Finished difference Result 23888 states and 68662 transitions. [2019-12-18 16:49:48,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:49:48,498 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 16:49:48,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:48,528 INFO L225 Difference]: With dead ends: 23888 [2019-12-18 16:49:48,528 INFO L226 Difference]: Without dead ends: 23888 [2019-12-18 16:49:48,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2019-12-18 16:49:48,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23888 states. [2019-12-18 16:49:48,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23888 to 16165. [2019-12-18 16:49:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16165 states. [2019-12-18 16:49:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16165 states to 16165 states and 47247 transitions. [2019-12-18 16:49:48,810 INFO L78 Accepts]: Start accepts. Automaton has 16165 states and 47247 transitions. Word has length 65 [2019-12-18 16:49:48,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:48,810 INFO L462 AbstractCegarLoop]: Abstraction has 16165 states and 47247 transitions. [2019-12-18 16:49:48,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:49:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 16165 states and 47247 transitions. [2019-12-18 16:49:48,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:49:48,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:48,827 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 16:49:48,827 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 16:49:48,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:48,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1887248817, now seen corresponding path program 7 times [2019-12-18 16:49:48,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:48,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874660548] [2019-12-18 16:49:48,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:48,916 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 16:49:48,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874660548] [2019-12-18 16:49:48,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:48,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:49:48,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853098860] [2019-12-18 16:49:48,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:49:48,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:48,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:49:48,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:49:48,919 INFO L87 Difference]: Start difference. First operand 16165 states and 47247 transitions. Second operand 5 states. [2019-12-18 16:49:49,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:49,294 INFO L93 Difference]: Finished difference Result 18069 states and 52531 transitions. [2019-12-18 16:49:49,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:49:49,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 16:49:49,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:49,318 INFO L225 Difference]: With dead ends: 18069 [2019-12-18 16:49:49,318 INFO L226 Difference]: Without dead ends: 18069 [2019-12-18 16:49:49,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:49:49,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18069 states. [2019-12-18 16:49:49,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18069 to 16852. [2019-12-18 16:49:49,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16852 states. [2019-12-18 16:49:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16852 states to 16852 states and 49238 transitions. [2019-12-18 16:49:49,562 INFO L78 Accepts]: Start accepts. Automaton has 16852 states and 49238 transitions. Word has length 65 [2019-12-18 16:49:49,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:49,563 INFO L462 AbstractCegarLoop]: Abstraction has 16852 states and 49238 transitions. [2019-12-18 16:49:49,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:49:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 16852 states and 49238 transitions. [2019-12-18 16:49:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:49:49,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:49,579 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 16:49:49,580 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 16:49:49,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:49,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1895624641, now seen corresponding path program 8 times [2019-12-18 16:49:49,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:49,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927472619] [2019-12-18 16:49:49,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:49,927 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 16:49:49,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927472619] [2019-12-18 16:49:49,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:49,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:49:49,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709560257] [2019-12-18 16:49:49,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:49:49,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:49,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:49:49,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:49:49,930 INFO L87 Difference]: Start difference. First operand 16852 states and 49238 transitions. Second operand 3 states. [2019-12-18 16:49:49,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:49,997 INFO L93 Difference]: Finished difference Result 16852 states and 49237 transitions. [2019-12-18 16:49:49,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:49:49,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 16:49:49,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:50,024 INFO L225 Difference]: With dead ends: 16852 [2019-12-18 16:49:50,025 INFO L226 Difference]: Without dead ends: 16852 [2019-12-18 16:49:50,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:49:50,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16852 states. [2019-12-18 16:49:50,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16852 to 15231. [2019-12-18 16:49:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15231 states. [2019-12-18 16:49:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15231 states to 15231 states and 44738 transitions. [2019-12-18 16:49:50,262 INFO L78 Accepts]: Start accepts. Automaton has 15231 states and 44738 transitions. Word has length 65 [2019-12-18 16:49:50,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:50,264 INFO L462 AbstractCegarLoop]: Abstraction has 15231 states and 44738 transitions. [2019-12-18 16:49:50,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:49:50,264 INFO L276 IsEmpty]: Start isEmpty. Operand 15231 states and 44738 transitions. [2019-12-18 16:49:50,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:49:50,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:50,281 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 16:49:50,281 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 16:49:50,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:50,281 INFO L82 PathProgramCache]: Analyzing trace with hash 312790614, now seen corresponding path program 1 times [2019-12-18 16:49:50,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:50,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120546318] [2019-12-18 16:49:50,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:50,557 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 16:49:50,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120546318] [2019-12-18 16:49:50,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:50,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 16:49:50,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968653003] [2019-12-18 16:49:50,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 16:49:50,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:50,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 16:49:50,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:49:50,558 INFO L87 Difference]: Start difference. First operand 15231 states and 44738 transitions. Second operand 13 states. [2019-12-18 16:49:51,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:51,900 INFO L93 Difference]: Finished difference Result 20317 states and 59022 transitions. [2019-12-18 16:49:51,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 16:49:51,900 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-18 16:49:51,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:51,925 INFO L225 Difference]: With dead ends: 20317 [2019-12-18 16:49:51,925 INFO L226 Difference]: Without dead ends: 17095 [2019-12-18 16:49:51,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-12-18 16:49:51,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17095 states. [2019-12-18 16:49:52,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17095 to 15476. [2019-12-18 16:49:52,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15476 states. [2019-12-18 16:49:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15476 states to 15476 states and 45307 transitions. [2019-12-18 16:49:52,158 INFO L78 Accepts]: Start accepts. Automaton has 15476 states and 45307 transitions. Word has length 66 [2019-12-18 16:49:52,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:52,158 INFO L462 AbstractCegarLoop]: Abstraction has 15476 states and 45307 transitions. [2019-12-18 16:49:52,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 16:49:52,158 INFO L276 IsEmpty]: Start isEmpty. Operand 15476 states and 45307 transitions. [2019-12-18 16:49:52,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:49:52,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:52,173 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 16:49:52,173 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 16:49:52,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:52,174 INFO L82 PathProgramCache]: Analyzing trace with hash -667839678, now seen corresponding path program 2 times [2019-12-18 16:49:52,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:52,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39398490] [2019-12-18 16:49:52,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:52,879 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 16:49:52,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39398490] [2019-12-18 16:49:52,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:52,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 16:49:52,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510258587] [2019-12-18 16:49:52,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 16:49:52,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:52,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 16:49:52,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:49:52,881 INFO L87 Difference]: Start difference. First operand 15476 states and 45307 transitions. Second operand 17 states. [2019-12-18 16:49:55,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:55,858 INFO L93 Difference]: Finished difference Result 19024 states and 54892 transitions. [2019-12-18 16:49:55,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 16:49:55,859 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-18 16:49:55,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:55,884 INFO L225 Difference]: With dead ends: 19024 [2019-12-18 16:49:55,884 INFO L226 Difference]: Without dead ends: 17927 [2019-12-18 16:49:55,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 16:49:55,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17927 states. [2019-12-18 16:49:56,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17927 to 15570. [2019-12-18 16:49:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15570 states. [2019-12-18 16:49:56,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15570 states to 15570 states and 45550 transitions. [2019-12-18 16:49:56,121 INFO L78 Accepts]: Start accepts. Automaton has 15570 states and 45550 transitions. Word has length 66 [2019-12-18 16:49:56,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:56,121 INFO L462 AbstractCegarLoop]: Abstraction has 15570 states and 45550 transitions. [2019-12-18 16:49:56,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 16:49:56,121 INFO L276 IsEmpty]: Start isEmpty. Operand 15570 states and 45550 transitions. [2019-12-18 16:49:56,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:49:56,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:56,388 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 16:49:56,388 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:49:56,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:56,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1174328030, now seen corresponding path program 3 times [2019-12-18 16:49:56,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:56,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578702925] [2019-12-18 16:49:56,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:57,138 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 16:49:57,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578702925] [2019-12-18 16:49:57,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:57,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 16:49:57,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899462572] [2019-12-18 16:49:57,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 16:49:57,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:57,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 16:49:57,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:49:57,140 INFO L87 Difference]: Start difference. First operand 15570 states and 45550 transitions. Second operand 17 states. [2019-12-18 16:50:00,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:00,123 INFO L93 Difference]: Finished difference Result 18961 states and 54615 transitions. [2019-12-18 16:50:00,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 16:50:00,123 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-18 16:50:00,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:00,148 INFO L225 Difference]: With dead ends: 18961 [2019-12-18 16:50:00,148 INFO L226 Difference]: Without dead ends: 18014 [2019-12-18 16:50:00,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2019-12-18 16:50:00,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18014 states. [2019-12-18 16:50:00,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18014 to 15580. [2019-12-18 16:50:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15580 states. [2019-12-18 16:50:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15580 states to 15580 states and 45547 transitions. [2019-12-18 16:50:00,391 INFO L78 Accepts]: Start accepts. Automaton has 15580 states and 45547 transitions. Word has length 66 [2019-12-18 16:50:00,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:00,391 INFO L462 AbstractCegarLoop]: Abstraction has 15580 states and 45547 transitions. [2019-12-18 16:50:00,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 16:50:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 15580 states and 45547 transitions. [2019-12-18 16:50:00,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:50:00,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:00,409 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 16:50:00,409 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:00,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:00,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1049115094, now seen corresponding path program 4 times [2019-12-18 16:50:00,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:00,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109841354] [2019-12-18 16:50:00,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:01,000 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 16:50:01,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109841354] [2019-12-18 16:50:01,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:01,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 16:50:01,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001674902] [2019-12-18 16:50:01,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 16:50:01,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:01,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 16:50:01,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-12-18 16:50:01,002 INFO L87 Difference]: Start difference. First operand 15580 states and 45547 transitions. Second operand 19 states. [2019-12-18 16:50:04,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:04,412 INFO L93 Difference]: Finished difference Result 22539 states and 65171 transitions. [2019-12-18 16:50:04,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 16:50:04,412 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-12-18 16:50:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:04,441 INFO L225 Difference]: With dead ends: 22539 [2019-12-18 16:50:04,442 INFO L226 Difference]: Without dead ends: 21890 [2019-12-18 16:50:04,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=186, Invalid=1146, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 16:50:04,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21890 states. [2019-12-18 16:50:04,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21890 to 15626. [2019-12-18 16:50:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15626 states. [2019-12-18 16:50:04,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15626 states to 15626 states and 45650 transitions. [2019-12-18 16:50:04,934 INFO L78 Accepts]: Start accepts. Automaton has 15626 states and 45650 transitions. Word has length 66 [2019-12-18 16:50:04,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:04,934 INFO L462 AbstractCegarLoop]: Abstraction has 15626 states and 45650 transitions. [2019-12-18 16:50:04,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 16:50:04,934 INFO L276 IsEmpty]: Start isEmpty. Operand 15626 states and 45650 transitions. [2019-12-18 16:50:04,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:50:04,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:04,950 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 16:50:04,950 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:04,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:04,951 INFO L82 PathProgramCache]: Analyzing trace with hash 411152318, now seen corresponding path program 5 times [2019-12-18 16:50:04,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:04,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425815296] [2019-12-18 16:50:04,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:05,258 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 16:50:05,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425815296] [2019-12-18 16:50:05,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:05,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 16:50:05,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939611566] [2019-12-18 16:50:05,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 16:50:05,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:05,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 16:50:05,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:50:05,259 INFO L87 Difference]: Start difference. First operand 15626 states and 45650 transitions. Second operand 14 states. [2019-12-18 16:50:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:07,017 INFO L93 Difference]: Finished difference Result 18853 states and 54353 transitions. [2019-12-18 16:50:07,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 16:50:07,018 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-18 16:50:07,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:07,041 INFO L225 Difference]: With dead ends: 18853 [2019-12-18 16:50:07,041 INFO L226 Difference]: Without dead ends: 17936 [2019-12-18 16:50:07,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=773, Unknown=0, NotChecked=0, Total=930 [2019-12-18 16:50:07,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17936 states. [2019-12-18 16:50:07,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17936 to 15644. [2019-12-18 16:50:07,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15644 states. [2019-12-18 16:50:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15644 states to 15644 states and 45708 transitions. [2019-12-18 16:50:07,260 INFO L78 Accepts]: Start accepts. Automaton has 15644 states and 45708 transitions. Word has length 66 [2019-12-18 16:50:07,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:07,261 INFO L462 AbstractCegarLoop]: Abstraction has 15644 states and 45708 transitions. [2019-12-18 16:50:07,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 16:50:07,261 INFO L276 IsEmpty]: Start isEmpty. Operand 15644 states and 45708 transitions. [2019-12-18 16:50:07,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:50:07,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:07,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 16:50:07,276 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:07,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:07,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1321821776, now seen corresponding path program 6 times [2019-12-18 16:50:07,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:07,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730300211] [2019-12-18 16:50:07,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:07,849 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 16:50:07,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730300211] [2019-12-18 16:50:07,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:07,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 16:50:07,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264602018] [2019-12-18 16:50:07,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 16:50:07,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:07,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 16:50:07,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:50:07,851 INFO L87 Difference]: Start difference. First operand 15644 states and 45708 transitions. Second operand 15 states. [2019-12-18 16:50:10,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:10,041 INFO L93 Difference]: Finished difference Result 19825 states and 57129 transitions. [2019-12-18 16:50:10,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 16:50:10,042 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-18 16:50:10,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:10,068 INFO L225 Difference]: With dead ends: 19825 [2019-12-18 16:50:10,068 INFO L226 Difference]: Without dead ends: 17106 [2019-12-18 16:50:10,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=272, Invalid=1210, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 16:50:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17106 states. [2019-12-18 16:50:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17106 to 14975. [2019-12-18 16:50:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14975 states. [2019-12-18 16:50:10,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14975 states to 14975 states and 43679 transitions. [2019-12-18 16:50:10,311 INFO L78 Accepts]: Start accepts. Automaton has 14975 states and 43679 transitions. Word has length 66 [2019-12-18 16:50:10,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:10,311 INFO L462 AbstractCegarLoop]: Abstraction has 14975 states and 43679 transitions. [2019-12-18 16:50:10,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 16:50:10,311 INFO L276 IsEmpty]: Start isEmpty. Operand 14975 states and 43679 transitions. [2019-12-18 16:50:10,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:50:10,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:10,327 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 16:50:10,327 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:10,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:10,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1396999358, now seen corresponding path program 7 times [2019-12-18 16:50:10,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:10,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054073189] [2019-12-18 16:50:10,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:10,552 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 16:50:10,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054073189] [2019-12-18 16:50:10,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:10,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:50:10,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634618239] [2019-12-18 16:50:10,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:50:10,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:10,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:50:10,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:50:10,556 INFO L87 Difference]: Start difference. First operand 14975 states and 43679 transitions. Second operand 11 states. [2019-12-18 16:50:11,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:11,738 INFO L93 Difference]: Finished difference Result 24499 states and 70901 transitions. [2019-12-18 16:50:11,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 16:50:11,739 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 16:50:11,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:11,763 INFO L225 Difference]: With dead ends: 24499 [2019-12-18 16:50:11,763 INFO L226 Difference]: Without dead ends: 17637 [2019-12-18 16:50:11,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2019-12-18 16:50:11,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17637 states. [2019-12-18 16:50:11,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17637 to 14082. [2019-12-18 16:50:11,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14082 states. [2019-12-18 16:50:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14082 states to 14082 states and 41283 transitions. [2019-12-18 16:50:12,003 INFO L78 Accepts]: Start accepts. Automaton has 14082 states and 41283 transitions. Word has length 66 [2019-12-18 16:50:12,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:12,003 INFO L462 AbstractCegarLoop]: Abstraction has 14082 states and 41283 transitions. [2019-12-18 16:50:12,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:50:12,003 INFO L276 IsEmpty]: Start isEmpty. Operand 14082 states and 41283 transitions. [2019-12-18 16:50:12,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:50:12,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:12,021 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 16:50:12,021 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:12,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:12,021 INFO L82 PathProgramCache]: Analyzing trace with hash 777925054, now seen corresponding path program 8 times [2019-12-18 16:50:12,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:12,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493676653] [2019-12-18 16:50:12,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:12,180 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 16:50:12,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493676653] [2019-12-18 16:50:12,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:12,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:50:12,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543344694] [2019-12-18 16:50:12,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:50:12,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:12,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:50:12,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:50:12,185 INFO L87 Difference]: Start difference. First operand 14082 states and 41283 transitions. Second operand 10 states. [2019-12-18 16:50:14,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:14,429 INFO L93 Difference]: Finished difference Result 28744 states and 82215 transitions. [2019-12-18 16:50:14,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 16:50:14,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 16:50:14,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:14,467 INFO L225 Difference]: With dead ends: 28744 [2019-12-18 16:50:14,468 INFO L226 Difference]: Without dead ends: 28336 [2019-12-18 16:50:14,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2019-12-18 16:50:14,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28336 states. [2019-12-18 16:50:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28336 to 13334. [2019-12-18 16:50:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13334 states. [2019-12-18 16:50:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13334 states to 13334 states and 39227 transitions. [2019-12-18 16:50:14,752 INFO L78 Accepts]: Start accepts. Automaton has 13334 states and 39227 transitions. Word has length 66 [2019-12-18 16:50:14,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:14,752 INFO L462 AbstractCegarLoop]: Abstraction has 13334 states and 39227 transitions. [2019-12-18 16:50:14,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:50:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 13334 states and 39227 transitions. [2019-12-18 16:50:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:50:14,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:14,766 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 16:50:14,766 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:14,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:14,767 INFO L82 PathProgramCache]: Analyzing trace with hash -124195356, now seen corresponding path program 9 times [2019-12-18 16:50:14,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:14,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564361207] [2019-12-18 16:50:14,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:14,839 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 16:50:14,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564361207] [2019-12-18 16:50:14,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:14,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:50:14,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421107121] [2019-12-18 16:50:14,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:50:14,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:14,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:50:14,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:50:14,841 INFO L87 Difference]: Start difference. First operand 13334 states and 39227 transitions. Second operand 3 states. [2019-12-18 16:50:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:14,939 INFO L93 Difference]: Finished difference Result 15362 states and 45390 transitions. [2019-12-18 16:50:14,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:50:14,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 16:50:14,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:14,960 INFO L225 Difference]: With dead ends: 15362 [2019-12-18 16:50:14,960 INFO L226 Difference]: Without dead ends: 15362 [2019-12-18 16:50:14,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:50:15,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15362 states. [2019-12-18 16:50:15,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15362 to 12256. [2019-12-18 16:50:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12256 states. [2019-12-18 16:50:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12256 states to 12256 states and 36410 transitions. [2019-12-18 16:50:15,160 INFO L78 Accepts]: Start accepts. Automaton has 12256 states and 36410 transitions. Word has length 66 [2019-12-18 16:50:15,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:15,160 INFO L462 AbstractCegarLoop]: Abstraction has 12256 states and 36410 transitions. [2019-12-18 16:50:15,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:50:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 12256 states and 36410 transitions. [2019-12-18 16:50:15,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:50:15,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:15,173 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 16:50:15,173 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:15,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:15,173 INFO L82 PathProgramCache]: Analyzing trace with hash 8609018, now seen corresponding path program 1 times [2019-12-18 16:50:15,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:15,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088193193] [2019-12-18 16:50:15,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:15,522 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 16:50:15,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088193193] [2019-12-18 16:50:15,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:15,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 16:50:15,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825081283] [2019-12-18 16:50:15,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 16:50:15,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:15,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 16:50:15,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:50:15,523 INFO L87 Difference]: Start difference. First operand 12256 states and 36410 transitions. Second operand 14 states. [2019-12-18 16:50:16,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:16,998 INFO L93 Difference]: Finished difference Result 13711 states and 40123 transitions. [2019-12-18 16:50:16,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:50:16,998 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-18 16:50:16,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:17,020 INFO L225 Difference]: With dead ends: 13711 [2019-12-18 16:50:17,021 INFO L226 Difference]: Without dead ends: 13290 [2019-12-18 16:50:17,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2019-12-18 16:50:17,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13290 states. [2019-12-18 16:50:17,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13290 to 12002. [2019-12-18 16:50:17,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12002 states. [2019-12-18 16:50:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12002 states to 12002 states and 35762 transitions. [2019-12-18 16:50:17,218 INFO L78 Accepts]: Start accepts. Automaton has 12002 states and 35762 transitions. Word has length 67 [2019-12-18 16:50:17,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:17,219 INFO L462 AbstractCegarLoop]: Abstraction has 12002 states and 35762 transitions. [2019-12-18 16:50:17,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 16:50:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 12002 states and 35762 transitions. [2019-12-18 16:50:17,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:50:17,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:17,232 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 16:50:17,232 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:17,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:17,233 INFO L82 PathProgramCache]: Analyzing trace with hash -919262302, now seen corresponding path program 2 times [2019-12-18 16:50:17,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:17,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116868931] [2019-12-18 16:50:17,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:50:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:50:17,586 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:50:17,587 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:50:17,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_266) (= 0 v_~__unbuffered_p2_EAX~0_32) (= 0 v_~weak$$choice0~0_14) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t633~0.base_24| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t633~0.base_24|) |v_ULTIMATE.start_main_~#t633~0.offset_19| 0)) |v_#memory_int_21|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t633~0.base_24|)) (= |v_#NULL.offset_6| 0) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t633~0.base_24| 1)) (= 0 v_~a$w_buff0_used~0_826) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~a$r_buff0_thd2~0_102) (< 0 |v_#StackHeapBarrier_17|) (= v_~a$r_buff0_thd0~0_110 0) (= v_~__unbuffered_cnt~0_102 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t633~0.base_24|) (= v_~main$tmp_guard1~0_29 0) (= v_~a$w_buff0~0_397 0) (= v_~a$flush_delayed~0_27 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t633~0.base_24| 4)) (= 0 |v_#NULL.base_6|) (= v_~y~0_39 0) (= v_~a$mem_tmp~0_16 0) (= v_~__unbuffered_p2_EBX~0_42 0) (= 0 v_~a$r_buff1_thd1~0_142) (= v_~a~0_178 0) (= v_~weak$$choice2~0_137 0) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~z~0_40 0) (= 0 v_~a$w_buff1_used~0_523) (= 0 v_~a$r_buff1_thd2~0_138) (= v_~a$r_buff1_thd3~0_297 0) (= v_~a$r_buff0_thd3~0_334 0) (= v_~a$r_buff1_thd0~0_145 0) (= v_~__unbuffered_p0_EBX~0_105 0) (= 0 v_~a$r_buff0_thd1~0_183) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6) (= |v_ULTIMATE.start_main_~#t633~0.offset_19| 0) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_138, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_47|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_110, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_137|, ~a~0=v_~a~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, ULTIMATE.start_main_~#t635~0.offset=|v_ULTIMATE.start_main_~#t635~0.offset_20|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_105, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_297, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_826, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_183, ULTIMATE.start_main_~#t635~0.base=|v_ULTIMATE.start_main_~#t635~0.base_27|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t634~0.base=|v_ULTIMATE.start_main_~#t634~0.base_26|, ~a$w_buff0~0=v_~a$w_buff0~0_397, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_145, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_88, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_102, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_129|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~a$w_buff1~0=v_~a$w_buff1~0_266, ~y~0=v_~y~0_39, ULTIMATE.start_main_~#t633~0.base=|v_ULTIMATE.start_main_~#t633~0.base_24|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_29|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_142, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_334, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t634~0.offset=|v_ULTIMATE.start_main_~#t634~0.offset_19|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_40, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_523, ~weak$$choice2~0=v_~weak$$choice2~0_137, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t633~0.offset=|v_ULTIMATE.start_main_~#t633~0.offset_19|} AuxVars[] AssignedVars[~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, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t635~0.offset, ~__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_~#t635~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t634~0.base, ~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, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t633~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t634~0.offset, ~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, ULTIMATE.start_main_~#t633~0.offset] because there is no mapped edge [2019-12-18 16:50:17,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t634~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t634~0.offset_9|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t634~0.base_10| 4) |v_#length_17|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t634~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t634~0.base_10|) |v_ULTIMATE.start_main_~#t634~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t634~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t634~0.base_10| 0)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t634~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t634~0.base=|v_ULTIMATE.start_main_~#t634~0.base_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t634~0.offset=|v_ULTIMATE.start_main_~#t634~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t634~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t634~0.offset] because there is no mapped edge [2019-12-18 16:50:17,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L837-1-->L839: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t635~0.base_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t635~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t635~0.base_13|)) (= |v_ULTIMATE.start_main_~#t635~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t635~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t635~0.base_13|) |v_ULTIMATE.start_main_~#t635~0.offset_11| 2)) |v_#memory_int_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t635~0.base_13| 4) |v_#length_15|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t635~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t635~0.base=|v_ULTIMATE.start_main_~#t635~0.base_13|, ULTIMATE.start_main_~#t635~0.offset=|v_ULTIMATE.start_main_~#t635~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t635~0.base, ULTIMATE.start_main_~#t635~0.offset] because there is no mapped edge [2019-12-18 16:50:17,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_30 |v_P0Thread1of1ForFork1_#in~arg.offset_30|) (= v_~a$w_buff0_used~0_232 v_~a$w_buff1_used~0_149) (= 1 v_~a$w_buff0_used~0_231) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= v_~a$w_buff0~0_80 v_~a$w_buff1~0_62) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= 1 v_~a$w_buff0~0_79) (= |v_P0Thread1of1ForFork1_#in~arg.base_30| v_P0Thread1of1ForFork1_~arg.base_30) (= (mod v_~a$w_buff1_used~0_149 256) 0)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_80, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_232, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_62, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_79, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_231, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_30} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 16:50:17,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L776-2-->L776-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1926463504 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1926463504 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out1926463504| ~a$w_buff1~0_In1926463504)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out1926463504| ~a~0_In1926463504)))) InVars {~a~0=~a~0_In1926463504, ~a$w_buff1~0=~a$w_buff1~0_In1926463504, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1926463504, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1926463504} OutVars{~a~0=~a~0_In1926463504, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1926463504|, ~a$w_buff1~0=~a$w_buff1~0_In1926463504, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1926463504, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1926463504} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 16:50:17,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In188203493 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In188203493 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In188203493 |P0Thread1of1ForFork1_#t~ite5_Out188203493|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out188203493|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In188203493, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In188203493} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out188203493|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In188203493, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In188203493} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 16:50:17,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-409121305 256))) (.cse3 (= (mod ~a$r_buff1_thd1~0_In-409121305 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-409121305 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-409121305 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-409121305| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-409121305 |P0Thread1of1ForFork1_#t~ite6_Out-409121305|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-409121305, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-409121305, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-409121305, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-409121305} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-409121305|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-409121305, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-409121305, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-409121305, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-409121305} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 16:50:17,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L759-->L760: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1422157180 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-1422157180 256) 0))) (or (and (not .cse0) (= ~a$r_buff0_thd1~0_Out-1422157180 0) (not .cse1)) (and (= ~a$r_buff0_thd1~0_In-1422157180 ~a$r_buff0_thd1~0_Out-1422157180) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1422157180, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1422157180} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1422157180|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1422157180, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1422157180} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:50:17,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L760-->L760-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-1122712776 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-1122712776 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1122712776 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In-1122712776 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1122712776|)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite8_Out-1122712776| ~a$r_buff1_thd1~0_In-1122712776) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1122712776, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1122712776, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1122712776, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1122712776} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1122712776|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1122712776, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1122712776, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1122712776, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1122712776} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 16:50:17,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L760-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_80, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 16:50:17,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1947102898 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In-1947102898| |P2Thread1of1ForFork0_#t~ite20_Out-1947102898|) (not .cse0) (= ~a$w_buff0~0_In-1947102898 |P2Thread1of1ForFork0_#t~ite21_Out-1947102898|)) (and .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1947102898 256) 0))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In-1947102898 256) 0)) (and (= 0 (mod ~a$r_buff1_thd3~0_In-1947102898 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-1947102898 256)))) (= ~a$w_buff0~0_In-1947102898 |P2Thread1of1ForFork0_#t~ite20_Out-1947102898|) (= |P2Thread1of1ForFork0_#t~ite21_Out-1947102898| |P2Thread1of1ForFork0_#t~ite20_Out-1947102898|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-1947102898, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1947102898, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1947102898, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1947102898, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1947102898, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1947102898|, ~weak$$choice2~0=~weak$$choice2~0_In-1947102898} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1947102898|, ~a$w_buff0~0=~a$w_buff0~0_In-1947102898, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1947102898, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1947102898, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1947102898, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1947102898|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1947102898, ~weak$$choice2~0=~weak$$choice2~0_In-1947102898} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 16:50:17,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L803-->L803-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1953056533 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1953056533 256) 0))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In1953056533 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In1953056533 256)) (and (= (mod ~a$r_buff1_thd3~0_In1953056533 256) 0) .cse1))) (= |P2Thread1of1ForFork0_#t~ite26_Out1953056533| |P2Thread1of1ForFork0_#t~ite27_Out1953056533|) (= |P2Thread1of1ForFork0_#t~ite26_Out1953056533| ~a$w_buff0_used~0_In1953056533)) (and (= |P2Thread1of1ForFork0_#t~ite26_In1953056533| |P2Thread1of1ForFork0_#t~ite26_Out1953056533|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out1953056533| ~a$w_buff0_used~0_In1953056533)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1953056533|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1953056533, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1953056533, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1953056533, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1953056533, ~weak$$choice2~0=~weak$$choice2~0_In1953056533} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1953056533|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1953056533|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1953056533, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1953056533, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1953056533, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1953056533, ~weak$$choice2~0=~weak$$choice2~0_In1953056533} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 16:50:17,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L804-->L804-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1392205780 256) 0))) (or (and (= ~a$w_buff1_used~0_In-1392205780 |P2Thread1of1ForFork0_#t~ite29_Out-1392205780|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1392205780 256)))) (or (= (mod ~a$w_buff0_used~0_In-1392205780 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In-1392205780 256)) .cse1) (and (= 0 (mod ~a$w_buff1_used~0_In-1392205780 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite29_Out-1392205780| |P2Thread1of1ForFork0_#t~ite30_Out-1392205780|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite29_In-1392205780| |P2Thread1of1ForFork0_#t~ite29_Out-1392205780|) (= ~a$w_buff1_used~0_In-1392205780 |P2Thread1of1ForFork0_#t~ite30_Out-1392205780|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1392205780, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1392205780, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1392205780, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1392205780, ~weak$$choice2~0=~weak$$choice2~0_In-1392205780, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1392205780|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1392205780, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1392205780, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1392205780, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1392205780|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1392205780, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1392205780|, ~weak$$choice2~0=~weak$$choice2~0_In-1392205780} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 16:50:17,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L805-->L806: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 16:50:17,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_20| v_~a~0_46) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_20|} OutVars{~a~0=v_~a~0_46, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_19|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 16:50:17,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-114653715 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-114653715 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-114653715|)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-114653715| ~a$w_buff0_used~0_In-114653715) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-114653715, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-114653715} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-114653715, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-114653715, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-114653715|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 16:50:17,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1297771399 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1297771399 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-1297771399 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1297771399 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1297771399|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out-1297771399| ~a$w_buff1_used~0_In-1297771399)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1297771399, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1297771399, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1297771399, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1297771399} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1297771399, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1297771399, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1297771399, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1297771399|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1297771399} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 16:50:17,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-360062190 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-360062190 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-360062190|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In-360062190 |P1Thread1of1ForFork2_#t~ite13_Out-360062190|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-360062190, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-360062190} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-360062190, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-360062190, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-360062190|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 16:50:17,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd2~0_In1997642515 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1997642515 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1997642515 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In1997642515 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out1997642515| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork2_#t~ite14_Out1997642515| ~a$r_buff1_thd2~0_In1997642515) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1997642515, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1997642515, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1997642515, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1997642515} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1997642515, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1997642515, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1997642515, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1997642515, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1997642515|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 16:50:17,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_30| v_~a$r_buff1_thd2~0_61) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_30|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_61, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_29|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 16:50:17,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_8 0) (= v_~a~0_52 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_9 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_9} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_52, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 16:50:17,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L812-2-->L812-5: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In1390616060 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1390616060 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out1390616060| |P2Thread1of1ForFork0_#t~ite39_Out1390616060|))) (or (and (not .cse0) (not .cse1) .cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out1390616060| ~a$w_buff1~0_In1390616060)) (and (or .cse0 .cse1) .cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out1390616060| ~a~0_In1390616060)))) InVars {~a~0=~a~0_In1390616060, ~a$w_buff1~0=~a$w_buff1~0_In1390616060, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1390616060, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1390616060} OutVars{~a~0=~a~0_In1390616060, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1390616060|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1390616060|, ~a$w_buff1~0=~a$w_buff1~0_In1390616060, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1390616060, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1390616060} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 16:50:17,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1428194178 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1428194178 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1428194178| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1428194178| ~a$w_buff0_used~0_In-1428194178) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1428194178, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1428194178} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1428194178|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1428194178, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1428194178} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 16:50:17,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In-1473036969 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1473036969 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1473036969 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1473036969 256)))) (or (and (= ~a$w_buff1_used~0_In-1473036969 |P2Thread1of1ForFork0_#t~ite41_Out-1473036969|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1473036969|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1473036969, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1473036969, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1473036969, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1473036969} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1473036969, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1473036969, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1473036969, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1473036969, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1473036969|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 16:50:17,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1250408708 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1250408708 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1250408708| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-1250408708| ~a$r_buff0_thd3~0_In-1250408708)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1250408708, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1250408708} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1250408708, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1250408708, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1250408708|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 16:50:17,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In132020841 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In132020841 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In132020841 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In132020841 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out132020841|)) (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In132020841 |P2Thread1of1ForFork0_#t~ite43_Out132020841|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In132020841, ~a$w_buff0_used~0=~a$w_buff0_used~0_In132020841, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In132020841, ~a$w_buff1_used~0=~a$w_buff1_used~0_In132020841} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out132020841|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In132020841, ~a$w_buff0_used~0=~a$w_buff0_used~0_In132020841, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In132020841, ~a$w_buff1_used~0=~a$w_buff1_used~0_In132020841} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 16:50:17,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_127 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_59 (+ v_~__unbuffered_cnt~0_60 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 16:50:17,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 16:50:17,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L845-2-->L845-5: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In1490271130 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1490271130| |ULTIMATE.start_main_#t~ite48_Out1490271130|)) (.cse1 (= (mod ~a$w_buff1_used~0_In1490271130 256) 0))) (or (and .cse0 (= ~a~0_In1490271130 |ULTIMATE.start_main_#t~ite47_Out1490271130|) (or .cse1 .cse2)) (and (= ~a$w_buff1~0_In1490271130 |ULTIMATE.start_main_#t~ite47_Out1490271130|) (not .cse2) .cse0 (not .cse1)))) InVars {~a~0=~a~0_In1490271130, ~a$w_buff1~0=~a$w_buff1~0_In1490271130, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1490271130, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1490271130} OutVars{~a~0=~a~0_In1490271130, ~a$w_buff1~0=~a$w_buff1~0_In1490271130, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1490271130|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1490271130, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1490271130|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1490271130} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 16:50:17,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In1681056786 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1681056786 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1681056786| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite49_Out1681056786| ~a$w_buff0_used~0_In1681056786)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1681056786, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1681056786} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1681056786, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1681056786|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1681056786} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 16:50:17,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L847-->L847-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-702087663 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-702087663 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-702087663 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-702087663 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-702087663 |ULTIMATE.start_main_#t~ite50_Out-702087663|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-702087663|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-702087663, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-702087663, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-702087663, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-702087663} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-702087663|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-702087663, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-702087663, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-702087663, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-702087663} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 16:50:17,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1312493725 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1312493725 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1312493725|) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd0~0_In1312493725 |ULTIMATE.start_main_#t~ite51_Out1312493725|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1312493725, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1312493725} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1312493725|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1312493725, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1312493725} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 16:50:17,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L849-->L849-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd0~0_In-602152844 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-602152844 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-602152844 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-602152844 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-602152844|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~a$r_buff1_thd0~0_In-602152844 |ULTIMATE.start_main_#t~ite52_Out-602152844|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-602152844, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-602152844, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-602152844, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-602152844} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-602152844|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-602152844, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-602152844, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-602152844, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-602152844} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 16:50:17,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= 1 v_~__unbuffered_p0_EAX~0_40) (= 2 v_~__unbuffered_p2_EAX~0_20) (= |v_ULTIMATE.start_main_#t~ite52_35| v_~a$r_buff1_thd0~0_75) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~__unbuffered_p0_EBX~0_40 0) (= v_~z~0_25 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} 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 16:50:17,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:50:17 BasicIcfg [2019-12-18 16:50:17,718 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:50:17,722 INFO L168 Benchmark]: Toolchain (without parser) took 119140.34 ms. Allocated memory was 145.2 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 100.0 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 16:50:17,722 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 16:50:17,723 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.67 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.6 MB in the beginning and 154.1 MB in the end (delta: -54.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 16:50:17,723 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.16 ms. Allocated memory is still 202.4 MB. Free memory was 154.1 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:50:17,725 INFO L168 Benchmark]: Boogie Preprocessor took 40.18 ms. Allocated memory is still 202.4 MB. Free memory was 151.5 MB in the beginning and 149.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 16:50:17,725 INFO L168 Benchmark]: RCFGBuilder took 842.09 ms. Allocated memory is still 202.4 MB. Free memory was 148.8 MB in the beginning and 98.7 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-18 16:50:17,726 INFO L168 Benchmark]: TraceAbstraction took 117403.23 ms. Allocated memory was 202.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 98.0 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 16:50:17,731 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.67 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.6 MB in the beginning and 154.1 MB in the end (delta: -54.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.16 ms. Allocated memory is still 202.4 MB. Free memory was 154.1 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.18 ms. Allocated memory is still 202.4 MB. Free memory was 151.5 MB in the beginning and 149.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 842.09 ms. Allocated memory is still 202.4 MB. Free memory was 148.8 MB in the beginning and 98.7 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 117403.23 ms. Allocated memory was 202.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 98.0 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 178 ProgramPointsBefore, 93 ProgramPointsAfterwards, 215 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7050 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 249 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 78858 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_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] [L837] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_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=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=0, y=0, z=0] [L740] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L741] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L742] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L743] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L744] 1 a$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 [L750] 1 __unbuffered_p0_EAX = x [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_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=0, z=0] [L756] 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_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=0, z=0] [L770] 2 y = 1 [L773] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_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=1] [L776] 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_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=1] [L756] 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) [L757] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L790] 3 z = 2 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=7, a$mem_tmp=1, 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, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, x=1, y=1, z=2] [L800] 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)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=7, a$mem_tmp=1, 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, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, x=1, y=1, z=2] [L758] 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 [L800] 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) [L801] 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)) [L802] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=7, a$mem_tmp=1, 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, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, 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=2] [L802] 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)) [L803] 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)) [L804] 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)) [L806] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=7, a$mem_tmp=1, 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, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, 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=2] [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 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 [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L806] 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)) [L807] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=1, 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=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, x=1, y=1, z=2] [L812] EXPR 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, 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=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, x=1, y=1, z=2] [L812] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 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 [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L845] EXPR 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_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, 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=10, weak$$choice2=7, x=1, y=1, z=2] [L845] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 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 [L848] 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, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 117.0s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 46.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7480 SDtfs, 11221 SDslu, 28183 SDs, 0 SdLazy, 26316 SolverSat, 605 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 608 GetRequests, 84 SyntacticMatches, 40 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151748occurred 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: 35.6s AutomataMinimizationTime, 36 MinimizatonAttempts, 172301 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 1965 NumberOfCodeBlocks, 1965 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1862 ConstructedInterpolants, 0 QuantifiedInterpolants, 610094 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...