/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:55:53,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:55:53,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:55:53,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:55:53,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:55:53,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:55:53,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:55:53,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:55:53,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:55:53,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:55:53,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:55:53,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:55:53,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:55:53,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:55:53,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:55:53,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:55:53,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:55:53,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:55:53,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:55:53,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:55:53,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:55:53,470 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:55:53,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:55:53,472 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:55:53,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:55:53,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:55:53,475 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:55:53,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:55:53,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:55:53,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:55:53,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:55:53,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:55:53,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:55:53,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:55:53,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:55:53,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:55:53,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:55:53,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:55:53,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:55:53,482 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:55:53,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:55:53,483 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:55:53,513 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:55:53,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:55:53,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:55:53,515 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:55:53,515 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:55:53,515 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:55:53,515 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:55:53,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:55:53,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:55:53,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:55:53,516 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:55:53,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:55:53,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:55:53,517 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:55:53,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:55:53,517 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:55:53,517 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:55:53,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:55:53,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:55:53,518 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:55:53,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:55:53,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:55:53,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:55:53,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:55:53,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:55:53,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:55:53,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:55:53,519 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:55:53,520 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:55:53,520 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:55:53,815 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:55:53,830 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:55:53,833 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:55:53,834 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:55:53,835 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:55:53,836 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.opt.i [2019-12-18 12:55:53,896 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70dd4850e/828d222e1b5147c8b65f60ea3421d045/FLAGf87a621d2 [2019-12-18 12:55:54,459 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:55:54,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_pso.opt.i [2019-12-18 12:55:54,479 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70dd4850e/828d222e1b5147c8b65f60ea3421d045/FLAGf87a621d2 [2019-12-18 12:55:54,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70dd4850e/828d222e1b5147c8b65f60ea3421d045 [2019-12-18 12:55:54,807 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:55:54,808 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:55:54,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:55:54,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:55:54,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:55:54,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:55:54" (1/1) ... [2019-12-18 12:55:54,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:54, skipping insertion in model container [2019-12-18 12:55:54,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:55:54" (1/1) ... [2019-12-18 12:55:54,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:55:54,884 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:55:55,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:55:55,481 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:55:55,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:55:55,642 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:55:55,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:55 WrapperNode [2019-12-18 12:55:55,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:55:55,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:55:55,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:55:55,644 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:55:55,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:55" (1/1) ... [2019-12-18 12:55:55,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:55" (1/1) ... [2019-12-18 12:55:55,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:55:55,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:55:55,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:55:55,703 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:55:55,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:55" (1/1) ... [2019-12-18 12:55:55,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:55" (1/1) ... [2019-12-18 12:55:55,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:55" (1/1) ... [2019-12-18 12:55:55,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:55" (1/1) ... [2019-12-18 12:55:55,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:55" (1/1) ... [2019-12-18 12:55:55,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:55" (1/1) ... [2019-12-18 12:55:55,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:55" (1/1) ... [2019-12-18 12:55:55,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:55:55,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:55:55,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:55:55,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:55:55,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:55:55,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:55:55,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:55:55,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:55:55,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:55:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:55:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:55:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:55:55,833 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:55:55,833 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:55:55,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:55:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:55:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:55:55,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:55:55,837 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:55:56,697 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:55:56,697 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:55:56,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:55:56 BoogieIcfgContainer [2019-12-18 12:55:56,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:55:56,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:55:56,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:55:56,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:55:56,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:55:54" (1/3) ... [2019-12-18 12:55:56,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4faa36e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:55:56, skipping insertion in model container [2019-12-18 12:55:56,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:55" (2/3) ... [2019-12-18 12:55:56,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4faa36e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:55:56, skipping insertion in model container [2019-12-18 12:55:56,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:55:56" (3/3) ... [2019-12-18 12:55:56,708 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_pso.opt.i [2019-12-18 12:55:56,717 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:55:56,717 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:55:56,725 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:55:56,726 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:55:56,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,767 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,768 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,801 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,801 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,802 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,802 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,802 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,810 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,810 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,836 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,836 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,836 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,843 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,844 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,848 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,848 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:56,869 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:55:56,892 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:55:56,892 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:55:56,892 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:55:56,892 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:55:56,892 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:55:56,892 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:55:56,893 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:55:56,893 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:55:56,916 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 12:55:56,918 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 12:55:57,028 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 12:55:57,028 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:55:57,046 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 12:55:57,072 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 12:55:57,114 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 12:55:57,114 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:55:57,122 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 12:55:57,141 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 12:55:57,142 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:56:02,953 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-18 12:56:03,226 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 12:56:03,355 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 12:56:03,378 INFO L206 etLargeBlockEncoding]: Checked pairs total: 73051 [2019-12-18 12:56:03,378 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 12:56:03,382 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-18 12:56:13,858 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83162 states. [2019-12-18 12:56:13,860 INFO L276 IsEmpty]: Start isEmpty. Operand 83162 states. [2019-12-18 12:56:13,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 12:56:13,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:13,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 12:56:13,868 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:13,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:13,873 INFO L82 PathProgramCache]: Analyzing trace with hash 800250999, now seen corresponding path program 1 times [2019-12-18 12:56:13,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:13,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759568064] [2019-12-18 12:56:13,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:14,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:14,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759568064] [2019-12-18 12:56:14,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:14,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:56:14,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230192069] [2019-12-18 12:56:14,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:56:14,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:14,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:56:14,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:14,144 INFO L87 Difference]: Start difference. First operand 83162 states. Second operand 3 states. [2019-12-18 12:56:15,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:15,193 INFO L93 Difference]: Finished difference Result 82042 states and 356056 transitions. [2019-12-18 12:56:15,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:56:15,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 12:56:15,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:18,140 INFO L225 Difference]: With dead ends: 82042 [2019-12-18 12:56:18,140 INFO L226 Difference]: Without dead ends: 77338 [2019-12-18 12:56:18,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:20,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77338 states. [2019-12-18 12:56:23,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77338 to 77338. [2019-12-18 12:56:23,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77338 states. [2019-12-18 12:56:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77338 states to 77338 states and 335168 transitions. [2019-12-18 12:56:23,831 INFO L78 Accepts]: Start accepts. Automaton has 77338 states and 335168 transitions. Word has length 5 [2019-12-18 12:56:23,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:23,832 INFO L462 AbstractCegarLoop]: Abstraction has 77338 states and 335168 transitions. [2019-12-18 12:56:23,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:56:23,832 INFO L276 IsEmpty]: Start isEmpty. Operand 77338 states and 335168 transitions. [2019-12-18 12:56:23,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:56:23,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:23,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:23,841 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:23,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:23,841 INFO L82 PathProgramCache]: Analyzing trace with hash -463413440, now seen corresponding path program 1 times [2019-12-18 12:56:23,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:23,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533712455] [2019-12-18 12:56:23,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:23,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:23,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533712455] [2019-12-18 12:56:23,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:23,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:56:23,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054994207] [2019-12-18 12:56:23,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:56:23,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:23,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:56:23,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:56:23,996 INFO L87 Difference]: Start difference. First operand 77338 states and 335168 transitions. Second operand 4 states. [2019-12-18 12:56:28,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:28,710 INFO L93 Difference]: Finished difference Result 119002 states and 493831 transitions. [2019-12-18 12:56:28,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:56:28,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 12:56:28,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:29,407 INFO L225 Difference]: With dead ends: 119002 [2019-12-18 12:56:29,407 INFO L226 Difference]: Without dead ends: 118911 [2019-12-18 12:56:29,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:56:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118911 states. [2019-12-18 12:56:35,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118911 to 109839. [2019-12-18 12:56:35,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109839 states. [2019-12-18 12:56:35,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109839 states to 109839 states and 460824 transitions. [2019-12-18 12:56:35,473 INFO L78 Accepts]: Start accepts. Automaton has 109839 states and 460824 transitions. Word has length 13 [2019-12-18 12:56:35,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:35,474 INFO L462 AbstractCegarLoop]: Abstraction has 109839 states and 460824 transitions. [2019-12-18 12:56:35,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:56:35,474 INFO L276 IsEmpty]: Start isEmpty. Operand 109839 states and 460824 transitions. [2019-12-18 12:56:35,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:56:35,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:35,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:35,479 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:35,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:35,479 INFO L82 PathProgramCache]: Analyzing trace with hash 2092378622, now seen corresponding path program 1 times [2019-12-18 12:56:35,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:35,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865300871] [2019-12-18 12:56:35,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:35,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:35,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865300871] [2019-12-18 12:56:35,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:35,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:56:35,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385148415] [2019-12-18 12:56:35,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:56:35,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:35,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:56:35,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:56:35,570 INFO L87 Difference]: Start difference. First operand 109839 states and 460824 transitions. Second operand 4 states. [2019-12-18 12:56:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:40,269 INFO L93 Difference]: Finished difference Result 153490 states and 628667 transitions. [2019-12-18 12:56:40,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:56:40,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 12:56:40,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:40,724 INFO L225 Difference]: With dead ends: 153490 [2019-12-18 12:56:40,724 INFO L226 Difference]: Without dead ends: 153386 [2019-12-18 12:56:40,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:56:47,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153386 states. [2019-12-18 12:56:49,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153386 to 130549. [2019-12-18 12:56:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130549 states. [2019-12-18 12:56:50,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130549 states to 130549 states and 543763 transitions. [2019-12-18 12:56:50,820 INFO L78 Accepts]: Start accepts. Automaton has 130549 states and 543763 transitions. Word has length 13 [2019-12-18 12:56:50,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:50,821 INFO L462 AbstractCegarLoop]: Abstraction has 130549 states and 543763 transitions. [2019-12-18 12:56:50,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:56:50,821 INFO L276 IsEmpty]: Start isEmpty. Operand 130549 states and 543763 transitions. [2019-12-18 12:56:50,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 12:56:50,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:50,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:50,826 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:50,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:50,826 INFO L82 PathProgramCache]: Analyzing trace with hash 740124844, now seen corresponding path program 1 times [2019-12-18 12:56:50,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:50,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295024344] [2019-12-18 12:56:50,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:50,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:50,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295024344] [2019-12-18 12:56:50,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:50,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:56:50,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121804904] [2019-12-18 12:56:50,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:56:50,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:50,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:56:50,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:56:50,932 INFO L87 Difference]: Start difference. First operand 130549 states and 543763 transitions. Second operand 4 states. [2019-12-18 12:56:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:51,917 INFO L93 Difference]: Finished difference Result 162838 states and 668586 transitions. [2019-12-18 12:56:51,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:56:51,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 12:56:51,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:52,369 INFO L225 Difference]: With dead ends: 162838 [2019-12-18 12:56:52,369 INFO L226 Difference]: Without dead ends: 162750 [2019-12-18 12:56:52,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162750 states. [2019-12-18 12:57:03,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162750 to 140790. [2019-12-18 12:57:03,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140790 states. [2019-12-18 12:57:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140790 states to 140790 states and 584562 transitions. [2019-12-18 12:57:04,964 INFO L78 Accepts]: Start accepts. Automaton has 140790 states and 584562 transitions. Word has length 14 [2019-12-18 12:57:04,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:04,964 INFO L462 AbstractCegarLoop]: Abstraction has 140790 states and 584562 transitions. [2019-12-18 12:57:04,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:57:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 140790 states and 584562 transitions. [2019-12-18 12:57:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 12:57:04,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:04,968 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:04,969 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:04,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:04,969 INFO L82 PathProgramCache]: Analyzing trace with hash 739988072, now seen corresponding path program 1 times [2019-12-18 12:57:04,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:04,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861943005] [2019-12-18 12:57:04,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:05,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:05,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861943005] [2019-12-18 12:57:05,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:05,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:57:05,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538665749] [2019-12-18 12:57:05,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:57:05,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:05,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:57:05,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:05,014 INFO L87 Difference]: Start difference. First operand 140790 states and 584562 transitions. Second operand 3 states. [2019-12-18 12:57:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:06,037 INFO L93 Difference]: Finished difference Result 195371 states and 811522 transitions. [2019-12-18 12:57:06,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:57:06,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 12:57:06,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:13,007 INFO L225 Difference]: With dead ends: 195371 [2019-12-18 12:57:13,007 INFO L226 Difference]: Without dead ends: 195371 [2019-12-18 12:57:13,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:16,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195371 states. [2019-12-18 12:57:19,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195371 to 171215. [2019-12-18 12:57:19,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171215 states. [2019-12-18 12:57:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171215 states to 171215 states and 713371 transitions. [2019-12-18 12:57:20,191 INFO L78 Accepts]: Start accepts. Automaton has 171215 states and 713371 transitions. Word has length 14 [2019-12-18 12:57:20,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:20,192 INFO L462 AbstractCegarLoop]: Abstraction has 171215 states and 713371 transitions. [2019-12-18 12:57:20,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:57:20,192 INFO L276 IsEmpty]: Start isEmpty. Operand 171215 states and 713371 transitions. [2019-12-18 12:57:20,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 12:57:20,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:20,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:20,195 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:20,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:20,195 INFO L82 PathProgramCache]: Analyzing trace with hash 575422588, now seen corresponding path program 1 times [2019-12-18 12:57:20,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:20,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529520449] [2019-12-18 12:57:20,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:20,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529520449] [2019-12-18 12:57:20,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:20,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:57:20,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216924898] [2019-12-18 12:57:20,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:57:20,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:20,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:57:20,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:57:20,259 INFO L87 Difference]: Start difference. First operand 171215 states and 713371 transitions. Second operand 4 states. [2019-12-18 12:57:22,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:22,646 INFO L93 Difference]: Finished difference Result 200032 states and 824493 transitions. [2019-12-18 12:57:22,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:57:22,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 12:57:22,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:23,237 INFO L225 Difference]: With dead ends: 200032 [2019-12-18 12:57:23,238 INFO L226 Difference]: Without dead ends: 199944 [2019-12-18 12:57:23,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:34,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199944 states. [2019-12-18 12:57:37,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199944 to 173869. [2019-12-18 12:57:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173869 states. [2019-12-18 12:57:37,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173869 states to 173869 states and 724501 transitions. [2019-12-18 12:57:37,860 INFO L78 Accepts]: Start accepts. Automaton has 173869 states and 724501 transitions. Word has length 14 [2019-12-18 12:57:37,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:37,860 INFO L462 AbstractCegarLoop]: Abstraction has 173869 states and 724501 transitions. [2019-12-18 12:57:37,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:57:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 173869 states and 724501 transitions. [2019-12-18 12:57:37,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 12:57:37,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:37,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:37,880 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:37,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:37,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1027045792, now seen corresponding path program 1 times [2019-12-18 12:57:37,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:37,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209871666] [2019-12-18 12:57:37,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:37,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209871666] [2019-12-18 12:57:37,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:37,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:57:37,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451673488] [2019-12-18 12:57:37,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:57:37,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:37,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:57:37,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:37,927 INFO L87 Difference]: Start difference. First operand 173869 states and 724501 transitions. Second operand 3 states. [2019-12-18 12:57:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:40,045 INFO L93 Difference]: Finished difference Result 173738 states and 723945 transitions. [2019-12-18 12:57:40,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:57:40,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 12:57:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:40,639 INFO L225 Difference]: With dead ends: 173738 [2019-12-18 12:57:40,639 INFO L226 Difference]: Without dead ends: 173738 [2019-12-18 12:57:40,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:50,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173738 states. [2019-12-18 12:57:53,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173738 to 173738. [2019-12-18 12:57:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173738 states. [2019-12-18 12:57:54,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173738 states to 173738 states and 723945 transitions. [2019-12-18 12:57:54,804 INFO L78 Accepts]: Start accepts. Automaton has 173738 states and 723945 transitions. Word has length 18 [2019-12-18 12:57:54,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:54,805 INFO L462 AbstractCegarLoop]: Abstraction has 173738 states and 723945 transitions. [2019-12-18 12:57:54,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:57:54,805 INFO L276 IsEmpty]: Start isEmpty. Operand 173738 states and 723945 transitions. [2019-12-18 12:57:54,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 12:57:54,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:54,826 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:54,826 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:54,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:54,827 INFO L82 PathProgramCache]: Analyzing trace with hash 930576187, now seen corresponding path program 1 times [2019-12-18 12:57:54,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:54,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599532875] [2019-12-18 12:57:54,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:54,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599532875] [2019-12-18 12:57:54,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:54,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:57:54,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461737404] [2019-12-18 12:57:54,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:57:54,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:54,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:57:54,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:54,883 INFO L87 Difference]: Start difference. First operand 173738 states and 723945 transitions. Second operand 3 states. [2019-12-18 12:58:02,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:02,403 INFO L93 Difference]: Finished difference Result 286764 states and 1191382 transitions. [2019-12-18 12:58:02,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:58:02,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 12:58:02,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:02,925 INFO L225 Difference]: With dead ends: 286764 [2019-12-18 12:58:02,925 INFO L226 Difference]: Without dead ends: 162140 [2019-12-18 12:58:02,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:06,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162140 states. [2019-12-18 12:58:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162140 to 153170. [2019-12-18 12:58:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153170 states. [2019-12-18 12:58:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153170 states to 153170 states and 628295 transitions. [2019-12-18 12:58:14,462 INFO L78 Accepts]: Start accepts. Automaton has 153170 states and 628295 transitions. Word has length 19 [2019-12-18 12:58:14,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:14,463 INFO L462 AbstractCegarLoop]: Abstraction has 153170 states and 628295 transitions. [2019-12-18 12:58:14,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:58:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 153170 states and 628295 transitions. [2019-12-18 12:58:14,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 12:58:14,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:14,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:14,482 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:14,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:14,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1809324800, now seen corresponding path program 1 times [2019-12-18 12:58:14,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:14,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938700086] [2019-12-18 12:58:14,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:14,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938700086] [2019-12-18 12:58:14,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:14,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:58:14,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110390891] [2019-12-18 12:58:14,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:58:14,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:14,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:58:14,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:14,553 INFO L87 Difference]: Start difference. First operand 153170 states and 628295 transitions. Second operand 3 states. [2019-12-18 12:58:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:15,256 INFO L93 Difference]: Finished difference Result 145211 states and 588530 transitions. [2019-12-18 12:58:15,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:58:15,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 12:58:15,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:15,651 INFO L225 Difference]: With dead ends: 145211 [2019-12-18 12:58:15,651 INFO L226 Difference]: Without dead ends: 145211 [2019-12-18 12:58:15,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:24,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145211 states. [2019-12-18 12:58:26,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145211 to 143797. [2019-12-18 12:58:26,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143797 states. [2019-12-18 12:58:26,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143797 states to 143797 states and 583330 transitions. [2019-12-18 12:58:26,918 INFO L78 Accepts]: Start accepts. Automaton has 143797 states and 583330 transitions. Word has length 19 [2019-12-18 12:58:26,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:26,918 INFO L462 AbstractCegarLoop]: Abstraction has 143797 states and 583330 transitions. [2019-12-18 12:58:26,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:58:26,918 INFO L276 IsEmpty]: Start isEmpty. Operand 143797 states and 583330 transitions. [2019-12-18 12:58:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 12:58:26,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:26,933 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:26,933 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:26,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:26,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1754353062, now seen corresponding path program 1 times [2019-12-18 12:58:26,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:26,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530234693] [2019-12-18 12:58:26,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:27,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530234693] [2019-12-18 12:58:27,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:27,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:58:27,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213138711] [2019-12-18 12:58:27,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:58:27,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:27,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:58:27,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:58:27,025 INFO L87 Difference]: Start difference. First operand 143797 states and 583330 transitions. Second operand 6 states. [2019-12-18 12:58:29,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:29,335 INFO L93 Difference]: Finished difference Result 179461 states and 707515 transitions. [2019-12-18 12:58:29,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:58:29,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-18 12:58:29,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:29,816 INFO L225 Difference]: With dead ends: 179461 [2019-12-18 12:58:29,817 INFO L226 Difference]: Without dead ends: 179335 [2019-12-18 12:58:29,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:58:38,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179335 states. [2019-12-18 12:58:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179335 to 144051. [2019-12-18 12:58:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144051 states. [2019-12-18 12:58:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144051 states to 144051 states and 583243 transitions. [2019-12-18 12:58:42,206 INFO L78 Accepts]: Start accepts. Automaton has 144051 states and 583243 transitions. Word has length 19 [2019-12-18 12:58:42,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:42,206 INFO L462 AbstractCegarLoop]: Abstraction has 144051 states and 583243 transitions. [2019-12-18 12:58:42,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:58:42,207 INFO L276 IsEmpty]: Start isEmpty. Operand 144051 states and 583243 transitions. [2019-12-18 12:58:42,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 12:58:42,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:42,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:42,222 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:42,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:42,223 INFO L82 PathProgramCache]: Analyzing trace with hash 422869821, now seen corresponding path program 1 times [2019-12-18 12:58:42,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:42,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862003430] [2019-12-18 12:58:42,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:42,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862003430] [2019-12-18 12:58:42,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:42,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:58:42,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678153112] [2019-12-18 12:58:42,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:58:42,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:42,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:58:42,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:58:42,296 INFO L87 Difference]: Start difference. First operand 144051 states and 583243 transitions. Second operand 4 states. [2019-12-18 12:58:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:42,573 INFO L93 Difference]: Finished difference Result 37859 states and 130356 transitions. [2019-12-18 12:58:42,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:58:42,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 12:58:42,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:42,653 INFO L225 Difference]: With dead ends: 37859 [2019-12-18 12:58:42,653 INFO L226 Difference]: Without dead ends: 29780 [2019-12-18 12:58:42,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:58:42,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29780 states. [2019-12-18 12:58:43,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29780 to 29780. [2019-12-18 12:58:43,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29780 states. [2019-12-18 12:58:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29780 states to 29780 states and 97851 transitions. [2019-12-18 12:58:43,214 INFO L78 Accepts]: Start accepts. Automaton has 29780 states and 97851 transitions. Word has length 19 [2019-12-18 12:58:43,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:43,214 INFO L462 AbstractCegarLoop]: Abstraction has 29780 states and 97851 transitions. [2019-12-18 12:58:43,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:58:43,215 INFO L276 IsEmpty]: Start isEmpty. Operand 29780 states and 97851 transitions. [2019-12-18 12:58:43,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:58:43,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:43,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:43,221 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:43,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:43,223 INFO L82 PathProgramCache]: Analyzing trace with hash -532738305, now seen corresponding path program 1 times [2019-12-18 12:58:43,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:43,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051161267] [2019-12-18 12:58:43,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:43,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051161267] [2019-12-18 12:58:43,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:43,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:58:43,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537530827] [2019-12-18 12:58:43,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:58:43,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:43,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:58:43,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:58:43,277 INFO L87 Difference]: Start difference. First operand 29780 states and 97851 transitions. Second operand 5 states. [2019-12-18 12:58:43,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:43,812 INFO L93 Difference]: Finished difference Result 39465 states and 127242 transitions. [2019-12-18 12:58:43,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:58:43,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:58:43,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:43,887 INFO L225 Difference]: With dead ends: 39465 [2019-12-18 12:58:43,887 INFO L226 Difference]: Without dead ends: 39274 [2019-12-18 12:58:43,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:58:44,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39274 states. [2019-12-18 12:58:46,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39274 to 30971. [2019-12-18 12:58:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30971 states. [2019-12-18 12:58:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30971 states to 30971 states and 101410 transitions. [2019-12-18 12:58:46,567 INFO L78 Accepts]: Start accepts. Automaton has 30971 states and 101410 transitions. Word has length 22 [2019-12-18 12:58:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:46,568 INFO L462 AbstractCegarLoop]: Abstraction has 30971 states and 101410 transitions. [2019-12-18 12:58:46,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:58:46,568 INFO L276 IsEmpty]: Start isEmpty. Operand 30971 states and 101410 transitions. [2019-12-18 12:58:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:58:46,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:46,575 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:46,575 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:46,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:46,575 INFO L82 PathProgramCache]: Analyzing trace with hash 828372869, now seen corresponding path program 1 times [2019-12-18 12:58:46,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:46,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193499507] [2019-12-18 12:58:46,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:46,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193499507] [2019-12-18 12:58:46,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:46,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:58:46,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304016448] [2019-12-18 12:58:46,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:58:46,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:46,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:58:46,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:58:46,628 INFO L87 Difference]: Start difference. First operand 30971 states and 101410 transitions. Second operand 5 states. [2019-12-18 12:58:47,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:47,107 INFO L93 Difference]: Finished difference Result 39564 states and 127608 transitions. [2019-12-18 12:58:47,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:58:47,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:58:47,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:47,172 INFO L225 Difference]: With dead ends: 39564 [2019-12-18 12:58:47,172 INFO L226 Difference]: Without dead ends: 39295 [2019-12-18 12:58:47,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:58:47,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39295 states. [2019-12-18 12:58:47,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39295 to 29549. [2019-12-18 12:58:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29549 states. [2019-12-18 12:58:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29549 states to 29549 states and 96955 transitions. [2019-12-18 12:58:47,719 INFO L78 Accepts]: Start accepts. Automaton has 29549 states and 96955 transitions. Word has length 22 [2019-12-18 12:58:47,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:47,719 INFO L462 AbstractCegarLoop]: Abstraction has 29549 states and 96955 transitions. [2019-12-18 12:58:47,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:58:47,720 INFO L276 IsEmpty]: Start isEmpty. Operand 29549 states and 96955 transitions. [2019-12-18 12:58:47,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:58:47,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:47,734 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:47,734 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:47,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:47,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1106278827, now seen corresponding path program 1 times [2019-12-18 12:58:47,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:47,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790955381] [2019-12-18 12:58:47,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:47,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:47,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790955381] [2019-12-18 12:58:47,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:47,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:58:47,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807163639] [2019-12-18 12:58:47,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:58:47,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:47,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:58:47,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:58:47,819 INFO L87 Difference]: Start difference. First operand 29549 states and 96955 transitions. Second operand 5 states. [2019-12-18 12:58:48,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:48,492 INFO L93 Difference]: Finished difference Result 40243 states and 130195 transitions. [2019-12-18 12:58:48,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:58:48,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:58:48,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:48,560 INFO L225 Difference]: With dead ends: 40243 [2019-12-18 12:58:48,560 INFO L226 Difference]: Without dead ends: 40219 [2019-12-18 12:58:48,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:58:48,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40219 states. [2019-12-18 12:58:49,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40219 to 32671. [2019-12-18 12:58:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32671 states. [2019-12-18 12:58:49,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32671 states to 32671 states and 106843 transitions. [2019-12-18 12:58:49,150 INFO L78 Accepts]: Start accepts. Automaton has 32671 states and 106843 transitions. Word has length 28 [2019-12-18 12:58:49,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:49,150 INFO L462 AbstractCegarLoop]: Abstraction has 32671 states and 106843 transitions. [2019-12-18 12:58:49,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:58:49,151 INFO L276 IsEmpty]: Start isEmpty. Operand 32671 states and 106843 transitions. [2019-12-18 12:58:49,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 12:58:49,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:49,168 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] [2019-12-18 12:58:49,168 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:49,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:49,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1126449648, now seen corresponding path program 1 times [2019-12-18 12:58:49,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:49,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880924729] [2019-12-18 12:58:49,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:49,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880924729] [2019-12-18 12:58:49,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:49,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:58:49,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498979411] [2019-12-18 12:58:49,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:58:49,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:49,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:58:49,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:58:49,245 INFO L87 Difference]: Start difference. First operand 32671 states and 106843 transitions. Second operand 5 states. [2019-12-18 12:58:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:49,651 INFO L93 Difference]: Finished difference Result 41985 states and 135178 transitions. [2019-12-18 12:58:49,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:58:49,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 12:58:49,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:49,726 INFO L225 Difference]: With dead ends: 41985 [2019-12-18 12:58:49,726 INFO L226 Difference]: Without dead ends: 41961 [2019-12-18 12:58:49,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:58:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41961 states. [2019-12-18 12:58:50,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41961 to 32060. [2019-12-18 12:58:50,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32060 states. [2019-12-18 12:58:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32060 states to 32060 states and 104673 transitions. [2019-12-18 12:58:50,661 INFO L78 Accepts]: Start accepts. Automaton has 32060 states and 104673 transitions. Word has length 29 [2019-12-18 12:58:50,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:50,662 INFO L462 AbstractCegarLoop]: Abstraction has 32060 states and 104673 transitions. [2019-12-18 12:58:50,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:58:50,662 INFO L276 IsEmpty]: Start isEmpty. Operand 32060 states and 104673 transitions. [2019-12-18 12:58:50,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 12:58:50,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:50,678 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] [2019-12-18 12:58:50,678 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:50,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:50,678 INFO L82 PathProgramCache]: Analyzing trace with hash -14540022, now seen corresponding path program 1 times [2019-12-18 12:58:50,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:50,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036541854] [2019-12-18 12:58:50,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:50,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:50,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036541854] [2019-12-18 12:58:50,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:50,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:58:50,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247721445] [2019-12-18 12:58:50,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:58:50,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:50,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:58:50,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:58:50,759 INFO L87 Difference]: Start difference. First operand 32060 states and 104673 transitions. Second operand 5 states. [2019-12-18 12:58:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:50,855 INFO L93 Difference]: Finished difference Result 13714 states and 42374 transitions. [2019-12-18 12:58:50,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:58:50,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 12:58:50,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:50,878 INFO L225 Difference]: With dead ends: 13714 [2019-12-18 12:58:50,878 INFO L226 Difference]: Without dead ends: 11900 [2019-12-18 12:58:50,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:58:50,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11900 states. [2019-12-18 12:58:51,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11900 to 11593. [2019-12-18 12:58:51,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11593 states. [2019-12-18 12:58:51,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11593 states to 11593 states and 35673 transitions. [2019-12-18 12:58:51,120 INFO L78 Accepts]: Start accepts. Automaton has 11593 states and 35673 transitions. Word has length 30 [2019-12-18 12:58:51,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:51,120 INFO L462 AbstractCegarLoop]: Abstraction has 11593 states and 35673 transitions. [2019-12-18 12:58:51,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:58:51,120 INFO L276 IsEmpty]: Start isEmpty. Operand 11593 states and 35673 transitions. [2019-12-18 12:58:51,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:58:51,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:51,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:51,133 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:51,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:51,133 INFO L82 PathProgramCache]: Analyzing trace with hash -761398124, now seen corresponding path program 1 times [2019-12-18 12:58:51,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:51,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198392383] [2019-12-18 12:58:51,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:51,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:51,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198392383] [2019-12-18 12:58:51,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:51,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:58:51,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668891591] [2019-12-18 12:58:51,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:58:51,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:51,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:58:51,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:58:51,204 INFO L87 Difference]: Start difference. First operand 11593 states and 35673 transitions. Second operand 6 states. [2019-12-18 12:58:51,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:51,691 INFO L93 Difference]: Finished difference Result 14689 states and 43755 transitions. [2019-12-18 12:58:51,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:58:51,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 12:58:51,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:51,712 INFO L225 Difference]: With dead ends: 14689 [2019-12-18 12:58:51,713 INFO L226 Difference]: Without dead ends: 14687 [2019-12-18 12:58:51,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:58:51,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14687 states. [2019-12-18 12:58:51,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14687 to 11869. [2019-12-18 12:58:51,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11869 states. [2019-12-18 12:58:51,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11869 states to 11869 states and 36412 transitions. [2019-12-18 12:58:51,898 INFO L78 Accepts]: Start accepts. Automaton has 11869 states and 36412 transitions. Word has length 40 [2019-12-18 12:58:51,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:51,898 INFO L462 AbstractCegarLoop]: Abstraction has 11869 states and 36412 transitions. [2019-12-18 12:58:51,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:58:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 11869 states and 36412 transitions. [2019-12-18 12:58:51,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:58:51,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:51,912 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:51,912 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:51,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:51,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1633369453, now seen corresponding path program 1 times [2019-12-18 12:58:51,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:51,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041223115] [2019-12-18 12:58:51,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:51,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:51,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041223115] [2019-12-18 12:58:51,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:51,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:58:51,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143470486] [2019-12-18 12:58:51,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:58:51,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:51,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:58:51,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:58:51,986 INFO L87 Difference]: Start difference. First operand 11869 states and 36412 transitions. Second operand 5 states. [2019-12-18 12:58:52,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:52,443 INFO L93 Difference]: Finished difference Result 18223 states and 55480 transitions. [2019-12-18 12:58:52,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:58:52,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:58:52,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:52,469 INFO L225 Difference]: With dead ends: 18223 [2019-12-18 12:58:52,469 INFO L226 Difference]: Without dead ends: 18223 [2019-12-18 12:58:52,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:58:52,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18223 states. [2019-12-18 12:58:52,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18223 to 15984. [2019-12-18 12:58:52,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15984 states. [2019-12-18 12:58:52,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15984 states to 15984 states and 49182 transitions. [2019-12-18 12:58:52,707 INFO L78 Accepts]: Start accepts. Automaton has 15984 states and 49182 transitions. Word has length 40 [2019-12-18 12:58:52,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:52,708 INFO L462 AbstractCegarLoop]: Abstraction has 15984 states and 49182 transitions. [2019-12-18 12:58:52,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:58:52,708 INFO L276 IsEmpty]: Start isEmpty. Operand 15984 states and 49182 transitions. [2019-12-18 12:58:52,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:58:52,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:52,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:52,730 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:52,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:52,731 INFO L82 PathProgramCache]: Analyzing trace with hash -308441065, now seen corresponding path program 2 times [2019-12-18 12:58:52,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:52,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302978993] [2019-12-18 12:58:52,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:53,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:53,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302978993] [2019-12-18 12:58:53,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:53,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:58:53,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204234095] [2019-12-18 12:58:53,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:58:53,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:53,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:58:53,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:53,037 INFO L87 Difference]: Start difference. First operand 15984 states and 49182 transitions. Second operand 3 states. [2019-12-18 12:58:53,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:53,111 INFO L93 Difference]: Finished difference Result 15143 states and 45952 transitions. [2019-12-18 12:58:53,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:58:53,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 12:58:53,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:53,143 INFO L225 Difference]: With dead ends: 15143 [2019-12-18 12:58:53,144 INFO L226 Difference]: Without dead ends: 15143 [2019-12-18 12:58:53,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:53,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15143 states. [2019-12-18 12:58:53,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15143 to 14516. [2019-12-18 12:58:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14516 states. [2019-12-18 12:58:53,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14516 states to 14516 states and 44169 transitions. [2019-12-18 12:58:53,479 INFO L78 Accepts]: Start accepts. Automaton has 14516 states and 44169 transitions. Word has length 40 [2019-12-18 12:58:53,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:53,479 INFO L462 AbstractCegarLoop]: Abstraction has 14516 states and 44169 transitions. [2019-12-18 12:58:53,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:58:53,479 INFO L276 IsEmpty]: Start isEmpty. Operand 14516 states and 44169 transitions. [2019-12-18 12:58:53,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 12:58:53,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:53,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:53,502 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:53,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:53,502 INFO L82 PathProgramCache]: Analyzing trace with hash 797278347, now seen corresponding path program 1 times [2019-12-18 12:58:53,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:53,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474978044] [2019-12-18 12:58:53,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:53,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474978044] [2019-12-18 12:58:53,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:53,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:58:53,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084279102] [2019-12-18 12:58:53,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:58:53,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:53,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:58:53,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:58:53,568 INFO L87 Difference]: Start difference. First operand 14516 states and 44169 transitions. Second operand 6 states. [2019-12-18 12:58:54,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:54,079 INFO L93 Difference]: Finished difference Result 17222 states and 51134 transitions. [2019-12-18 12:58:54,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:58:54,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 12:58:54,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:54,106 INFO L225 Difference]: With dead ends: 17222 [2019-12-18 12:58:54,106 INFO L226 Difference]: Without dead ends: 17220 [2019-12-18 12:58:54,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:58:54,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17220 states. [2019-12-18 12:58:54,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17220 to 13885. [2019-12-18 12:58:54,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13885 states. [2019-12-18 12:58:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13885 states to 13885 states and 42429 transitions. [2019-12-18 12:58:54,324 INFO L78 Accepts]: Start accepts. Automaton has 13885 states and 42429 transitions. Word has length 41 [2019-12-18 12:58:54,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:54,324 INFO L462 AbstractCegarLoop]: Abstraction has 13885 states and 42429 transitions. [2019-12-18 12:58:54,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:58:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 13885 states and 42429 transitions. [2019-12-18 12:58:54,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 12:58:54,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:54,343 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:54,343 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:54,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:54,343 INFO L82 PathProgramCache]: Analyzing trace with hash 771947399, now seen corresponding path program 1 times [2019-12-18 12:58:54,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:54,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853305518] [2019-12-18 12:58:54,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:54,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853305518] [2019-12-18 12:58:54,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:54,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:58:54,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127989960] [2019-12-18 12:58:54,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:58:54,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:54,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:58:54,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:58:54,420 INFO L87 Difference]: Start difference. First operand 13885 states and 42429 transitions. Second operand 6 states. [2019-12-18 12:58:54,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:54,539 INFO L93 Difference]: Finished difference Result 12733 states and 39642 transitions. [2019-12-18 12:58:54,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:58:54,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 12:58:54,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:54,557 INFO L225 Difference]: With dead ends: 12733 [2019-12-18 12:58:54,557 INFO L226 Difference]: Without dead ends: 11550 [2019-12-18 12:58:54,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:58:54,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11550 states. [2019-12-18 12:58:54,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11550 to 11130. [2019-12-18 12:58:54,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11130 states. [2019-12-18 12:58:54,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11130 states to 11130 states and 35538 transitions. [2019-12-18 12:58:54,719 INFO L78 Accepts]: Start accepts. Automaton has 11130 states and 35538 transitions. Word has length 41 [2019-12-18 12:58:54,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:54,719 INFO L462 AbstractCegarLoop]: Abstraction has 11130 states and 35538 transitions. [2019-12-18 12:58:54,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:58:54,719 INFO L276 IsEmpty]: Start isEmpty. Operand 11130 states and 35538 transitions. [2019-12-18 12:58:54,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 12:58:54,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:54,732 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] [2019-12-18 12:58:54,732 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:54,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:54,732 INFO L82 PathProgramCache]: Analyzing trace with hash 852736153, now seen corresponding path program 1 times [2019-12-18 12:58:54,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:54,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679189943] [2019-12-18 12:58:54,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:54,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679189943] [2019-12-18 12:58:54,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:54,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:58:54,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303320401] [2019-12-18 12:58:54,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:58:54,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:54,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:58:54,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:54,786 INFO L87 Difference]: Start difference. First operand 11130 states and 35538 transitions. Second operand 3 states. [2019-12-18 12:58:54,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:54,859 INFO L93 Difference]: Finished difference Result 12575 states and 38277 transitions. [2019-12-18 12:58:54,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:58:54,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 12:58:54,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:54,876 INFO L225 Difference]: With dead ends: 12575 [2019-12-18 12:58:54,876 INFO L226 Difference]: Without dead ends: 12575 [2019-12-18 12:58:54,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:54,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12575 states. [2019-12-18 12:58:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12575 to 9907. [2019-12-18 12:58:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9907 states. [2019-12-18 12:58:55,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9907 states to 9907 states and 30647 transitions. [2019-12-18 12:58:55,034 INFO L78 Accepts]: Start accepts. Automaton has 9907 states and 30647 transitions. Word has length 56 [2019-12-18 12:58:55,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:55,034 INFO L462 AbstractCegarLoop]: Abstraction has 9907 states and 30647 transitions. [2019-12-18 12:58:55,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:58:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 9907 states and 30647 transitions. [2019-12-18 12:58:55,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 12:58:55,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:55,044 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] [2019-12-18 12:58:55,045 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:55,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:55,045 INFO L82 PathProgramCache]: Analyzing trace with hash -415784116, now seen corresponding path program 1 times [2019-12-18 12:58:55,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:55,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114124076] [2019-12-18 12:58:55,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:55,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:55,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114124076] [2019-12-18 12:58:55,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:55,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:58:55,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225642910] [2019-12-18 12:58:55,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:58:55,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:55,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:58:55,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:58:55,109 INFO L87 Difference]: Start difference. First operand 9907 states and 30647 transitions. Second operand 4 states. [2019-12-18 12:58:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:55,189 INFO L93 Difference]: Finished difference Result 16499 states and 51208 transitions. [2019-12-18 12:58:55,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:58:55,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-18 12:58:55,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:55,202 INFO L225 Difference]: With dead ends: 16499 [2019-12-18 12:58:55,203 INFO L226 Difference]: Without dead ends: 6904 [2019-12-18 12:58:55,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:58:55,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6904 states. [2019-12-18 12:58:55,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6904 to 6904. [2019-12-18 12:58:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6904 states. [2019-12-18 12:58:55,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 21383 transitions. [2019-12-18 12:58:55,574 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 21383 transitions. Word has length 56 [2019-12-18 12:58:55,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:55,574 INFO L462 AbstractCegarLoop]: Abstraction has 6904 states and 21383 transitions. [2019-12-18 12:58:55,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:58:55,574 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 21383 transitions. [2019-12-18 12:58:55,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 12:58:55,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:55,585 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] [2019-12-18 12:58:55,585 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:55,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:55,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1395977884, now seen corresponding path program 2 times [2019-12-18 12:58:55,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:55,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286963600] [2019-12-18 12:58:55,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:55,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286963600] [2019-12-18 12:58:55,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:55,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:58:55,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349216967] [2019-12-18 12:58:55,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:58:55,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:55,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:58:55,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:58:55,863 INFO L87 Difference]: Start difference. First operand 6904 states and 21383 transitions. Second operand 11 states. [2019-12-18 12:58:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:57,738 INFO L93 Difference]: Finished difference Result 14753 states and 44500 transitions. [2019-12-18 12:58:57,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 12:58:57,738 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 12:58:57,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:57,753 INFO L225 Difference]: With dead ends: 14753 [2019-12-18 12:58:57,753 INFO L226 Difference]: Without dead ends: 9207 [2019-12-18 12:58:57,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:58:57,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9207 states. [2019-12-18 12:58:57,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9207 to 8456. [2019-12-18 12:58:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8456 states. [2019-12-18 12:58:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8456 states to 8456 states and 25546 transitions. [2019-12-18 12:58:57,882 INFO L78 Accepts]: Start accepts. Automaton has 8456 states and 25546 transitions. Word has length 56 [2019-12-18 12:58:57,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:57,882 INFO L462 AbstractCegarLoop]: Abstraction has 8456 states and 25546 transitions. [2019-12-18 12:58:57,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:58:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 8456 states and 25546 transitions. [2019-12-18 12:58:57,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 12:58:57,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:57,891 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] [2019-12-18 12:58:57,891 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:57,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:57,891 INFO L82 PathProgramCache]: Analyzing trace with hash 72457218, now seen corresponding path program 3 times [2019-12-18 12:58:57,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:57,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572733351] [2019-12-18 12:58:57,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:58,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572733351] [2019-12-18 12:58:58,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:58,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:58:58,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864705881] [2019-12-18 12:58:58,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:58:58,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:58,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:58:58,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:58:58,114 INFO L87 Difference]: Start difference. First operand 8456 states and 25546 transitions. Second operand 12 states. [2019-12-18 12:58:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:59,809 INFO L93 Difference]: Finished difference Result 12639 states and 37530 transitions. [2019-12-18 12:58:59,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 12:58:59,810 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 12:58:59,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:59,824 INFO L225 Difference]: With dead ends: 12639 [2019-12-18 12:58:59,825 INFO L226 Difference]: Without dead ends: 9027 [2019-12-18 12:58:59,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2019-12-18 12:58:59,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9027 states. [2019-12-18 12:58:59,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9027 to 8402. [2019-12-18 12:58:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8402 states. [2019-12-18 12:58:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8402 states to 8402 states and 25395 transitions. [2019-12-18 12:58:59,947 INFO L78 Accepts]: Start accepts. Automaton has 8402 states and 25395 transitions. Word has length 56 [2019-12-18 12:58:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:59,947 INFO L462 AbstractCegarLoop]: Abstraction has 8402 states and 25395 transitions. [2019-12-18 12:58:59,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:58:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 8402 states and 25395 transitions. [2019-12-18 12:58:59,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 12:58:59,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:59,959 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] [2019-12-18 12:58:59,959 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:59,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:59,959 INFO L82 PathProgramCache]: Analyzing trace with hash -112232742, now seen corresponding path program 4 times [2019-12-18 12:58:59,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:59,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232048793] [2019-12-18 12:58:59,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:00,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:00,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232048793] [2019-12-18 12:59:00,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:00,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:59:00,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321710027] [2019-12-18 12:59:00,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:59:00,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:00,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:59:00,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:59:00,116 INFO L87 Difference]: Start difference. First operand 8402 states and 25395 transitions. Second operand 11 states. [2019-12-18 12:59:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:01,682 INFO L93 Difference]: Finished difference Result 13307 states and 39164 transitions. [2019-12-18 12:59:01,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 12:59:01,682 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 12:59:01,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:01,698 INFO L225 Difference]: With dead ends: 13307 [2019-12-18 12:59:01,698 INFO L226 Difference]: Without dead ends: 10374 [2019-12-18 12:59:01,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:59:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10374 states. [2019-12-18 12:59:01,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10374 to 8858. [2019-12-18 12:59:01,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8858 states. [2019-12-18 12:59:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8858 states to 8858 states and 26470 transitions. [2019-12-18 12:59:02,015 INFO L78 Accepts]: Start accepts. Automaton has 8858 states and 26470 transitions. Word has length 56 [2019-12-18 12:59:02,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:02,015 INFO L462 AbstractCegarLoop]: Abstraction has 8858 states and 26470 transitions. [2019-12-18 12:59:02,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:59:02,015 INFO L276 IsEmpty]: Start isEmpty. Operand 8858 states and 26470 transitions. [2019-12-18 12:59:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 12:59:02,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:02,024 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] [2019-12-18 12:59:02,024 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:59:02,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:02,025 INFO L82 PathProgramCache]: Analyzing trace with hash 894722750, now seen corresponding path program 5 times [2019-12-18 12:59:02,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:02,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036112679] [2019-12-18 12:59:02,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:02,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:02,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036112679] [2019-12-18 12:59:02,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:02,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:59:02,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646646621] [2019-12-18 12:59:02,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:59:02,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:02,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:59:02,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:59:02,220 INFO L87 Difference]: Start difference. First operand 8858 states and 26470 transitions. Second operand 12 states. [2019-12-18 12:59:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:03,748 INFO L93 Difference]: Finished difference Result 11588 states and 34200 transitions. [2019-12-18 12:59:03,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 12:59:03,755 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 12:59:03,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:03,768 INFO L225 Difference]: With dead ends: 11588 [2019-12-18 12:59:03,768 INFO L226 Difference]: Without dead ends: 9692 [2019-12-18 12:59:03,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2019-12-18 12:59:03,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9692 states. [2019-12-18 12:59:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9692 to 8339. [2019-12-18 12:59:03,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8339 states. [2019-12-18 12:59:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8339 states to 8339 states and 25077 transitions. [2019-12-18 12:59:03,895 INFO L78 Accepts]: Start accepts. Automaton has 8339 states and 25077 transitions. Word has length 56 [2019-12-18 12:59:03,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:03,895 INFO L462 AbstractCegarLoop]: Abstraction has 8339 states and 25077 transitions. [2019-12-18 12:59:03,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:59:03,895 INFO L276 IsEmpty]: Start isEmpty. Operand 8339 states and 25077 transitions. [2019-12-18 12:59:03,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 12:59:03,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:03,903 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] [2019-12-18 12:59:03,903 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:59:03,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:03,904 INFO L82 PathProgramCache]: Analyzing trace with hash -758590514, now seen corresponding path program 6 times [2019-12-18 12:59:03,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:03,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891081401] [2019-12-18 12:59:03,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2019-12-18 12:59:04,271 WARN L209 SmtUtils]: Removed 2 from assertion stack [2019-12-18 12:59:04,272 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 12:59:04,275 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 12:59:04,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:59:04 BasicIcfg [2019-12-18 12:59:04,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:59:04,277 INFO L168 Benchmark]: Toolchain (without parser) took 189468.96 ms. Allocated memory was 142.6 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 98.6 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 975.5 MB. Max. memory is 7.1 GB. [2019-12-18 12:59:04,278 INFO L168 Benchmark]: CDTParser took 1.35 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 12:59:04,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.89 ms. Allocated memory was 142.6 MB in the beginning and 199.2 MB in the end (delta: 56.6 MB). Free memory was 98.2 MB in the beginning and 151.1 MB in the end (delta: -52.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:59:04,282 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.18 ms. Allocated memory is still 199.2 MB. Free memory was 151.1 MB in the beginning and 148.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:59:04,284 INFO L168 Benchmark]: Boogie Preprocessor took 38.40 ms. Allocated memory is still 199.2 MB. Free memory was 148.2 MB in the beginning and 146.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:59:04,284 INFO L168 Benchmark]: RCFGBuilder took 957.83 ms. Allocated memory is still 199.2 MB. Free memory was 146.1 MB in the beginning and 99.3 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:59:04,285 INFO L168 Benchmark]: TraceAbstraction took 187574.79 ms. Allocated memory was 199.2 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 98.6 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 918.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:59:04,287 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.35 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 833.89 ms. Allocated memory was 142.6 MB in the beginning and 199.2 MB in the end (delta: 56.6 MB). Free memory was 98.2 MB in the beginning and 151.1 MB in the end (delta: -52.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.18 ms. Allocated memory is still 199.2 MB. Free memory was 151.1 MB in the beginning and 148.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.40 ms. Allocated memory is still 199.2 MB. Free memory was 148.2 MB in the beginning and 146.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 957.83 ms. Allocated memory is still 199.2 MB. Free memory was 146.1 MB in the beginning and 99.3 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 187574.79 ms. Allocated memory was 199.2 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 98.6 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 918.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 6794 VarBasedMoverChecksPositive, 260 VarBasedMoverChecksNegative, 81 SemBasedMoverChecksPositive, 256 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 73051 CheckedPairsTotal, 115 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 26 for 25ms.. - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 26 for 25ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: TIMEOUT, OverallTime: 187.3s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 53.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4340 SDtfs, 5355 SDslu, 10839 SDs, 0 SdLazy, 8578 SolverSat, 271 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 36 SyntacticMatches, 15 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173869occurred 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: 113.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 201925 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 836 NumberOfCodeBlocks, 836 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 809 ConstructedInterpolants, 0 QuantifiedInterpolants, 117284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown