/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:04:33,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:04:33,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:04:33,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:04:33,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:04:33,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:04:33,335 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:04:33,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:04:33,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:04:33,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:04:33,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:04:33,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:04:33,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:04:33,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:04:33,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:04:33,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:04:33,363 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:04:33,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:04:33,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:04:33,368 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:04:33,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:04:33,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:04:33,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:04:33,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:04:33,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:04:33,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:04:33,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:04:33,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:04:33,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:04:33,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:04:33,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:04:33,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:04:33,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:04:33,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:04:33,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:04:33,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:04:33,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:04:33,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:04:33,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:04:33,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:04:33,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:04:33,387 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-VariableLbe.epf [2019-12-27 07:04:33,408 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:04:33,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:04:33,410 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:04:33,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:04:33,411 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:04:33,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:04:33,412 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:04:33,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:04:33,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:04:33,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:04:33,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:04:33,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:04:33,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:04:33,414 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:04:33,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:04:33,414 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:04:33,415 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:04:33,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:04:33,415 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:04:33,415 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:04:33,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:04:33,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:04:33,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:04:33,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:04:33,416 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:04:33,416 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:04:33,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:04:33,417 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:04:33,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:04:33,417 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:04:33,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:04:33,696 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:04:33,699 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:04:33,701 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:04:33,701 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:04:33,702 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i [2019-12-27 07:04:33,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a784ba0b3/ad46402ebc5142d6b2f12f5a60535633/FLAG69b95b948 [2019-12-27 07:04:34,317 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:04:34,318 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i [2019-12-27 07:04:34,334 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a784ba0b3/ad46402ebc5142d6b2f12f5a60535633/FLAG69b95b948 [2019-12-27 07:04:34,623 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a784ba0b3/ad46402ebc5142d6b2f12f5a60535633 [2019-12-27 07:04:34,633 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:04:34,634 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:04:34,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:04:34,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:04:34,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:04:34,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:04:34" (1/1) ... [2019-12-27 07:04:34,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d0ee1ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:34, skipping insertion in model container [2019-12-27 07:04:34,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:04:34" (1/1) ... [2019-12-27 07:04:34,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:04:34,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:04:35,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:04:35,293 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:04:35,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:04:35,451 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:04:35,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35 WrapperNode [2019-12-27 07:04:35,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:04:35,453 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:04:35,453 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:04:35,453 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:04:35,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (1/1) ... [2019-12-27 07:04:35,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (1/1) ... [2019-12-27 07:04:35,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:04:35,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:04:35,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:04:35,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:04:35,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (1/1) ... [2019-12-27 07:04:35,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (1/1) ... [2019-12-27 07:04:35,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (1/1) ... [2019-12-27 07:04:35,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (1/1) ... [2019-12-27 07:04:35,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (1/1) ... [2019-12-27 07:04:35,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (1/1) ... [2019-12-27 07:04:35,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (1/1) ... [2019-12-27 07:04:35,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:04:35,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:04:35,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:04:35,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:04:35,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:04:35,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:04:35,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:04:35,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:04:35,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:04:35,697 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:04:35,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:04:35,698 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:04:35,699 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:04:35,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:04:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:04:35,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:04:35,704 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:04:36,909 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:04:36,909 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:04:36,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:04:36 BoogieIcfgContainer [2019-12-27 07:04:36,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:04:36,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:04:36,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:04:36,916 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:04:36,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:04:34" (1/3) ... [2019-12-27 07:04:36,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b2511c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:04:36, skipping insertion in model container [2019-12-27 07:04:36,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (2/3) ... [2019-12-27 07:04:36,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b2511c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:04:36, skipping insertion in model container [2019-12-27 07:04:36,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:04:36" (3/3) ... [2019-12-27 07:04:36,923 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_pso.opt.i [2019-12-27 07:04:36,935 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:04:36,935 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:04:36,946 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:04:36,947 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:04:37,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,021 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,021 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,079 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,079 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,079 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,079 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,080 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,122 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,123 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,131 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,134 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,135 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:37,153 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:04:37,176 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:04:37,176 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:04:37,176 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:04:37,177 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:04:37,177 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:04:37,177 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:04:37,177 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:04:37,177 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:04:37,201 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-27 07:04:37,203 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 07:04:37,391 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 07:04:37,391 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:04:37,450 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 07:04:37,569 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 07:04:37,704 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 07:04:37,705 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:04:37,737 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 07:04:37,805 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-27 07:04:37,807 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:04:41,913 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 07:04:42,132 INFO L206 etLargeBlockEncoding]: Checked pairs total: 331194 [2019-12-27 07:04:42,132 INFO L214 etLargeBlockEncoding]: Total number of compositions: 139 [2019-12-27 07:04:42,136 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 194 transitions [2019-12-27 07:04:58,310 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120671 states. [2019-12-27 07:04:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 120671 states. [2019-12-27 07:04:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:04:58,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:58,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:04:58,319 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:58,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:58,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1348557133, now seen corresponding path program 1 times [2019-12-27 07:04:58,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:58,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746860237] [2019-12-27 07:04:58,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:58,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:04:58,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746860237] [2019-12-27 07:04:58,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:58,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:04:58,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532981484] [2019-12-27 07:04:58,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:58,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:58,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:58,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:58,644 INFO L87 Difference]: Start difference. First operand 120671 states. Second operand 3 states. [2019-12-27 07:05:00,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:05:00,569 INFO L93 Difference]: Finished difference Result 120599 states and 454207 transitions. [2019-12-27 07:05:00,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:05:00,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:05:00,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:05:01,336 INFO L225 Difference]: With dead ends: 120599 [2019-12-27 07:05:01,336 INFO L226 Difference]: Without dead ends: 118034 [2019-12-27 07:05:01,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:05:09,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118034 states. [2019-12-27 07:05:14,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118034 to 118034. [2019-12-27 07:05:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118034 states. [2019-12-27 07:05:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118034 states to 118034 states and 445141 transitions. [2019-12-27 07:05:14,815 INFO L78 Accepts]: Start accepts. Automaton has 118034 states and 445141 transitions. Word has length 5 [2019-12-27 07:05:14,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:05:14,816 INFO L462 AbstractCegarLoop]: Abstraction has 118034 states and 445141 transitions. [2019-12-27 07:05:14,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:05:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 118034 states and 445141 transitions. [2019-12-27 07:05:14,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:05:14,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:05:14,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:05:14,822 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:05:14,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:05:14,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1001758947, now seen corresponding path program 1 times [2019-12-27 07:05:14,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:05:14,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416692357] [2019-12-27 07:05:14,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:05:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:05:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:05:14,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416692357] [2019-12-27 07:05:14,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:05:14,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:05:14,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578074908] [2019-12-27 07:05:14,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:05:14,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:05:14,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:05:14,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:05:14,968 INFO L87 Difference]: Start difference. First operand 118034 states and 445141 transitions. Second operand 4 states. [2019-12-27 07:05:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:05:20,612 INFO L93 Difference]: Finished difference Result 156706 states and 575012 transitions. [2019-12-27 07:05:20,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:05:20,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:05:20,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:05:21,122 INFO L225 Difference]: With dead ends: 156706 [2019-12-27 07:05:21,123 INFO L226 Difference]: Without dead ends: 156706 [2019-12-27 07:05:21,124 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-27 07:05:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156706 states. [2019-12-27 07:05:29,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156706 to 156473. [2019-12-27 07:05:29,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156473 states. [2019-12-27 07:05:35,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156473 states to 156473 states and 574351 transitions. [2019-12-27 07:05:35,235 INFO L78 Accepts]: Start accepts. Automaton has 156473 states and 574351 transitions. Word has length 11 [2019-12-27 07:05:35,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:05:35,235 INFO L462 AbstractCegarLoop]: Abstraction has 156473 states and 574351 transitions. [2019-12-27 07:05:35,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:05:35,235 INFO L276 IsEmpty]: Start isEmpty. Operand 156473 states and 574351 transitions. [2019-12-27 07:05:35,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:05:35,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:05:35,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:05:35,238 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:05:35,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:05:35,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1039090903, now seen corresponding path program 1 times [2019-12-27 07:05:35,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:05:35,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179921693] [2019-12-27 07:05:35,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:05:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:05:35,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:05:35,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179921693] [2019-12-27 07:05:35,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:05:35,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:05:35,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085139668] [2019-12-27 07:05:35,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:05:35,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:05:35,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:05:35,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:05:35,396 INFO L87 Difference]: Start difference. First operand 156473 states and 574351 transitions. Second operand 4 states. [2019-12-27 07:05:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:05:36,760 INFO L93 Difference]: Finished difference Result 203727 states and 733867 transitions. [2019-12-27 07:05:36,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:05:36,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:05:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:05:38,585 INFO L225 Difference]: With dead ends: 203727 [2019-12-27 07:05:38,586 INFO L226 Difference]: Without dead ends: 203727 [2019-12-27 07:05:38,586 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-27 07:05:46,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203727 states. [2019-12-27 07:05:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203727 to 189697. [2019-12-27 07:05:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189697 states. [2019-12-27 07:05:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189697 states to 189697 states and 685577 transitions. [2019-12-27 07:05:57,794 INFO L78 Accepts]: Start accepts. Automaton has 189697 states and 685577 transitions. Word has length 11 [2019-12-27 07:05:57,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:05:57,795 INFO L462 AbstractCegarLoop]: Abstraction has 189697 states and 685577 transitions. [2019-12-27 07:05:57,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:05:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 189697 states and 685577 transitions. [2019-12-27 07:05:57,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:05:57,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:05:57,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:05:57,805 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:05:57,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:05:57,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1176638523, now seen corresponding path program 1 times [2019-12-27 07:05:57,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:05:57,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857801281] [2019-12-27 07:05:57,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:05:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:05:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:05:58,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857801281] [2019-12-27 07:05:58,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:05:58,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:05:58,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780791174] [2019-12-27 07:05:58,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:05:58,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:05:58,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:05:58,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:05:58,007 INFO L87 Difference]: Start difference. First operand 189697 states and 685577 transitions. Second operand 7 states. [2019-12-27 07:06:00,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:00,894 INFO L93 Difference]: Finished difference Result 249591 states and 888039 transitions. [2019-12-27 07:06:00,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:06:00,895 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-27 07:06:00,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:01,479 INFO L225 Difference]: With dead ends: 249591 [2019-12-27 07:06:01,480 INFO L226 Difference]: Without dead ends: 249591 [2019-12-27 07:06:01,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:06:09,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249591 states. [2019-12-27 07:06:18,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249591 to 189621. [2019-12-27 07:06:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189621 states. [2019-12-27 07:06:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189621 states to 189621 states and 685263 transitions. [2019-12-27 07:06:20,246 INFO L78 Accepts]: Start accepts. Automaton has 189621 states and 685263 transitions. Word has length 17 [2019-12-27 07:06:20,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:20,246 INFO L462 AbstractCegarLoop]: Abstraction has 189621 states and 685263 transitions. [2019-12-27 07:06:20,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:06:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 189621 states and 685263 transitions. [2019-12-27 07:06:20,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 07:06:20,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:20,255 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] [2019-12-27 07:06:20,255 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:20,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:20,256 INFO L82 PathProgramCache]: Analyzing trace with hash -943637830, now seen corresponding path program 1 times [2019-12-27 07:06:20,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:20,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353082952] [2019-12-27 07:06:20,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:20,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:06:20,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353082952] [2019-12-27 07:06:20,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:20,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:06:20,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065281114] [2019-12-27 07:06:20,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:06:20,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:20,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:06:20,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:06:20,452 INFO L87 Difference]: Start difference. First operand 189621 states and 685263 transitions. Second operand 7 states. [2019-12-27 07:06:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:28,526 INFO L93 Difference]: Finished difference Result 241619 states and 861598 transitions. [2019-12-27 07:06:28,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:06:28,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-12-27 07:06:28,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:29,112 INFO L225 Difference]: With dead ends: 241619 [2019-12-27 07:06:29,112 INFO L226 Difference]: Without dead ends: 241619 [2019-12-27 07:06:29,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:06:36,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241619 states. [2019-12-27 07:06:39,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241619 to 188159. [2019-12-27 07:06:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188159 states. [2019-12-27 07:06:40,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188159 states to 188159 states and 679897 transitions. [2019-12-27 07:06:40,924 INFO L78 Accepts]: Start accepts. Automaton has 188159 states and 679897 transitions. Word has length 21 [2019-12-27 07:06:40,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:40,925 INFO L462 AbstractCegarLoop]: Abstraction has 188159 states and 679897 transitions. [2019-12-27 07:06:40,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:06:40,925 INFO L276 IsEmpty]: Start isEmpty. Operand 188159 states and 679897 transitions. [2019-12-27 07:06:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:06:40,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:40,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:40,945 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:40,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:40,946 INFO L82 PathProgramCache]: Analyzing trace with hash -82071627, now seen corresponding path program 1 times [2019-12-27 07:06:40,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:40,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084326500] [2019-12-27 07:06:40,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:06:41,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084326500] [2019-12-27 07:06:41,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:41,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:06:41,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776906468] [2019-12-27 07:06:41,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:06:41,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:41,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:06:41,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:06:41,132 INFO L87 Difference]: Start difference. First operand 188159 states and 679897 transitions. Second operand 7 states. [2019-12-27 07:06:44,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:44,771 INFO L93 Difference]: Finished difference Result 258327 states and 918628 transitions. [2019-12-27 07:06:44,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 07:06:44,772 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-27 07:06:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:45,384 INFO L225 Difference]: With dead ends: 258327 [2019-12-27 07:06:45,384 INFO L226 Difference]: Without dead ends: 258327 [2019-12-27 07:06:45,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:06:59,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258327 states. [2019-12-27 07:07:03,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258327 to 243454. [2019-12-27 07:07:03,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243454 states. [2019-12-27 07:07:04,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243454 states to 243454 states and 867921 transitions. [2019-12-27 07:07:04,935 INFO L78 Accepts]: Start accepts. Automaton has 243454 states and 867921 transitions. Word has length 25 [2019-12-27 07:07:04,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:04,936 INFO L462 AbstractCegarLoop]: Abstraction has 243454 states and 867921 transitions. [2019-12-27 07:07:04,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:07:04,936 INFO L276 IsEmpty]: Start isEmpty. Operand 243454 states and 867921 transitions. [2019-12-27 07:07:04,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:07:04,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:04,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:04,953 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:04,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:04,953 INFO L82 PathProgramCache]: Analyzing trace with hash 144894900, now seen corresponding path program 1 times [2019-12-27 07:07:04,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:04,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441320714] [2019-12-27 07:07:04,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:05,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-27 07:07:05,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441320714] [2019-12-27 07:07:05,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:05,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:07:05,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644582615] [2019-12-27 07:07:05,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:07:05,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:05,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:07:05,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:07:05,048 INFO L87 Difference]: Start difference. First operand 243454 states and 867921 transitions. Second operand 4 states. [2019-12-27 07:07:05,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:05,128 INFO L93 Difference]: Finished difference Result 14903 states and 40511 transitions. [2019-12-27 07:07:05,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:07:05,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:07:05,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:05,145 INFO L225 Difference]: With dead ends: 14903 [2019-12-27 07:07:05,145 INFO L226 Difference]: Without dead ends: 10760 [2019-12-27 07:07:05,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:07:05,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10760 states. [2019-12-27 07:07:05,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10760 to 10720. [2019-12-27 07:07:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10720 states. [2019-12-27 07:07:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10720 states to 10720 states and 26330 transitions. [2019-12-27 07:07:05,268 INFO L78 Accepts]: Start accepts. Automaton has 10720 states and 26330 transitions. Word has length 25 [2019-12-27 07:07:05,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:05,268 INFO L462 AbstractCegarLoop]: Abstraction has 10720 states and 26330 transitions. [2019-12-27 07:07:05,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:07:05,268 INFO L276 IsEmpty]: Start isEmpty. Operand 10720 states and 26330 transitions. [2019-12-27 07:07:05,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 07:07:05,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:05,272 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] [2019-12-27 07:07:05,272 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:05,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:05,273 INFO L82 PathProgramCache]: Analyzing trace with hash 648735531, now seen corresponding path program 1 times [2019-12-27 07:07:05,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:05,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360281407] [2019-12-27 07:07:05,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:05,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360281407] [2019-12-27 07:07:05,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:05,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:07:05,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805518205] [2019-12-27 07:07:05,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:07:05,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:05,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:07:05,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:07:05,474 INFO L87 Difference]: Start difference. First operand 10720 states and 26330 transitions. Second operand 8 states. [2019-12-27 07:07:07,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:07,163 INFO L93 Difference]: Finished difference Result 12029 states and 29136 transitions. [2019-12-27 07:07:07,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:07:07,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-12-27 07:07:07,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:07,180 INFO L225 Difference]: With dead ends: 12029 [2019-12-27 07:07:07,181 INFO L226 Difference]: Without dead ends: 11981 [2019-12-27 07:07:07,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:07:07,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11981 states. [2019-12-27 07:07:07,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11981 to 11601. [2019-12-27 07:07:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11601 states. [2019-12-27 07:07:07,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11601 states to 11601 states and 28280 transitions. [2019-12-27 07:07:07,380 INFO L78 Accepts]: Start accepts. Automaton has 11601 states and 28280 transitions. Word has length 38 [2019-12-27 07:07:07,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:07,380 INFO L462 AbstractCegarLoop]: Abstraction has 11601 states and 28280 transitions. [2019-12-27 07:07:07,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:07:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 11601 states and 28280 transitions. [2019-12-27 07:07:07,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 07:07:07,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:07,391 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] [2019-12-27 07:07:07,392 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:07,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:07,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1308054868, now seen corresponding path program 1 times [2019-12-27 07:07:07,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:07,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985032781] [2019-12-27 07:07:07,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:07,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:07,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985032781] [2019-12-27 07:07:07,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:07,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:07:07,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227429487] [2019-12-27 07:07:07,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:07:07,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:07,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:07:07,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:07:07,665 INFO L87 Difference]: Start difference. First operand 11601 states and 28280 transitions. Second operand 9 states. [2019-12-27 07:07:09,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:09,391 INFO L93 Difference]: Finished difference Result 13284 states and 32063 transitions. [2019-12-27 07:07:09,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 07:07:09,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-12-27 07:07:09,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:09,408 INFO L225 Difference]: With dead ends: 13284 [2019-12-27 07:07:09,408 INFO L226 Difference]: Without dead ends: 13284 [2019-12-27 07:07:09,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:07:09,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13284 states. [2019-12-27 07:07:11,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13284 to 11783. [2019-12-27 07:07:11,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11783 states. [2019-12-27 07:07:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11783 states to 11783 states and 28660 transitions. [2019-12-27 07:07:11,026 INFO L78 Accepts]: Start accepts. Automaton has 11783 states and 28660 transitions. Word has length 50 [2019-12-27 07:07:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:11,026 INFO L462 AbstractCegarLoop]: Abstraction has 11783 states and 28660 transitions. [2019-12-27 07:07:11,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:07:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 11783 states and 28660 transitions. [2019-12-27 07:07:11,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 07:07:11,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:11,034 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] [2019-12-27 07:07:11,035 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:11,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:11,035 INFO L82 PathProgramCache]: Analyzing trace with hash -597968020, now seen corresponding path program 1 times [2019-12-27 07:07:11,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:11,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181834229] [2019-12-27 07:07:11,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:11,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181834229] [2019-12-27 07:07:11,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:11,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:07:11,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149711005] [2019-12-27 07:07:11,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:07:11,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:11,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:07:11,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:07:11,113 INFO L87 Difference]: Start difference. First operand 11783 states and 28660 transitions. Second operand 5 states. [2019-12-27 07:07:12,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:12,058 INFO L93 Difference]: Finished difference Result 13164 states and 31588 transitions. [2019-12-27 07:07:12,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:07:12,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 07:07:12,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:12,074 INFO L225 Difference]: With dead ends: 13164 [2019-12-27 07:07:12,074 INFO L226 Difference]: Without dead ends: 13164 [2019-12-27 07:07:12,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:07:12,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2019-12-27 07:07:12,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12754. [2019-12-27 07:07:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12754 states. [2019-12-27 07:07:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12754 states to 12754 states and 30765 transitions. [2019-12-27 07:07:12,224 INFO L78 Accepts]: Start accepts. Automaton has 12754 states and 30765 transitions. Word has length 57 [2019-12-27 07:07:12,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:12,224 INFO L462 AbstractCegarLoop]: Abstraction has 12754 states and 30765 transitions. [2019-12-27 07:07:12,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:07:12,224 INFO L276 IsEmpty]: Start isEmpty. Operand 12754 states and 30765 transitions. [2019-12-27 07:07:12,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 07:07:12,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:12,234 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] [2019-12-27 07:07:12,234 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:12,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:12,234 INFO L82 PathProgramCache]: Analyzing trace with hash 428916562, now seen corresponding path program 1 times [2019-12-27 07:07:12,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:12,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822166491] [2019-12-27 07:07:12,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:12,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822166491] [2019-12-27 07:07:12,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:12,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:07:12,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896023984] [2019-12-27 07:07:12,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:07:12,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:12,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:07:12,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:07:12,363 INFO L87 Difference]: Start difference. First operand 12754 states and 30765 transitions. Second operand 5 states. [2019-12-27 07:07:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:12,529 INFO L93 Difference]: Finished difference Result 13176 states and 31659 transitions. [2019-12-27 07:07:12,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:07:12,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 07:07:12,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:12,547 INFO L225 Difference]: With dead ends: 13176 [2019-12-27 07:07:12,547 INFO L226 Difference]: Without dead ends: 12972 [2019-12-27 07:07:12,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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-27 07:07:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12972 states. [2019-12-27 07:07:12,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12972 to 12672. [2019-12-27 07:07:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12672 states. [2019-12-27 07:07:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12672 states to 12672 states and 30593 transitions. [2019-12-27 07:07:12,706 INFO L78 Accepts]: Start accepts. Automaton has 12672 states and 30593 transitions. Word has length 58 [2019-12-27 07:07:12,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:12,707 INFO L462 AbstractCegarLoop]: Abstraction has 12672 states and 30593 transitions. [2019-12-27 07:07:12,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:07:12,707 INFO L276 IsEmpty]: Start isEmpty. Operand 12672 states and 30593 transitions. [2019-12-27 07:07:12,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:07:12,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:12,719 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-27 07:07:12,719 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:12,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:12,719 INFO L82 PathProgramCache]: Analyzing trace with hash 829880521, now seen corresponding path program 1 times [2019-12-27 07:07:12,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:12,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437426018] [2019-12-27 07:07:12,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:12,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:12,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437426018] [2019-12-27 07:07:12,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:12,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:07:12,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383383250] [2019-12-27 07:07:12,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:07:12,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:12,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:07:12,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:07:12,815 INFO L87 Difference]: Start difference. First operand 12672 states and 30593 transitions. Second operand 5 states. [2019-12-27 07:07:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:12,869 INFO L93 Difference]: Finished difference Result 5507 states and 12803 transitions. [2019-12-27 07:07:12,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:07:12,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-27 07:07:12,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:12,876 INFO L225 Difference]: With dead ends: 5507 [2019-12-27 07:07:12,876 INFO L226 Difference]: Without dead ends: 5250 [2019-12-27 07:07:12,877 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-27 07:07:12,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5250 states. [2019-12-27 07:07:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5250 to 5103. [2019-12-27 07:07:12,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5103 states. [2019-12-27 07:07:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5103 states to 5103 states and 11978 transitions. [2019-12-27 07:07:12,937 INFO L78 Accepts]: Start accepts. Automaton has 5103 states and 11978 transitions. Word has length 64 [2019-12-27 07:07:12,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:12,937 INFO L462 AbstractCegarLoop]: Abstraction has 5103 states and 11978 transitions. [2019-12-27 07:07:12,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:07:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand 5103 states and 11978 transitions. [2019-12-27 07:07:12,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 07:07:12,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:12,944 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:12,944 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:12,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:12,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1979048117, now seen corresponding path program 1 times [2019-12-27 07:07:12,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:12,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445052428] [2019-12-27 07:07:12,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:13,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445052428] [2019-12-27 07:07:13,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:13,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:07:13,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967020095] [2019-12-27 07:07:13,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:07:13,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:13,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:07:13,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:07:13,065 INFO L87 Difference]: Start difference. First operand 5103 states and 11978 transitions. Second operand 3 states. [2019-12-27 07:07:13,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:13,140 INFO L93 Difference]: Finished difference Result 5103 states and 11932 transitions. [2019-12-27 07:07:13,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:07:13,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-27 07:07:13,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:13,149 INFO L225 Difference]: With dead ends: 5103 [2019-12-27 07:07:13,149 INFO L226 Difference]: Without dead ends: 5103 [2019-12-27 07:07:13,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:07:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5103 states. [2019-12-27 07:07:13,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5103 to 5091. [2019-12-27 07:07:13,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5091 states. [2019-12-27 07:07:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5091 states to 5091 states and 11910 transitions. [2019-12-27 07:07:13,235 INFO L78 Accepts]: Start accepts. Automaton has 5091 states and 11910 transitions. Word has length 94 [2019-12-27 07:07:13,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:13,235 INFO L462 AbstractCegarLoop]: Abstraction has 5091 states and 11910 transitions. [2019-12-27 07:07:13,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:07:13,235 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 11910 transitions. [2019-12-27 07:07:13,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 07:07:13,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:13,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:13,243 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:13,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:13,243 INFO L82 PathProgramCache]: Analyzing trace with hash 827084238, now seen corresponding path program 1 times [2019-12-27 07:07:13,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:13,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434536995] [2019-12-27 07:07:13,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:13,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434536995] [2019-12-27 07:07:13,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:13,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:07:13,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881573226] [2019-12-27 07:07:13,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:07:13,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:13,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:07:13,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:07:13,361 INFO L87 Difference]: Start difference. First operand 5091 states and 11910 transitions. Second operand 6 states. [2019-12-27 07:07:14,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:14,107 INFO L93 Difference]: Finished difference Result 5322 states and 12370 transitions. [2019-12-27 07:07:14,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:07:14,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 07:07:14,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:14,115 INFO L225 Difference]: With dead ends: 5322 [2019-12-27 07:07:14,115 INFO L226 Difference]: Without dead ends: 5322 [2019-12-27 07:07:14,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:07:14,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2019-12-27 07:07:14,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5103. [2019-12-27 07:07:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5103 states. [2019-12-27 07:07:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5103 states to 5103 states and 11932 transitions. [2019-12-27 07:07:14,172 INFO L78 Accepts]: Start accepts. Automaton has 5103 states and 11932 transitions. Word has length 95 [2019-12-27 07:07:14,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:14,173 INFO L462 AbstractCegarLoop]: Abstraction has 5103 states and 11932 transitions. [2019-12-27 07:07:14,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:07:14,173 INFO L276 IsEmpty]: Start isEmpty. Operand 5103 states and 11932 transitions. [2019-12-27 07:07:14,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 07:07:14,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:14,180 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:14,180 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:14,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:14,180 INFO L82 PathProgramCache]: Analyzing trace with hash -93310818, now seen corresponding path program 2 times [2019-12-27 07:07:14,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:14,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274583927] [2019-12-27 07:07:14,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:14,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274583927] [2019-12-27 07:07:14,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:14,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:07:14,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088108037] [2019-12-27 07:07:14,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:07:14,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:14,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:07:14,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:07:14,268 INFO L87 Difference]: Start difference. First operand 5103 states and 11932 transitions. Second operand 5 states. [2019-12-27 07:07:14,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:14,953 INFO L93 Difference]: Finished difference Result 5591 states and 12935 transitions. [2019-12-27 07:07:14,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:07:14,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-27 07:07:14,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:14,961 INFO L225 Difference]: With dead ends: 5591 [2019-12-27 07:07:14,962 INFO L226 Difference]: Without dead ends: 5591 [2019-12-27 07:07:14,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:07:14,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5591 states. [2019-12-27 07:07:15,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5591 to 5244. [2019-12-27 07:07:15,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5244 states. [2019-12-27 07:07:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5244 states to 5244 states and 12250 transitions. [2019-12-27 07:07:15,087 INFO L78 Accepts]: Start accepts. Automaton has 5244 states and 12250 transitions. Word has length 95 [2019-12-27 07:07:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:15,087 INFO L462 AbstractCegarLoop]: Abstraction has 5244 states and 12250 transitions. [2019-12-27 07:07:15,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:07:15,088 INFO L276 IsEmpty]: Start isEmpty. Operand 5244 states and 12250 transitions. [2019-12-27 07:07:15,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 07:07:15,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:15,099 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:15,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:15,099 INFO L82 PathProgramCache]: Analyzing trace with hash 516666554, now seen corresponding path program 3 times [2019-12-27 07:07:15,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:15,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222028583] [2019-12-27 07:07:15,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:15,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222028583] [2019-12-27 07:07:15,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:15,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:07:15,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502635364] [2019-12-27 07:07:15,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:07:15,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:15,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:07:15,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:07:15,272 INFO L87 Difference]: Start difference. First operand 5244 states and 12250 transitions. Second operand 3 states. [2019-12-27 07:07:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:15,326 INFO L93 Difference]: Finished difference Result 5244 states and 12249 transitions. [2019-12-27 07:07:15,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:07:15,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-27 07:07:15,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:15,334 INFO L225 Difference]: With dead ends: 5244 [2019-12-27 07:07:15,334 INFO L226 Difference]: Without dead ends: 5244 [2019-12-27 07:07:15,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:07:15,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2019-12-27 07:07:15,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 5120. [2019-12-27 07:07:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5120 states. [2019-12-27 07:07:15,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5120 states to 5120 states and 12020 transitions. [2019-12-27 07:07:15,416 INFO L78 Accepts]: Start accepts. Automaton has 5120 states and 12020 transitions. Word has length 95 [2019-12-27 07:07:15,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:15,416 INFO L462 AbstractCegarLoop]: Abstraction has 5120 states and 12020 transitions. [2019-12-27 07:07:15,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:07:15,417 INFO L276 IsEmpty]: Start isEmpty. Operand 5120 states and 12020 transitions. [2019-12-27 07:07:15,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:15,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:15,425 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:15,425 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:15,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:15,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1106579360, now seen corresponding path program 1 times [2019-12-27 07:07:15,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:15,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334680036] [2019-12-27 07:07:15,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:15,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334680036] [2019-12-27 07:07:15,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:15,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:07:15,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195733919] [2019-12-27 07:07:15,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:07:15,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:15,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:07:15,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:07:15,518 INFO L87 Difference]: Start difference. First operand 5120 states and 12020 transitions. Second operand 4 states. [2019-12-27 07:07:15,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:15,880 INFO L93 Difference]: Finished difference Result 6152 states and 14457 transitions. [2019-12-27 07:07:15,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:07:15,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-27 07:07:15,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:15,890 INFO L225 Difference]: With dead ends: 6152 [2019-12-27 07:07:15,890 INFO L226 Difference]: Without dead ends: 6152 [2019-12-27 07:07:15,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:07:15,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6152 states. [2019-12-27 07:07:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6152 to 5984. [2019-12-27 07:07:16,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5984 states. [2019-12-27 07:07:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5984 states to 5984 states and 14082 transitions. [2019-12-27 07:07:16,017 INFO L78 Accepts]: Start accepts. Automaton has 5984 states and 14082 transitions. Word has length 96 [2019-12-27 07:07:16,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:16,017 INFO L462 AbstractCegarLoop]: Abstraction has 5984 states and 14082 transitions. [2019-12-27 07:07:16,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:07:16,017 INFO L276 IsEmpty]: Start isEmpty. Operand 5984 states and 14082 transitions. [2019-12-27 07:07:16,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:16,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:16,028 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:16,029 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:16,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:16,029 INFO L82 PathProgramCache]: Analyzing trace with hash -119254624, now seen corresponding path program 2 times [2019-12-27 07:07:16,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:16,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253464919] [2019-12-27 07:07:16,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:16,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253464919] [2019-12-27 07:07:16,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:16,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:07:16,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256631343] [2019-12-27 07:07:16,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:07:16,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:16,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:07:16,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:07:16,150 INFO L87 Difference]: Start difference. First operand 5984 states and 14082 transitions. Second operand 6 states. [2019-12-27 07:07:16,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:16,305 INFO L93 Difference]: Finished difference Result 7229 states and 16739 transitions. [2019-12-27 07:07:16,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 07:07:16,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-27 07:07:16,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:16,315 INFO L225 Difference]: With dead ends: 7229 [2019-12-27 07:07:16,315 INFO L226 Difference]: Without dead ends: 6284 [2019-12-27 07:07:16,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:07:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6284 states. [2019-12-27 07:07:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6284 to 6230. [2019-12-27 07:07:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6230 states. [2019-12-27 07:07:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6230 states to 6230 states and 14677 transitions. [2019-12-27 07:07:16,430 INFO L78 Accepts]: Start accepts. Automaton has 6230 states and 14677 transitions. Word has length 96 [2019-12-27 07:07:16,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:16,431 INFO L462 AbstractCegarLoop]: Abstraction has 6230 states and 14677 transitions. [2019-12-27 07:07:16,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:07:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 6230 states and 14677 transitions. [2019-12-27 07:07:16,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:16,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:16,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:16,443 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:16,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:16,443 INFO L82 PathProgramCache]: Analyzing trace with hash -882944868, now seen corresponding path program 3 times [2019-12-27 07:07:16,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:16,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972985057] [2019-12-27 07:07:16,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:16,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972985057] [2019-12-27 07:07:16,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:16,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:07:16,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191809329] [2019-12-27 07:07:16,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:07:16,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:16,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:07:16,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:07:16,698 INFO L87 Difference]: Start difference. First operand 6230 states and 14677 transitions. Second operand 12 states. [2019-12-27 07:07:18,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:18,199 INFO L93 Difference]: Finished difference Result 12354 states and 29299 transitions. [2019-12-27 07:07:18,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 07:07:18,200 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-27 07:07:18,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:18,215 INFO L225 Difference]: With dead ends: 12354 [2019-12-27 07:07:18,215 INFO L226 Difference]: Without dead ends: 11853 [2019-12-27 07:07:18,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-12-27 07:07:18,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11853 states. [2019-12-27 07:07:18,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11853 to 8550. [2019-12-27 07:07:18,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8550 states. [2019-12-27 07:07:18,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8550 states to 8550 states and 20654 transitions. [2019-12-27 07:07:18,338 INFO L78 Accepts]: Start accepts. Automaton has 8550 states and 20654 transitions. Word has length 96 [2019-12-27 07:07:18,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:18,338 INFO L462 AbstractCegarLoop]: Abstraction has 8550 states and 20654 transitions. [2019-12-27 07:07:18,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:07:18,338 INFO L276 IsEmpty]: Start isEmpty. Operand 8550 states and 20654 transitions. [2019-12-27 07:07:18,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:18,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:18,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:18,347 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:18,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:18,347 INFO L82 PathProgramCache]: Analyzing trace with hash -869322052, now seen corresponding path program 4 times [2019-12-27 07:07:18,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:18,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271693512] [2019-12-27 07:07:18,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:18,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271693512] [2019-12-27 07:07:18,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:18,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:07:18,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383018753] [2019-12-27 07:07:18,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:07:18,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:18,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:07:18,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:07:18,595 INFO L87 Difference]: Start difference. First operand 8550 states and 20654 transitions. Second operand 10 states. [2019-12-27 07:07:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:19,650 INFO L93 Difference]: Finished difference Result 18745 states and 44650 transitions. [2019-12-27 07:07:19,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 07:07:19,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 07:07:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:19,679 INFO L225 Difference]: With dead ends: 18745 [2019-12-27 07:07:19,679 INFO L226 Difference]: Without dead ends: 17674 [2019-12-27 07:07:19,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2019-12-27 07:07:19,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17674 states. [2019-12-27 07:07:19,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17674 to 12005. [2019-12-27 07:07:19,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12005 states. [2019-12-27 07:07:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12005 states to 12005 states and 29738 transitions. [2019-12-27 07:07:19,878 INFO L78 Accepts]: Start accepts. Automaton has 12005 states and 29738 transitions. Word has length 96 [2019-12-27 07:07:19,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:19,878 INFO L462 AbstractCegarLoop]: Abstraction has 12005 states and 29738 transitions. [2019-12-27 07:07:19,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:07:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 12005 states and 29738 transitions. [2019-12-27 07:07:19,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:19,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:19,893 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:19,893 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:19,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:19,894 INFO L82 PathProgramCache]: Analyzing trace with hash -2008375454, now seen corresponding path program 5 times [2019-12-27 07:07:19,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:19,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382172432] [2019-12-27 07:07:19,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:20,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382172432] [2019-12-27 07:07:20,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:20,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:07:20,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777362347] [2019-12-27 07:07:20,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:07:20,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:20,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:07:20,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:07:20,080 INFO L87 Difference]: Start difference. First operand 12005 states and 29738 transitions. Second operand 10 states. [2019-12-27 07:07:20,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:20,891 INFO L93 Difference]: Finished difference Result 17737 states and 43009 transitions. [2019-12-27 07:07:20,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 07:07:20,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 07:07:20,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:20,912 INFO L225 Difference]: With dead ends: 17737 [2019-12-27 07:07:20,913 INFO L226 Difference]: Without dead ends: 17200 [2019-12-27 07:07:20,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2019-12-27 07:07:20,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17200 states. [2019-12-27 07:07:21,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17200 to 12009. [2019-12-27 07:07:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12009 states. [2019-12-27 07:07:21,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12009 states to 12009 states and 29742 transitions. [2019-12-27 07:07:21,121 INFO L78 Accepts]: Start accepts. Automaton has 12009 states and 29742 transitions. Word has length 96 [2019-12-27 07:07:21,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:21,121 INFO L462 AbstractCegarLoop]: Abstraction has 12009 states and 29742 transitions. [2019-12-27 07:07:21,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:07:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 12009 states and 29742 transitions. [2019-12-27 07:07:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:21,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:21,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:21,139 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:21,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:21,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1428009006, now seen corresponding path program 6 times [2019-12-27 07:07:21,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:21,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627602387] [2019-12-27 07:07:21,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:21,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627602387] [2019-12-27 07:07:21,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:21,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:07:21,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392736338] [2019-12-27 07:07:21,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:07:21,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:21,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:07:21,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:07:21,336 INFO L87 Difference]: Start difference. First operand 12009 states and 29742 transitions. Second operand 12 states. [2019-12-27 07:07:22,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:22,890 INFO L93 Difference]: Finished difference Result 20599 states and 50509 transitions. [2019-12-27 07:07:22,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 07:07:22,891 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-27 07:07:22,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:22,912 INFO L225 Difference]: With dead ends: 20599 [2019-12-27 07:07:22,913 INFO L226 Difference]: Without dead ends: 20150 [2019-12-27 07:07:22,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2019-12-27 07:07:22,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20150 states. [2019-12-27 07:07:23,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20150 to 12352. [2019-12-27 07:07:23,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12352 states. [2019-12-27 07:07:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12352 states to 12352 states and 30555 transitions. [2019-12-27 07:07:23,107 INFO L78 Accepts]: Start accepts. Automaton has 12352 states and 30555 transitions. Word has length 96 [2019-12-27 07:07:23,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:23,107 INFO L462 AbstractCegarLoop]: Abstraction has 12352 states and 30555 transitions. [2019-12-27 07:07:23,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:07:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 12352 states and 30555 transitions. [2019-12-27 07:07:23,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:23,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:23,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:23,119 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:23,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:23,120 INFO L82 PathProgramCache]: Analyzing trace with hash 34403494, now seen corresponding path program 7 times [2019-12-27 07:07:23,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:23,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847585468] [2019-12-27 07:07:23,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:23,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847585468] [2019-12-27 07:07:23,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:23,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 07:07:23,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979608452] [2019-12-27 07:07:23,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 07:07:23,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:23,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 07:07:23,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-12-27 07:07:23,587 INFO L87 Difference]: Start difference. First operand 12352 states and 30555 transitions. Second operand 19 states. [2019-12-27 07:07:28,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:28,290 INFO L93 Difference]: Finished difference Result 26837 states and 65330 transitions. [2019-12-27 07:07:28,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 07:07:28,290 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2019-12-27 07:07:28,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:28,313 INFO L225 Difference]: With dead ends: 26837 [2019-12-27 07:07:28,313 INFO L226 Difference]: Without dead ends: 20908 [2019-12-27 07:07:28,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=315, Invalid=2037, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 07:07:28,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20908 states. [2019-12-27 07:07:28,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20908 to 17759. [2019-12-27 07:07:28,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17759 states. [2019-12-27 07:07:28,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17759 states to 17759 states and 44944 transitions. [2019-12-27 07:07:28,560 INFO L78 Accepts]: Start accepts. Automaton has 17759 states and 44944 transitions. Word has length 96 [2019-12-27 07:07:28,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:28,561 INFO L462 AbstractCegarLoop]: Abstraction has 17759 states and 44944 transitions. [2019-12-27 07:07:28,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 07:07:28,561 INFO L276 IsEmpty]: Start isEmpty. Operand 17759 states and 44944 transitions. [2019-12-27 07:07:28,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:28,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:28,578 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:28,578 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:28,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:28,579 INFO L82 PathProgramCache]: Analyzing trace with hash 318835082, now seen corresponding path program 8 times [2019-12-27 07:07:28,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:28,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472516853] [2019-12-27 07:07:28,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:28,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:28,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472516853] [2019-12-27 07:07:28,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:28,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:07:28,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558531272] [2019-12-27 07:07:28,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:07:28,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:28,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:07:28,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:07:28,671 INFO L87 Difference]: Start difference. First operand 17759 states and 44944 transitions. Second operand 5 states. [2019-12-27 07:07:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:28,815 INFO L93 Difference]: Finished difference Result 18351 states and 46102 transitions. [2019-12-27 07:07:28,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:07:28,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-27 07:07:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:28,844 INFO L225 Difference]: With dead ends: 18351 [2019-12-27 07:07:28,844 INFO L226 Difference]: Without dead ends: 17941 [2019-12-27 07:07:28,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:07:28,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17941 states. [2019-12-27 07:07:29,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17941 to 17853. [2019-12-27 07:07:29,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17853 states. [2019-12-27 07:07:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17853 states to 17853 states and 45160 transitions. [2019-12-27 07:07:29,104 INFO L78 Accepts]: Start accepts. Automaton has 17853 states and 45160 transitions. Word has length 96 [2019-12-27 07:07:29,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:29,104 INFO L462 AbstractCegarLoop]: Abstraction has 17853 states and 45160 transitions. [2019-12-27 07:07:29,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:07:29,104 INFO L276 IsEmpty]: Start isEmpty. Operand 17853 states and 45160 transitions. [2019-12-27 07:07:29,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:29,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:29,120 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:29,120 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:29,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:29,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1800459662, now seen corresponding path program 9 times [2019-12-27 07:07:29,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:29,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264403612] [2019-12-27 07:07:29,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:29,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:29,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264403612] [2019-12-27 07:07:29,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:29,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:07:29,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384647833] [2019-12-27 07:07:29,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:07:29,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:29,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:07:29,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:07:29,244 INFO L87 Difference]: Start difference. First operand 17853 states and 45160 transitions. Second operand 9 states. [2019-12-27 07:07:29,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:29,676 INFO L93 Difference]: Finished difference Result 26068 states and 65969 transitions. [2019-12-27 07:07:29,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 07:07:29,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-27 07:07:29,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:29,708 INFO L225 Difference]: With dead ends: 26068 [2019-12-27 07:07:29,708 INFO L226 Difference]: Without dead ends: 25694 [2019-12-27 07:07:29,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:07:29,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25694 states. [2019-12-27 07:07:29,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25694 to 20502. [2019-12-27 07:07:29,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20502 states. [2019-12-27 07:07:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20502 states to 20502 states and 52358 transitions. [2019-12-27 07:07:29,973 INFO L78 Accepts]: Start accepts. Automaton has 20502 states and 52358 transitions. Word has length 96 [2019-12-27 07:07:29,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:29,973 INFO L462 AbstractCegarLoop]: Abstraction has 20502 states and 52358 transitions. [2019-12-27 07:07:29,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:07:29,973 INFO L276 IsEmpty]: Start isEmpty. Operand 20502 states and 52358 transitions. [2019-12-27 07:07:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:29,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:29,991 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:29,991 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:29,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:29,992 INFO L82 PathProgramCache]: Analyzing trace with hash 419239290, now seen corresponding path program 10 times [2019-12-27 07:07:29,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:29,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101178203] [2019-12-27 07:07:29,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:30,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101178203] [2019-12-27 07:07:30,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:30,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:07:30,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879295717] [2019-12-27 07:07:30,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:07:30,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:30,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:07:30,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:07:30,213 INFO L87 Difference]: Start difference. First operand 20502 states and 52358 transitions. Second operand 5 states. [2019-12-27 07:07:30,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:30,842 INFO L93 Difference]: Finished difference Result 24941 states and 63397 transitions. [2019-12-27 07:07:30,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:07:30,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-27 07:07:30,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:30,879 INFO L225 Difference]: With dead ends: 24941 [2019-12-27 07:07:30,879 INFO L226 Difference]: Without dead ends: 24941 [2019-12-27 07:07:30,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:07:30,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24941 states. [2019-12-27 07:07:31,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24941 to 23062. [2019-12-27 07:07:31,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23062 states. [2019-12-27 07:07:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23062 states to 23062 states and 58914 transitions. [2019-12-27 07:07:31,265 INFO L78 Accepts]: Start accepts. Automaton has 23062 states and 58914 transitions. Word has length 96 [2019-12-27 07:07:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:31,266 INFO L462 AbstractCegarLoop]: Abstraction has 23062 states and 58914 transitions. [2019-12-27 07:07:31,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:07:31,266 INFO L276 IsEmpty]: Start isEmpty. Operand 23062 states and 58914 transitions. [2019-12-27 07:07:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:31,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:31,287 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:31,287 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:31,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:31,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1225125096, now seen corresponding path program 11 times [2019-12-27 07:07:31,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:31,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252281954] [2019-12-27 07:07:31,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:31,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252281954] [2019-12-27 07:07:31,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:31,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:07:31,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981929011] [2019-12-27 07:07:31,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:07:31,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:31,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:07:31,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:07:31,371 INFO L87 Difference]: Start difference. First operand 23062 states and 58914 transitions. Second operand 6 states. [2019-12-27 07:07:31,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:31,967 INFO L93 Difference]: Finished difference Result 25751 states and 65405 transitions. [2019-12-27 07:07:31,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 07:07:31,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-27 07:07:31,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:31,999 INFO L225 Difference]: With dead ends: 25751 [2019-12-27 07:07:31,999 INFO L226 Difference]: Without dead ends: 25751 [2019-12-27 07:07:31,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:07:32,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25751 states. [2019-12-27 07:07:32,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25751 to 23084. [2019-12-27 07:07:32,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23084 states. [2019-12-27 07:07:32,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23084 states to 23084 states and 58965 transitions. [2019-12-27 07:07:32,290 INFO L78 Accepts]: Start accepts. Automaton has 23084 states and 58965 transitions. Word has length 96 [2019-12-27 07:07:32,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:32,290 INFO L462 AbstractCegarLoop]: Abstraction has 23084 states and 58965 transitions. [2019-12-27 07:07:32,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:07:32,291 INFO L276 IsEmpty]: Start isEmpty. Operand 23084 states and 58965 transitions. [2019-12-27 07:07:32,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:32,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:32,314 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:32,314 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:32,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:32,314 INFO L82 PathProgramCache]: Analyzing trace with hash 220369114, now seen corresponding path program 12 times [2019-12-27 07:07:32,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:32,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455373126] [2019-12-27 07:07:32,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:32,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455373126] [2019-12-27 07:07:32,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:32,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:07:32,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019951294] [2019-12-27 07:07:32,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:07:32,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:32,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:07:32,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:07:32,464 INFO L87 Difference]: Start difference. First operand 23084 states and 58965 transitions. Second operand 9 states. [2019-12-27 07:07:33,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:33,350 INFO L93 Difference]: Finished difference Result 36302 states and 90565 transitions. [2019-12-27 07:07:33,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 07:07:33,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-27 07:07:33,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:33,400 INFO L225 Difference]: With dead ends: 36302 [2019-12-27 07:07:33,400 INFO L226 Difference]: Without dead ends: 34746 [2019-12-27 07:07:33,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2019-12-27 07:07:33,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34746 states. [2019-12-27 07:07:33,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34746 to 26812. [2019-12-27 07:07:33,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26812 states. [2019-12-27 07:07:33,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26812 states to 26812 states and 68973 transitions. [2019-12-27 07:07:33,804 INFO L78 Accepts]: Start accepts. Automaton has 26812 states and 68973 transitions. Word has length 96 [2019-12-27 07:07:33,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:33,804 INFO L462 AbstractCegarLoop]: Abstraction has 26812 states and 68973 transitions. [2019-12-27 07:07:33,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:07:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 26812 states and 68973 transitions. [2019-12-27 07:07:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:33,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:33,833 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:33,833 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:33,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:33,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1384925760, now seen corresponding path program 13 times [2019-12-27 07:07:33,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:33,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498142111] [2019-12-27 07:07:33,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:34,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498142111] [2019-12-27 07:07:34,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:34,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:07:34,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340712688] [2019-12-27 07:07:34,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:07:34,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:34,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:07:34,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:07:34,024 INFO L87 Difference]: Start difference. First operand 26812 states and 68973 transitions. Second operand 10 states. [2019-12-27 07:07:34,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:34,981 INFO L93 Difference]: Finished difference Result 30087 states and 76931 transitions. [2019-12-27 07:07:34,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:07:34,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 07:07:34,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:35,020 INFO L225 Difference]: With dead ends: 30087 [2019-12-27 07:07:35,021 INFO L226 Difference]: Without dead ends: 30039 [2019-12-27 07:07:35,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:07:35,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30039 states. [2019-12-27 07:07:35,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30039 to 28086. [2019-12-27 07:07:35,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28086 states. [2019-12-27 07:07:35,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28086 states to 28086 states and 72080 transitions. [2019-12-27 07:07:35,405 INFO L78 Accepts]: Start accepts. Automaton has 28086 states and 72080 transitions. Word has length 96 [2019-12-27 07:07:35,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:35,405 INFO L462 AbstractCegarLoop]: Abstraction has 28086 states and 72080 transitions. [2019-12-27 07:07:35,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:07:35,405 INFO L276 IsEmpty]: Start isEmpty. Operand 28086 states and 72080 transitions. [2019-12-27 07:07:35,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:35,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:35,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:35,437 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:35,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:35,438 INFO L82 PathProgramCache]: Analyzing trace with hash 426582246, now seen corresponding path program 14 times [2019-12-27 07:07:35,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:35,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42520562] [2019-12-27 07:07:35,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:35,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42520562] [2019-12-27 07:07:35,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:35,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 07:07:35,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579462027] [2019-12-27 07:07:35,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 07:07:35,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:35,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 07:07:35,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:07:35,901 INFO L87 Difference]: Start difference. First operand 28086 states and 72080 transitions. Second operand 15 states. [2019-12-27 07:07:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:37,079 INFO L93 Difference]: Finished difference Result 35568 states and 90268 transitions. [2019-12-27 07:07:37,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 07:07:37,080 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-12-27 07:07:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:37,123 INFO L225 Difference]: With dead ends: 35568 [2019-12-27 07:07:37,123 INFO L226 Difference]: Without dead ends: 35443 [2019-12-27 07:07:37,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2019-12-27 07:07:37,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35443 states. [2019-12-27 07:07:37,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35443 to 31597. [2019-12-27 07:07:37,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31597 states. [2019-12-27 07:07:37,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31597 states to 31597 states and 80868 transitions. [2019-12-27 07:07:37,530 INFO L78 Accepts]: Start accepts. Automaton has 31597 states and 80868 transitions. Word has length 96 [2019-12-27 07:07:37,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:37,531 INFO L462 AbstractCegarLoop]: Abstraction has 31597 states and 80868 transitions. [2019-12-27 07:07:37,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 07:07:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand 31597 states and 80868 transitions. [2019-12-27 07:07:37,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:37,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:37,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:37,563 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:37,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:37,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1379532680, now seen corresponding path program 15 times [2019-12-27 07:07:37,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:37,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840402457] [2019-12-27 07:07:37,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:37,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:37,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840402457] [2019-12-27 07:07:37,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:37,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:07:37,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105415733] [2019-12-27 07:07:37,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:07:37,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:37,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:07:37,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:07:37,712 INFO L87 Difference]: Start difference. First operand 31597 states and 80868 transitions. Second operand 10 states. [2019-12-27 07:07:38,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:38,665 INFO L93 Difference]: Finished difference Result 40554 states and 100707 transitions. [2019-12-27 07:07:38,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 07:07:38,665 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 07:07:38,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:38,716 INFO L225 Difference]: With dead ends: 40554 [2019-12-27 07:07:38,717 INFO L226 Difference]: Without dead ends: 39815 [2019-12-27 07:07:38,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-27 07:07:38,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39815 states. [2019-12-27 07:07:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39815 to 28861. [2019-12-27 07:07:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28861 states. [2019-12-27 07:07:39,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28861 states to 28861 states and 73250 transitions. [2019-12-27 07:07:39,306 INFO L78 Accepts]: Start accepts. Automaton has 28861 states and 73250 transitions. Word has length 96 [2019-12-27 07:07:39,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:39,306 INFO L462 AbstractCegarLoop]: Abstraction has 28861 states and 73250 transitions. [2019-12-27 07:07:39,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:07:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 28861 states and 73250 transitions. [2019-12-27 07:07:39,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:39,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:39,335 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:39,335 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:39,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:39,335 INFO L82 PathProgramCache]: Analyzing trace with hash -858529440, now seen corresponding path program 16 times [2019-12-27 07:07:39,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:39,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044834292] [2019-12-27 07:07:39,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:39,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044834292] [2019-12-27 07:07:39,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:39,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 07:07:39,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483000111] [2019-12-27 07:07:39,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 07:07:39,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:39,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 07:07:39,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:07:39,593 INFO L87 Difference]: Start difference. First operand 28861 states and 73250 transitions. Second operand 14 states. [2019-12-27 07:07:41,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:41,791 INFO L93 Difference]: Finished difference Result 45365 states and 114159 transitions. [2019-12-27 07:07:41,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 07:07:41,792 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-27 07:07:41,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:41,863 INFO L225 Difference]: With dead ends: 45365 [2019-12-27 07:07:41,863 INFO L226 Difference]: Without dead ends: 44306 [2019-12-27 07:07:41,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2019-12-27 07:07:41,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44306 states. [2019-12-27 07:07:42,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44306 to 34005. [2019-12-27 07:07:42,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34005 states. [2019-12-27 07:07:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34005 states to 34005 states and 87112 transitions. [2019-12-27 07:07:42,384 INFO L78 Accepts]: Start accepts. Automaton has 34005 states and 87112 transitions. Word has length 96 [2019-12-27 07:07:42,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:42,385 INFO L462 AbstractCegarLoop]: Abstraction has 34005 states and 87112 transitions. [2019-12-27 07:07:42,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 07:07:42,385 INFO L276 IsEmpty]: Start isEmpty. Operand 34005 states and 87112 transitions. [2019-12-27 07:07:42,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:42,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:42,421 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:42,421 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:42,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:42,421 INFO L82 PathProgramCache]: Analyzing trace with hash 2116025548, now seen corresponding path program 17 times [2019-12-27 07:07:42,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:42,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133984501] [2019-12-27 07:07:42,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:42,721 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-27 07:07:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:42,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133984501] [2019-12-27 07:07:42,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:42,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:07:42,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585459177] [2019-12-27 07:07:42,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:07:42,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:42,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:07:42,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:07:42,770 INFO L87 Difference]: Start difference. First operand 34005 states and 87112 transitions. Second operand 8 states. [2019-12-27 07:07:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:43,148 INFO L93 Difference]: Finished difference Result 37571 states and 95243 transitions. [2019-12-27 07:07:43,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:07:43,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-12-27 07:07:43,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:43,192 INFO L225 Difference]: With dead ends: 37571 [2019-12-27 07:07:43,192 INFO L226 Difference]: Without dead ends: 36036 [2019-12-27 07:07:43,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:07:43,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36036 states. [2019-12-27 07:07:43,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36036 to 34409. [2019-12-27 07:07:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34409 states. [2019-12-27 07:07:43,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34409 states to 34409 states and 88091 transitions. [2019-12-27 07:07:43,643 INFO L78 Accepts]: Start accepts. Automaton has 34409 states and 88091 transitions. Word has length 96 [2019-12-27 07:07:43,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:43,643 INFO L462 AbstractCegarLoop]: Abstraction has 34409 states and 88091 transitions. [2019-12-27 07:07:43,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:07:43,644 INFO L276 IsEmpty]: Start isEmpty. Operand 34409 states and 88091 transitions. [2019-12-27 07:07:43,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:43,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:43,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:43,680 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:43,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:43,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1947399536, now seen corresponding path program 18 times [2019-12-27 07:07:43,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:43,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674216860] [2019-12-27 07:07:43,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:43,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:43,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674216860] [2019-12-27 07:07:43,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:43,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 07:07:43,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736088164] [2019-12-27 07:07:43,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 07:07:43,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:43,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 07:07:43,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:07:43,949 INFO L87 Difference]: Start difference. First operand 34409 states and 88091 transitions. Second operand 13 states. [2019-12-27 07:07:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:46,436 INFO L93 Difference]: Finished difference Result 64246 states and 165695 transitions. [2019-12-27 07:07:46,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 07:07:46,437 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-27 07:07:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:46,524 INFO L225 Difference]: With dead ends: 64246 [2019-12-27 07:07:46,525 INFO L226 Difference]: Without dead ends: 64246 [2019-12-27 07:07:46,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-27 07:07:46,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64246 states. [2019-12-27 07:07:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64246 to 48457. [2019-12-27 07:07:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48457 states. [2019-12-27 07:07:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48457 states to 48457 states and 125576 transitions. [2019-12-27 07:07:47,470 INFO L78 Accepts]: Start accepts. Automaton has 48457 states and 125576 transitions. Word has length 96 [2019-12-27 07:07:47,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:47,470 INFO L462 AbstractCegarLoop]: Abstraction has 48457 states and 125576 transitions. [2019-12-27 07:07:47,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 07:07:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 48457 states and 125576 transitions. [2019-12-27 07:07:47,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:47,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:47,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:47,518 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:47,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:47,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1482835720, now seen corresponding path program 19 times [2019-12-27 07:07:47,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:47,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405147803] [2019-12-27 07:07:47,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:47,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405147803] [2019-12-27 07:07:47,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:47,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 07:07:47,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911595132] [2019-12-27 07:07:47,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 07:07:47,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:47,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 07:07:47,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:07:47,764 INFO L87 Difference]: Start difference. First operand 48457 states and 125576 transitions. Second operand 13 states. [2019-12-27 07:07:49,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:49,938 INFO L93 Difference]: Finished difference Result 63677 states and 164176 transitions. [2019-12-27 07:07:49,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 07:07:49,938 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-27 07:07:49,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:50,025 INFO L225 Difference]: With dead ends: 63677 [2019-12-27 07:07:50,025 INFO L226 Difference]: Without dead ends: 63579 [2019-12-27 07:07:50,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2019-12-27 07:07:50,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63579 states. [2019-12-27 07:07:50,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63579 to 48190. [2019-12-27 07:07:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48190 states. [2019-12-27 07:07:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48190 states to 48190 states and 124983 transitions. [2019-12-27 07:07:51,057 INFO L78 Accepts]: Start accepts. Automaton has 48190 states and 124983 transitions. Word has length 96 [2019-12-27 07:07:51,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:51,057 INFO L462 AbstractCegarLoop]: Abstraction has 48190 states and 124983 transitions. [2019-12-27 07:07:51,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 07:07:51,057 INFO L276 IsEmpty]: Start isEmpty. Operand 48190 states and 124983 transitions. [2019-12-27 07:07:51,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:51,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:51,104 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:51,105 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:51,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:51,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1121279064, now seen corresponding path program 20 times [2019-12-27 07:07:51,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:51,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120928457] [2019-12-27 07:07:51,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:51,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120928457] [2019-12-27 07:07:51,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:51,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:07:51,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544906853] [2019-12-27 07:07:51,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:07:51,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:51,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:07:51,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:07:51,265 INFO L87 Difference]: Start difference. First operand 48190 states and 124983 transitions. Second operand 12 states. [2019-12-27 07:07:52,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:52,715 INFO L93 Difference]: Finished difference Result 72729 states and 187481 transitions. [2019-12-27 07:07:52,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 07:07:52,715 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-27 07:07:52,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:52,809 INFO L225 Difference]: With dead ends: 72729 [2019-12-27 07:07:52,809 INFO L226 Difference]: Without dead ends: 69724 [2019-12-27 07:07:52,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2019-12-27 07:07:52,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69724 states. [2019-12-27 07:07:53,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69724 to 53712. [2019-12-27 07:07:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53712 states. [2019-12-27 07:07:53,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53712 states to 53712 states and 140714 transitions. [2019-12-27 07:07:53,882 INFO L78 Accepts]: Start accepts. Automaton has 53712 states and 140714 transitions. Word has length 96 [2019-12-27 07:07:53,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:53,882 INFO L462 AbstractCegarLoop]: Abstraction has 53712 states and 140714 transitions. [2019-12-27 07:07:53,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:07:53,882 INFO L276 IsEmpty]: Start isEmpty. Operand 53712 states and 140714 transitions. [2019-12-27 07:07:53,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 07:07:53,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:53,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:53,940 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:53,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:53,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1193380302, now seen corresponding path program 21 times [2019-12-27 07:07:53,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:53,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56761372] [2019-12-27 07:07:53,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:54,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56761372] [2019-12-27 07:07:54,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:54,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:07:54,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874396657] [2019-12-27 07:07:54,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:07:54,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:54,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:07:54,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:07:54,137 INFO L87 Difference]: Start difference. First operand 53712 states and 140714 transitions. Second operand 12 states. Received shutdown request... [2019-12-27 07:07:55,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 07:07:55,643 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 07:07:55,648 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 07:07:55,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:07:55 BasicIcfg [2019-12-27 07:07:55,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:07:55,650 INFO L168 Benchmark]: Toolchain (without parser) took 201015.60 ms. Allocated memory was 140.0 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 101.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 07:07:55,650 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 140.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 07:07:55,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.15 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 100.6 MB in the beginning and 155.0 MB in the end (delta: -54.4 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2019-12-27 07:07:55,651 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.79 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 151.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:07:55,651 INFO L168 Benchmark]: Boogie Preprocessor took 59.33 ms. Allocated memory is still 203.9 MB. Free memory was 151.1 MB in the beginning and 148.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:07:55,652 INFO L168 Benchmark]: RCFGBuilder took 1321.58 ms. Allocated memory was 203.9 MB in the beginning and 236.5 MB in the end (delta: 32.5 MB). Free memory was 147.7 MB in the beginning and 191.7 MB in the end (delta: -43.9 MB). Peak memory consumption was 65.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:07:55,652 INFO L168 Benchmark]: TraceAbstraction took 198736.17 ms. Allocated memory was 236.5 MB in the beginning and 3.1 GB in the end (delta: 2.8 GB). Free memory was 191.7 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 07:07:55,654 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 140.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 817.15 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 100.6 MB in the beginning and 155.0 MB in the end (delta: -54.4 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.79 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 151.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.33 ms. Allocated memory is still 203.9 MB. Free memory was 151.1 MB in the beginning and 148.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1321.58 ms. Allocated memory was 203.9 MB in the beginning and 236.5 MB in the end (delta: 32.5 MB). Free memory was 147.7 MB in the beginning and 191.7 MB in the end (delta: -43.9 MB). Peak memory consumption was 65.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 198736.17 ms. Allocated memory was 236.5 MB in the beginning and 3.1 GB in the end (delta: 2.8 GB). Free memory was 191.7 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 244 ProgramPointsBefore, 156 ProgramPointsAfterwards, 326 TransitionsBefore, 194 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 74 ConcurrentYvCompositions, 47 ChoiceCompositions, 17563 VarBasedMoverChecksPositive, 349 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 331194 CheckedPairsTotal, 139 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (53712states) and FLOYD_HOARE automaton (currently 25 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (59450 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (53712states) and FLOYD_HOARE automaton (currently 25 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (59450 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 198.4s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 61.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 15015 SDtfs, 20249 SDslu, 67488 SDs, 0 SdLazy, 31812 SolverSat, 936 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 626 GetRequests, 116 SyntacticMatches, 36 SemanticMatches, 474 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2010 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243454occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 107.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 265009 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 2777 NumberOfCodeBlocks, 2777 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2740 ConstructedInterpolants, 0 QuantifiedInterpolants, 1033132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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 could not prove your program: Timeout Completed graceful shutdown