/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:41:27,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:41:27,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:41:27,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:41:27,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:41:27,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:41:27,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:41:27,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:41:27,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:41:27,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:41:27,922 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:41:27,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:41:27,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:41:27,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:41:27,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:41:27,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:41:27,927 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:41:27,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:41:27,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:41:27,932 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:41:27,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:41:27,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:41:27,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:41:27,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:41:27,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:41:27,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:41:27,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:41:27,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:41:27,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:41:27,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:41:27,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:41:27,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:41:27,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:41:27,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:41:27,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:41:27,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:41:27,945 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:41:27,945 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:41:27,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:41:27,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:41:27,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:41:27,948 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:41:27,970 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:41:27,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:41:27,972 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:41:27,973 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:41:27,973 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:41:27,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:41:27,973 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:41:27,973 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:41:27,974 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:41:27,974 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:41:27,974 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:41:27,974 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:41:27,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:41:27,975 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:41:27,975 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:41:27,975 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:41:27,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:41:27,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:41:27,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:41:27,976 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:41:27,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:41:27,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:41:27,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:41:27,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:41:27,977 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:41:27,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:41:27,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:41:27,977 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:41:27,977 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:41:27,978 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:41:27,978 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:41:28,262 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:41:28,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:41:28,289 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:41:28,291 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:41:28,292 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:41:28,294 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_rmo.opt.i [2019-12-27 17:41:28,373 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/812317f4d/6df87819c3f8460690c83a5fee7b61a6/FLAG1155be947 [2019-12-27 17:41:28,977 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:41:28,978 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_rmo.opt.i [2019-12-27 17:41:29,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/812317f4d/6df87819c3f8460690c83a5fee7b61a6/FLAG1155be947 [2019-12-27 17:41:29,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/812317f4d/6df87819c3f8460690c83a5fee7b61a6 [2019-12-27 17:41:29,322 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:41:29,324 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:41:29,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:41:29,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:41:29,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:41:29,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:41:29" (1/1) ... [2019-12-27 17:41:29,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a7d1ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:29, skipping insertion in model container [2019-12-27 17:41:29,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:41:29" (1/1) ... [2019-12-27 17:41:29,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:41:29,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:41:29,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:41:29,999 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:41:30,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:41:30,162 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:41:30,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:30 WrapperNode [2019-12-27 17:41:30,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:41:30,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:41:30,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:41:30,164 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:41:30,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:30" (1/1) ... [2019-12-27 17:41:30,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:30" (1/1) ... [2019-12-27 17:41:30,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:41:30,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:41:30,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:41:30,247 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:41:30,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:30" (1/1) ... [2019-12-27 17:41:30,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:30" (1/1) ... [2019-12-27 17:41:30,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:30" (1/1) ... [2019-12-27 17:41:30,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:30" (1/1) ... [2019-12-27 17:41:30,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:30" (1/1) ... [2019-12-27 17:41:30,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:30" (1/1) ... [2019-12-27 17:41:30,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:30" (1/1) ... [2019-12-27 17:41:30,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:41:30,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:41:30,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:41:30,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:41:30,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:41:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:41:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:41:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:41:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:41:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:41:30,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:41:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:41:30,368 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:41:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:41:30,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:41:30,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:41:30,372 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:41:31,336 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:41:31,337 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:41:31,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:41:31 BoogieIcfgContainer [2019-12-27 17:41:31,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:41:31,339 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:41:31,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:41:31,342 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:41:31,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:41:29" (1/3) ... [2019-12-27 17:41:31,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3e1868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:41:31, skipping insertion in model container [2019-12-27 17:41:31,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:30" (2/3) ... [2019-12-27 17:41:31,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3e1868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:41:31, skipping insertion in model container [2019-12-27 17:41:31,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:41:31" (3/3) ... [2019-12-27 17:41:31,346 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_rmo.opt.i [2019-12-27 17:41:31,356 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:41:31,356 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:41:31,364 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:41:31,365 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:41:31,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,409 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,409 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,440 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,440 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,440 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,440 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,440 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,467 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,469 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,478 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,480 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,482 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:31,497 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:41:31,518 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:41:31,518 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:41:31,518 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:41:31,518 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:41:31,518 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:41:31,518 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:41:31,519 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:41:31,519 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:41:31,537 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-27 17:41:31,539 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 17:41:31,713 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 17:41:31,714 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:41:31,770 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 17:41:31,878 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 17:41:32,000 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 17:41:32,001 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:41:32,023 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 17:41:32,075 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-27 17:41:32,076 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:41:39,909 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 17:41:40,029 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 17:41:40,130 INFO L206 etLargeBlockEncoding]: Checked pairs total: 326763 [2019-12-27 17:41:40,131 INFO L214 etLargeBlockEncoding]: Total number of compositions: 143 [2019-12-27 17:41:40,134 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 193 transitions [2019-12-27 17:41:54,014 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 116492 states. [2019-12-27 17:41:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 116492 states. [2019-12-27 17:41:54,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 17:41:54,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:54,022 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 17:41:54,022 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:54,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:54,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1351330582, now seen corresponding path program 1 times [2019-12-27 17:41:54,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:54,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618611445] [2019-12-27 17:41:54,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:54,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:41:54,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618611445] [2019-12-27 17:41:54,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:54,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:41:54,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1137402358] [2019-12-27 17:41:54,316 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:54,320 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:54,332 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 17:41:54,333 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:54,335 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:41:54,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:41:54,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:54,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:41:54,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:41:54,348 INFO L87 Difference]: Start difference. First operand 116492 states. Second operand 3 states. [2019-12-27 17:41:57,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:57,312 INFO L93 Difference]: Finished difference Result 116456 states and 442542 transitions. [2019-12-27 17:41:57,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:41:57,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 17:41:57,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:57,981 INFO L225 Difference]: With dead ends: 116456 [2019-12-27 17:41:57,981 INFO L226 Difference]: Without dead ends: 114036 [2019-12-27 17:41:57,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:42:03,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114036 states. [2019-12-27 17:42:07,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114036 to 114036. [2019-12-27 17:42:07,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114036 states. [2019-12-27 17:42:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114036 states to 114036 states and 433940 transitions. [2019-12-27 17:42:11,927 INFO L78 Accepts]: Start accepts. Automaton has 114036 states and 433940 transitions. Word has length 5 [2019-12-27 17:42:11,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:11,928 INFO L462 AbstractCegarLoop]: Abstraction has 114036 states and 433940 transitions. [2019-12-27 17:42:11,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:42:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 114036 states and 433940 transitions. [2019-12-27 17:42:11,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:42:11,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:11,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:11,936 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:11,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:11,936 INFO L82 PathProgramCache]: Analyzing trace with hash -168516540, now seen corresponding path program 1 times [2019-12-27 17:42:11,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:11,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238925300] [2019-12-27 17:42:11,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:12,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238925300] [2019-12-27 17:42:12,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:12,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:42:12,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1501425923] [2019-12-27 17:42:12,038 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:12,040 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:12,044 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 17:42:12,044 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:12,091 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:42:12,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:42:12,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:12,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:42:12,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:42:12,094 INFO L87 Difference]: Start difference. First operand 114036 states and 433940 transitions. Second operand 5 states. [2019-12-27 17:42:13,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:13,326 INFO L93 Difference]: Finished difference Result 152998 states and 565528 transitions. [2019-12-27 17:42:13,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:42:13,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 17:42:13,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:13,728 INFO L225 Difference]: With dead ends: 152998 [2019-12-27 17:42:13,728 INFO L226 Difference]: Without dead ends: 152998 [2019-12-27 17:42:13,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:23,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152998 states. [2019-12-27 17:42:25,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152998 to 152836. [2019-12-27 17:42:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152836 states. [2019-12-27 17:42:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152836 states to 152836 states and 565076 transitions. [2019-12-27 17:42:26,371 INFO L78 Accepts]: Start accepts. Automaton has 152836 states and 565076 transitions. Word has length 11 [2019-12-27 17:42:26,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:26,371 INFO L462 AbstractCegarLoop]: Abstraction has 152836 states and 565076 transitions. [2019-12-27 17:42:26,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:42:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 152836 states and 565076 transitions. [2019-12-27 17:42:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:42:26,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:26,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:26,376 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:26,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:26,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1184191968, now seen corresponding path program 1 times [2019-12-27 17:42:26,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:26,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090851672] [2019-12-27 17:42:26,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:26,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090851672] [2019-12-27 17:42:26,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:26,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:42:26,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1024709035] [2019-12-27 17:42:26,453 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:26,454 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:26,455 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:42:26,455 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:26,455 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:42:26,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:42:26,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:26,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:42:26,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:42:26,456 INFO L87 Difference]: Start difference. First operand 152836 states and 565076 transitions. Second operand 4 states. [2019-12-27 17:42:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:32,427 INFO L93 Difference]: Finished difference Result 198503 states and 719540 transitions. [2019-12-27 17:42:32,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:42:32,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:42:32,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:33,104 INFO L225 Difference]: With dead ends: 198503 [2019-12-27 17:42:33,105 INFO L226 Difference]: Without dead ends: 198503 [2019-12-27 17:42:33,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:42:39,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198503 states. [2019-12-27 17:42:43,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198503 to 184484. [2019-12-27 17:42:43,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184484 states. [2019-12-27 17:42:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184484 states to 184484 states and 671271 transitions. [2019-12-27 17:42:43,951 INFO L78 Accepts]: Start accepts. Automaton has 184484 states and 671271 transitions. Word has length 11 [2019-12-27 17:42:43,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:43,951 INFO L462 AbstractCegarLoop]: Abstraction has 184484 states and 671271 transitions. [2019-12-27 17:42:43,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:42:43,952 INFO L276 IsEmpty]: Start isEmpty. Operand 184484 states and 671271 transitions. [2019-12-27 17:42:43,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 17:42:43,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:43,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:43,958 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:43,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:43,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1389779890, now seen corresponding path program 1 times [2019-12-27 17:42:43,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:43,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673433410] [2019-12-27 17:42:43,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:44,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:44,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673433410] [2019-12-27 17:42:44,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:44,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:42:44,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2082833448] [2019-12-27 17:42:44,073 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:44,075 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:44,080 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 65 transitions. [2019-12-27 17:42:44,080 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:44,130 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 17:42:44,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:42:44,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:44,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:42:44,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:44,131 INFO L87 Difference]: Start difference. First operand 184484 states and 671271 transitions. Second operand 6 states. [2019-12-27 17:42:44,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:44,693 INFO L93 Difference]: Finished difference Result 12803 states and 35243 transitions. [2019-12-27 17:42:44,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:42:44,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 17:42:44,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:44,709 INFO L225 Difference]: With dead ends: 12803 [2019-12-27 17:42:44,709 INFO L226 Difference]: Without dead ends: 9283 [2019-12-27 17:42:44,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:42:44,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9283 states. [2019-12-27 17:42:44,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9283 to 8738. [2019-12-27 17:42:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8738 states. [2019-12-27 17:42:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8738 states to 8738 states and 21907 transitions. [2019-12-27 17:42:44,827 INFO L78 Accepts]: Start accepts. Automaton has 8738 states and 21907 transitions. Word has length 17 [2019-12-27 17:42:44,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:44,827 INFO L462 AbstractCegarLoop]: Abstraction has 8738 states and 21907 transitions. [2019-12-27 17:42:44,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:42:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 8738 states and 21907 transitions. [2019-12-27 17:42:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:42:44,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:44,829 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:44,830 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:44,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:44,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1044109860, now seen corresponding path program 1 times [2019-12-27 17:42:44,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:44,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598017660] [2019-12-27 17:42:44,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:44,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598017660] [2019-12-27 17:42:44,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:44,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:42:44,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1078956565] [2019-12-27 17:42:44,995 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:44,998 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:45,006 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 105 transitions. [2019-12-27 17:42:45,007 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:45,125 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:42:45,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:42:45,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:45,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:42:45,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:42:45,126 INFO L87 Difference]: Start difference. First operand 8738 states and 21907 transitions. Second operand 9 states. [2019-12-27 17:42:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:46,587 INFO L93 Difference]: Finished difference Result 10286 states and 25434 transitions. [2019-12-27 17:42:46,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 17:42:46,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 17:42:46,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:46,606 INFO L225 Difference]: With dead ends: 10286 [2019-12-27 17:42:46,606 INFO L226 Difference]: Without dead ends: 10286 [2019-12-27 17:42:46,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:42:46,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10286 states. [2019-12-27 17:42:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10286 to 10191. [2019-12-27 17:42:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10191 states. [2019-12-27 17:42:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10191 states to 10191 states and 25249 transitions. [2019-12-27 17:42:46,785 INFO L78 Accepts]: Start accepts. Automaton has 10191 states and 25249 transitions. Word has length 25 [2019-12-27 17:42:46,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:46,787 INFO L462 AbstractCegarLoop]: Abstraction has 10191 states and 25249 transitions. [2019-12-27 17:42:46,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:42:46,787 INFO L276 IsEmpty]: Start isEmpty. Operand 10191 states and 25249 transitions. [2019-12-27 17:42:46,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 17:42:46,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:46,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:46,794 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:46,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:46,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1864535946, now seen corresponding path program 1 times [2019-12-27 17:42:46,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:46,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077044459] [2019-12-27 17:42:46,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:46,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:46,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077044459] [2019-12-27 17:42:46,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:46,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:42:46,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [12727978] [2019-12-27 17:42:46,946 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:46,952 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:46,982 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 105 states and 170 transitions. [2019-12-27 17:42:46,982 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:47,068 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:42:47,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:42:47,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:47,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:42:47,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:42:47,070 INFO L87 Difference]: Start difference. First operand 10191 states and 25249 transitions. Second operand 9 states. [2019-12-27 17:42:48,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:48,425 INFO L93 Difference]: Finished difference Result 11186 states and 27316 transitions. [2019-12-27 17:42:48,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:42:48,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-27 17:42:48,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:48,439 INFO L225 Difference]: With dead ends: 11186 [2019-12-27 17:42:48,440 INFO L226 Difference]: Without dead ends: 11138 [2019-12-27 17:42:48,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:42:48,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11138 states. [2019-12-27 17:42:48,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11138 to 10951. [2019-12-27 17:42:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10951 states. [2019-12-27 17:42:48,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10951 states to 10951 states and 26866 transitions. [2019-12-27 17:42:48,986 INFO L78 Accepts]: Start accepts. Automaton has 10951 states and 26866 transitions. Word has length 38 [2019-12-27 17:42:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:48,986 INFO L462 AbstractCegarLoop]: Abstraction has 10951 states and 26866 transitions. [2019-12-27 17:42:48,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:42:48,987 INFO L276 IsEmpty]: Start isEmpty. Operand 10951 states and 26866 transitions. [2019-12-27 17:42:48,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 17:42:48,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:48,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:48,998 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:48,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:48,998 INFO L82 PathProgramCache]: Analyzing trace with hash -555471960, now seen corresponding path program 1 times [2019-12-27 17:42:48,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:48,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734458325] [2019-12-27 17:42:48,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:49,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734458325] [2019-12-27 17:42:49,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:49,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:42:49,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [416327554] [2019-12-27 17:42:49,106 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:49,118 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:49,179 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 206 transitions. [2019-12-27 17:42:49,179 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:49,201 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:42:49,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:42:49,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:49,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:42:49,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:49,202 INFO L87 Difference]: Start difference. First operand 10951 states and 26866 transitions. Second operand 6 states. [2019-12-27 17:42:49,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:49,263 INFO L93 Difference]: Finished difference Result 4762 states and 11299 transitions. [2019-12-27 17:42:49,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:42:49,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-12-27 17:42:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:49,269 INFO L225 Difference]: With dead ends: 4762 [2019-12-27 17:42:49,270 INFO L226 Difference]: Without dead ends: 4575 [2019-12-27 17:42:49,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:42:49,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2019-12-27 17:42:49,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4507. [2019-12-27 17:42:49,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4507 states. [2019-12-27 17:42:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4507 states to 4507 states and 10763 transitions. [2019-12-27 17:42:49,322 INFO L78 Accepts]: Start accepts. Automaton has 4507 states and 10763 transitions. Word has length 50 [2019-12-27 17:42:49,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:49,323 INFO L462 AbstractCegarLoop]: Abstraction has 4507 states and 10763 transitions. [2019-12-27 17:42:49,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:42:49,323 INFO L276 IsEmpty]: Start isEmpty. Operand 4507 states and 10763 transitions. [2019-12-27 17:42:49,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:42:49,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:49,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:49,332 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:49,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:49,332 INFO L82 PathProgramCache]: Analyzing trace with hash 608253419, now seen corresponding path program 1 times [2019-12-27 17:42:49,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:49,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698552662] [2019-12-27 17:42:49,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:49,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:49,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698552662] [2019-12-27 17:42:49,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:49,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:42:49,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [17608363] [2019-12-27 17:42:49,460 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:49,507 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:49,688 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 170 transitions. [2019-12-27 17:42:49,688 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:49,690 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:42:49,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:42:49,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:49,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:42:49,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:49,692 INFO L87 Difference]: Start difference. First operand 4507 states and 10763 transitions. Second operand 6 states. [2019-12-27 17:42:50,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:50,491 INFO L93 Difference]: Finished difference Result 6100 states and 14382 transitions. [2019-12-27 17:42:50,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:42:50,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 17:42:50,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:50,498 INFO L225 Difference]: With dead ends: 6100 [2019-12-27 17:42:50,499 INFO L226 Difference]: Without dead ends: 6100 [2019-12-27 17:42:50,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:42:50,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6100 states. [2019-12-27 17:42:50,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6100 to 5765. [2019-12-27 17:42:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2019-12-27 17:42:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 13657 transitions. [2019-12-27 17:42:50,576 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 13657 transitions. Word has length 94 [2019-12-27 17:42:50,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:50,576 INFO L462 AbstractCegarLoop]: Abstraction has 5765 states and 13657 transitions. [2019-12-27 17:42:50,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:42:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 13657 transitions. [2019-12-27 17:42:50,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:42:50,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:50,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:50,585 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:50,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:50,585 INFO L82 PathProgramCache]: Analyzing trace with hash 577720363, now seen corresponding path program 2 times [2019-12-27 17:42:50,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:50,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130007000] [2019-12-27 17:42:50,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:50,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:50,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130007000] [2019-12-27 17:42:50,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:50,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:42:50,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [995125937] [2019-12-27 17:42:50,739 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:50,776 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:50,906 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 202 transitions. [2019-12-27 17:42:50,906 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:50,919 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:42:50,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:42:50,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:50,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:42:50,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:42:50,920 INFO L87 Difference]: Start difference. First operand 5765 states and 13657 transitions. Second operand 8 states. [2019-12-27 17:42:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:52,971 INFO L93 Difference]: Finished difference Result 11959 states and 26581 transitions. [2019-12-27 17:42:52,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 17:42:52,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-12-27 17:42:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:52,993 INFO L225 Difference]: With dead ends: 11959 [2019-12-27 17:42:52,993 INFO L226 Difference]: Without dead ends: 11959 [2019-12-27 17:42:52,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2019-12-27 17:42:53,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11959 states. [2019-12-27 17:42:53,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11959 to 9563. [2019-12-27 17:42:53,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9563 states. [2019-12-27 17:42:53,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9563 states to 9563 states and 21687 transitions. [2019-12-27 17:42:53,616 INFO L78 Accepts]: Start accepts. Automaton has 9563 states and 21687 transitions. Word has length 94 [2019-12-27 17:42:53,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:53,617 INFO L462 AbstractCegarLoop]: Abstraction has 9563 states and 21687 transitions. [2019-12-27 17:42:53,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:42:53,617 INFO L276 IsEmpty]: Start isEmpty. Operand 9563 states and 21687 transitions. [2019-12-27 17:42:53,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:42:53,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:53,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:53,637 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:53,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:53,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1726596845, now seen corresponding path program 3 times [2019-12-27 17:42:53,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:53,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015042480] [2019-12-27 17:42:53,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:53,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015042480] [2019-12-27 17:42:53,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:53,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:42:53,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1635690426] [2019-12-27 17:42:53,793 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:53,831 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:54,008 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 185 transitions. [2019-12-27 17:42:54,009 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:54,011 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:42:54,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:42:54,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:54,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:42:54,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:42:54,012 INFO L87 Difference]: Start difference. First operand 9563 states and 21687 transitions. Second operand 5 states. [2019-12-27 17:42:54,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:54,555 INFO L93 Difference]: Finished difference Result 10326 states and 23243 transitions. [2019-12-27 17:42:54,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:42:54,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-27 17:42:54,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:54,569 INFO L225 Difference]: With dead ends: 10326 [2019-12-27 17:42:54,569 INFO L226 Difference]: Without dead ends: 10326 [2019-12-27 17:42:54,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:54,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10326 states. [2019-12-27 17:42:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10326 to 9685. [2019-12-27 17:42:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9685 states. [2019-12-27 17:42:54,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9685 states to 9685 states and 21977 transitions. [2019-12-27 17:42:54,692 INFO L78 Accepts]: Start accepts. Automaton has 9685 states and 21977 transitions. Word has length 94 [2019-12-27 17:42:54,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:54,693 INFO L462 AbstractCegarLoop]: Abstraction has 9685 states and 21977 transitions. [2019-12-27 17:42:54,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:42:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand 9685 states and 21977 transitions. [2019-12-27 17:42:54,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:42:54,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:54,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:54,705 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:54,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:54,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2017255555, now seen corresponding path program 4 times [2019-12-27 17:42:54,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:54,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153029989] [2019-12-27 17:42:54,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:54,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-27 17:42:54,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153029989] [2019-12-27 17:42:54,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:54,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:42:54,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1637541994] [2019-12-27 17:42:54,818 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:54,854 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:55,010 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 176 states and 240 transitions. [2019-12-27 17:42:55,011 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:55,011 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:42:55,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:42:55,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:55,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:42:55,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:55,012 INFO L87 Difference]: Start difference. First operand 9685 states and 21977 transitions. Second operand 6 states. [2019-12-27 17:42:55,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:55,665 INFO L93 Difference]: Finished difference Result 10615 states and 23848 transitions. [2019-12-27 17:42:55,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:42:55,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 17:42:55,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:55,678 INFO L225 Difference]: With dead ends: 10615 [2019-12-27 17:42:55,678 INFO L226 Difference]: Without dead ends: 10615 [2019-12-27 17:42:55,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:42:55,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10615 states. [2019-12-27 17:42:55,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10615 to 10275. [2019-12-27 17:42:55,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10275 states. [2019-12-27 17:42:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10275 states to 10275 states and 23193 transitions. [2019-12-27 17:42:55,787 INFO L78 Accepts]: Start accepts. Automaton has 10275 states and 23193 transitions. Word has length 94 [2019-12-27 17:42:55,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:55,787 INFO L462 AbstractCegarLoop]: Abstraction has 10275 states and 23193 transitions. [2019-12-27 17:42:55,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:42:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 10275 states and 23193 transitions. [2019-12-27 17:42:55,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:42:55,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:55,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:55,801 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:55,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:55,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1442306179, now seen corresponding path program 5 times [2019-12-27 17:42:55,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:55,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174825239] [2019-12-27 17:42:55,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:55,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:55,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174825239] [2019-12-27 17:42:55,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:55,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:42:55,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2099658752] [2019-12-27 17:42:55,927 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:55,961 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:56,597 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 171 states and 232 transitions. [2019-12-27 17:42:56,597 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:56,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:42:56,642 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:42:56,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:42:56,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:56,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:42:56,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:42:56,644 INFO L87 Difference]: Start difference. First operand 10275 states and 23193 transitions. Second operand 9 states. [2019-12-27 17:43:00,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:00,015 INFO L93 Difference]: Finished difference Result 38141 states and 85824 transitions. [2019-12-27 17:43:00,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 17:43:00,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-12-27 17:43:00,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:00,056 INFO L225 Difference]: With dead ends: 38141 [2019-12-27 17:43:00,056 INFO L226 Difference]: Without dead ends: 38141 [2019-12-27 17:43:00,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=242, Invalid=628, Unknown=0, NotChecked=0, Total=870 [2019-12-27 17:43:00,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38141 states. [2019-12-27 17:43:00,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38141 to 14848. [2019-12-27 17:43:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14848 states. [2019-12-27 17:43:00,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14848 states to 14848 states and 34091 transitions. [2019-12-27 17:43:00,345 INFO L78 Accepts]: Start accepts. Automaton has 14848 states and 34091 transitions. Word has length 94 [2019-12-27 17:43:00,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:00,345 INFO L462 AbstractCegarLoop]: Abstraction has 14848 states and 34091 transitions. [2019-12-27 17:43:00,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:43:00,345 INFO L276 IsEmpty]: Start isEmpty. Operand 14848 states and 34091 transitions. [2019-12-27 17:43:00,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:43:00,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:00,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:00,365 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:00,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:00,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1949821147, now seen corresponding path program 6 times [2019-12-27 17:43:00,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:00,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481512064] [2019-12-27 17:43:00,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:00,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:00,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481512064] [2019-12-27 17:43:00,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:00,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:43:00,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2144746997] [2019-12-27 17:43:00,476 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:00,503 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:00,664 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 210 transitions. [2019-12-27 17:43:00,665 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:00,665 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:43:00,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:43:00,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:00,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:43:00,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:43:00,666 INFO L87 Difference]: Start difference. First operand 14848 states and 34091 transitions. Second operand 6 states. [2019-12-27 17:43:01,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:01,248 INFO L93 Difference]: Finished difference Result 15882 states and 36146 transitions. [2019-12-27 17:43:01,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:43:01,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 17:43:01,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:01,266 INFO L225 Difference]: With dead ends: 15882 [2019-12-27 17:43:01,266 INFO L226 Difference]: Without dead ends: 15882 [2019-12-27 17:43:01,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:43:01,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15882 states. [2019-12-27 17:43:01,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15882 to 14886. [2019-12-27 17:43:01,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14886 states. [2019-12-27 17:43:01,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14886 states to 14886 states and 34165 transitions. [2019-12-27 17:43:01,839 INFO L78 Accepts]: Start accepts. Automaton has 14886 states and 34165 transitions. Word has length 94 [2019-12-27 17:43:01,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:01,839 INFO L462 AbstractCegarLoop]: Abstraction has 14886 states and 34165 transitions. [2019-12-27 17:43:01,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:43:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 14886 states and 34165 transitions. [2019-12-27 17:43:01,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:43:01,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:01,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:01,854 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:01,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:01,854 INFO L82 PathProgramCache]: Analyzing trace with hash -171487305, now seen corresponding path program 7 times [2019-12-27 17:43:01,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:01,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857687355] [2019-12-27 17:43:01,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:01,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:01,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857687355] [2019-12-27 17:43:01,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:01,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:43:01,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1837241266] [2019-12-27 17:43:01,962 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:01,986 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:02,162 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 173 transitions. [2019-12-27 17:43:02,163 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:02,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:02,211 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:43:02,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:43:02,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:02,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:43:02,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:43:02,213 INFO L87 Difference]: Start difference. First operand 14886 states and 34165 transitions. Second operand 8 states. [2019-12-27 17:43:03,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:03,505 INFO L93 Difference]: Finished difference Result 19017 states and 43005 transitions. [2019-12-27 17:43:03,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:43:03,505 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-12-27 17:43:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:03,525 INFO L225 Difference]: With dead ends: 19017 [2019-12-27 17:43:03,526 INFO L226 Difference]: Without dead ends: 19017 [2019-12-27 17:43:03,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:43:03,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19017 states. [2019-12-27 17:43:03,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19017 to 14931. [2019-12-27 17:43:03,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14931 states. [2019-12-27 17:43:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14931 states to 14931 states and 34276 transitions. [2019-12-27 17:43:03,715 INFO L78 Accepts]: Start accepts. Automaton has 14931 states and 34276 transitions. Word has length 94 [2019-12-27 17:43:03,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:03,715 INFO L462 AbstractCegarLoop]: Abstraction has 14931 states and 34276 transitions. [2019-12-27 17:43:03,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:43:03,715 INFO L276 IsEmpty]: Start isEmpty. Operand 14931 states and 34276 transitions. [2019-12-27 17:43:03,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:43:03,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:03,735 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:03,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:03,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1986577122, now seen corresponding path program 1 times [2019-12-27 17:43:03,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:03,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201061812] [2019-12-27 17:43:03,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:03,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:03,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201061812] [2019-12-27 17:43:03,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:03,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:43:03,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2025277099] [2019-12-27 17:43:03,849 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:03,873 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:04,044 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 165 states and 228 transitions. [2019-12-27 17:43:04,044 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:04,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:04,077 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:43:04,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:43:04,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:04,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:43:04,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:43:04,079 INFO L87 Difference]: Start difference. First operand 14931 states and 34276 transitions. Second operand 8 states. [2019-12-27 17:43:05,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:05,076 INFO L93 Difference]: Finished difference Result 16534 states and 37536 transitions. [2019-12-27 17:43:05,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:43:05,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-27 17:43:05,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:05,095 INFO L225 Difference]: With dead ends: 16534 [2019-12-27 17:43:05,095 INFO L226 Difference]: Without dead ends: 16534 [2019-12-27 17:43:05,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:43:05,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16534 states. [2019-12-27 17:43:05,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16534 to 15012. [2019-12-27 17:43:05,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15012 states. [2019-12-27 17:43:05,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15012 states to 15012 states and 34465 transitions. [2019-12-27 17:43:05,276 INFO L78 Accepts]: Start accepts. Automaton has 15012 states and 34465 transitions. Word has length 95 [2019-12-27 17:43:05,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:05,276 INFO L462 AbstractCegarLoop]: Abstraction has 15012 states and 34465 transitions. [2019-12-27 17:43:05,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:43:05,277 INFO L276 IsEmpty]: Start isEmpty. Operand 15012 states and 34465 transitions. [2019-12-27 17:43:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:43:05,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:05,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:05,295 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:05,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:05,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1103429564, now seen corresponding path program 2 times [2019-12-27 17:43:05,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:05,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909369345] [2019-12-27 17:43:05,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:05,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909369345] [2019-12-27 17:43:05,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:05,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:43:05,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [779089059] [2019-12-27 17:43:05,812 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:05,836 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:06,004 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 185 transitions. [2019-12-27 17:43:06,005 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:06,005 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:43:06,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:43:06,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:06,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:43:06,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:43:06,006 INFO L87 Difference]: Start difference. First operand 15012 states and 34465 transitions. Second operand 3 states. [2019-12-27 17:43:06,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:06,086 INFO L93 Difference]: Finished difference Result 15012 states and 34464 transitions. [2019-12-27 17:43:06,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:43:06,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-27 17:43:06,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:06,104 INFO L225 Difference]: With dead ends: 15012 [2019-12-27 17:43:06,104 INFO L226 Difference]: Without dead ends: 15012 [2019-12-27 17:43:06,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:43:06,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15012 states. [2019-12-27 17:43:06,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15012 to 13542. [2019-12-27 17:43:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13542 states. [2019-12-27 17:43:06,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13542 states to 13542 states and 31392 transitions. [2019-12-27 17:43:06,266 INFO L78 Accepts]: Start accepts. Automaton has 13542 states and 31392 transitions. Word has length 95 [2019-12-27 17:43:06,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:06,266 INFO L462 AbstractCegarLoop]: Abstraction has 13542 states and 31392 transitions. [2019-12-27 17:43:06,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:43:06,266 INFO L276 IsEmpty]: Start isEmpty. Operand 13542 states and 31392 transitions. [2019-12-27 17:43:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:43:06,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:06,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:06,284 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:06,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:06,284 INFO L82 PathProgramCache]: Analyzing trace with hash -524016775, now seen corresponding path program 1 times [2019-12-27 17:43:06,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:06,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386754223] [2019-12-27 17:43:06,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:06,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386754223] [2019-12-27 17:43:06,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:06,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:43:06,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1275042393] [2019-12-27 17:43:06,440 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:06,464 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:06,581 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 186 transitions. [2019-12-27 17:43:06,581 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:06,589 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:43:06,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:43:06,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:06,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:43:06,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:43:06,591 INFO L87 Difference]: Start difference. First operand 13542 states and 31392 transitions. Second operand 9 states. [2019-12-27 17:43:07,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:07,385 INFO L93 Difference]: Finished difference Result 22371 states and 51191 transitions. [2019-12-27 17:43:07,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:43:07,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-27 17:43:07,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:07,407 INFO L225 Difference]: With dead ends: 22371 [2019-12-27 17:43:07,407 INFO L226 Difference]: Without dead ends: 18832 [2019-12-27 17:43:07,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-27 17:43:07,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18832 states. [2019-12-27 17:43:07,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18832 to 15782. [2019-12-27 17:43:07,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15782 states. [2019-12-27 17:43:07,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15782 states to 15782 states and 36306 transitions. [2019-12-27 17:43:07,598 INFO L78 Accepts]: Start accepts. Automaton has 15782 states and 36306 transitions. Word has length 95 [2019-12-27 17:43:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:07,598 INFO L462 AbstractCegarLoop]: Abstraction has 15782 states and 36306 transitions. [2019-12-27 17:43:07,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:43:07,599 INFO L276 IsEmpty]: Start isEmpty. Operand 15782 states and 36306 transitions. [2019-12-27 17:43:07,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:43:07,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:07,612 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:07,612 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:07,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:07,613 INFO L82 PathProgramCache]: Analyzing trace with hash 283458299, now seen corresponding path program 2 times [2019-12-27 17:43:07,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:07,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559196229] [2019-12-27 17:43:07,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:07,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559196229] [2019-12-27 17:43:07,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:07,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:43:07,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1010791717] [2019-12-27 17:43:07,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:07,813 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:08,396 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 174 transitions. [2019-12-27 17:43:08,396 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:08,403 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:43:08,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:43:08,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:08,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:43:08,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:43:08,405 INFO L87 Difference]: Start difference. First operand 15782 states and 36306 transitions. Second operand 10 states. [2019-12-27 17:43:09,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:09,469 INFO L93 Difference]: Finished difference Result 25261 states and 57834 transitions. [2019-12-27 17:43:09,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 17:43:09,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-27 17:43:09,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:09,494 INFO L225 Difference]: With dead ends: 25261 [2019-12-27 17:43:09,494 INFO L226 Difference]: Without dead ends: 22625 [2019-12-27 17:43:09,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:43:09,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22625 states. [2019-12-27 17:43:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22625 to 16474. [2019-12-27 17:43:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16474 states. [2019-12-27 17:43:09,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16474 states to 16474 states and 38020 transitions. [2019-12-27 17:43:09,703 INFO L78 Accepts]: Start accepts. Automaton has 16474 states and 38020 transitions. Word has length 95 [2019-12-27 17:43:09,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:09,704 INFO L462 AbstractCegarLoop]: Abstraction has 16474 states and 38020 transitions. [2019-12-27 17:43:09,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:43:09,704 INFO L276 IsEmpty]: Start isEmpty. Operand 16474 states and 38020 transitions. [2019-12-27 17:43:09,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:43:09,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:09,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:09,718 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:09,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:09,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1595101307, now seen corresponding path program 3 times [2019-12-27 17:43:09,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:09,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549212135] [2019-12-27 17:43:09,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:09,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549212135] [2019-12-27 17:43:09,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:09,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:43:09,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [236635635] [2019-12-27 17:43:09,894 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:09,917 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:10,060 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 181 transitions. [2019-12-27 17:43:10,060 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:10,067 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:43:10,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:43:10,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:10,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:43:10,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:43:10,069 INFO L87 Difference]: Start difference. First operand 16474 states and 38020 transitions. Second operand 10 states. [2019-12-27 17:43:11,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:11,019 INFO L93 Difference]: Finished difference Result 22638 states and 51744 transitions. [2019-12-27 17:43:11,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 17:43:11,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-27 17:43:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:11,039 INFO L225 Difference]: With dead ends: 22638 [2019-12-27 17:43:11,039 INFO L226 Difference]: Without dead ends: 17383 [2019-12-27 17:43:11,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:43:11,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17383 states. [2019-12-27 17:43:11,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17383 to 14845. [2019-12-27 17:43:11,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14845 states. [2019-12-27 17:43:11,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14845 states to 14845 states and 34162 transitions. [2019-12-27 17:43:11,221 INFO L78 Accepts]: Start accepts. Automaton has 14845 states and 34162 transitions. Word has length 95 [2019-12-27 17:43:11,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:11,221 INFO L462 AbstractCegarLoop]: Abstraction has 14845 states and 34162 transitions. [2019-12-27 17:43:11,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:43:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 14845 states and 34162 transitions. [2019-12-27 17:43:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:43:11,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:11,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:11,234 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:11,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:11,235 INFO L82 PathProgramCache]: Analyzing trace with hash 409927027, now seen corresponding path program 4 times [2019-12-27 17:43:11,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:11,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995249025] [2019-12-27 17:43:11,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:11,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:11,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995249025] [2019-12-27 17:43:11,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:11,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:43:11,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [87326866] [2019-12-27 17:43:11,320 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:11,344 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:11,561 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 219 transitions. [2019-12-27 17:43:11,561 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:11,564 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:43:11,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:43:11,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:11,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:43:11,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:43:11,566 INFO L87 Difference]: Start difference. First operand 14845 states and 34162 transitions. Second operand 6 states. [2019-12-27 17:43:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:12,430 INFO L93 Difference]: Finished difference Result 15752 states and 35962 transitions. [2019-12-27 17:43:12,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:43:12,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 17:43:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:12,452 INFO L225 Difference]: With dead ends: 15752 [2019-12-27 17:43:12,452 INFO L226 Difference]: Without dead ends: 15752 [2019-12-27 17:43:12,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:43:12,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15752 states. [2019-12-27 17:43:13,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15752 to 15042. [2019-12-27 17:43:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15042 states. [2019-12-27 17:43:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15042 states to 15042 states and 34563 transitions. [2019-12-27 17:43:13,047 INFO L78 Accepts]: Start accepts. Automaton has 15042 states and 34563 transitions. Word has length 95 [2019-12-27 17:43:13,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:13,047 INFO L462 AbstractCegarLoop]: Abstraction has 15042 states and 34563 transitions. [2019-12-27 17:43:13,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:43:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 15042 states and 34563 transitions. [2019-12-27 17:43:13,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:43:13,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:13,061 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:13,061 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:13,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:13,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1173487395, now seen corresponding path program 5 times [2019-12-27 17:43:13,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:13,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481500319] [2019-12-27 17:43:13,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:13,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:13,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481500319] [2019-12-27 17:43:13,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:13,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:43:13,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [870282104] [2019-12-27 17:43:13,182 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:13,221 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:13,608 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 242 states and 363 transitions. [2019-12-27 17:43:13,609 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:13,665 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 17:43:13,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:43:13,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:13,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:43:13,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:43:13,666 INFO L87 Difference]: Start difference. First operand 15042 states and 34563 transitions. Second operand 9 states. [2019-12-27 17:43:16,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:16,159 INFO L93 Difference]: Finished difference Result 25938 states and 58832 transitions. [2019-12-27 17:43:16,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 17:43:16,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-27 17:43:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:16,188 INFO L225 Difference]: With dead ends: 25938 [2019-12-27 17:43:16,188 INFO L226 Difference]: Without dead ends: 25761 [2019-12-27 17:43:16,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-12-27 17:43:16,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25761 states. [2019-12-27 17:43:16,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25761 to 15620. [2019-12-27 17:43:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15620 states. [2019-12-27 17:43:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15620 states to 15620 states and 35828 transitions. [2019-12-27 17:43:16,423 INFO L78 Accepts]: Start accepts. Automaton has 15620 states and 35828 transitions. Word has length 95 [2019-12-27 17:43:16,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:16,423 INFO L462 AbstractCegarLoop]: Abstraction has 15620 states and 35828 transitions. [2019-12-27 17:43:16,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:43:16,423 INFO L276 IsEmpty]: Start isEmpty. Operand 15620 states and 35828 transitions. [2019-12-27 17:43:16,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:43:16,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:16,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:16,437 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:16,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:16,437 INFO L82 PathProgramCache]: Analyzing trace with hash -536597709, now seen corresponding path program 6 times [2019-12-27 17:43:16,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:16,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881664656] [2019-12-27 17:43:16,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:16,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881664656] [2019-12-27 17:43:16,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:16,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:43:16,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2125106879] [2019-12-27 17:43:16,602 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:16,644 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:16,932 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 182 states and 248 transitions. [2019-12-27 17:43:16,932 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:17,504 WARN L192 SmtUtils]: Spent 514.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-12-27 17:43:17,506 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 17:43:17,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:43:17,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:17,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:43:17,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:43:17,508 INFO L87 Difference]: Start difference. First operand 15620 states and 35828 transitions. Second operand 12 states. [2019-12-27 17:43:20,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:20,224 INFO L93 Difference]: Finished difference Result 25551 states and 58215 transitions. [2019-12-27 17:43:20,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 17:43:20,225 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 95 [2019-12-27 17:43:20,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:20,253 INFO L225 Difference]: With dead ends: 25551 [2019-12-27 17:43:20,253 INFO L226 Difference]: Without dead ends: 25551 [2019-12-27 17:43:20,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812 [2019-12-27 17:43:20,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25551 states. [2019-12-27 17:43:20,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25551 to 15062. [2019-12-27 17:43:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15062 states. [2019-12-27 17:43:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15062 states to 15062 states and 34601 transitions. [2019-12-27 17:43:20,480 INFO L78 Accepts]: Start accepts. Automaton has 15062 states and 34601 transitions. Word has length 95 [2019-12-27 17:43:20,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:20,480 INFO L462 AbstractCegarLoop]: Abstraction has 15062 states and 34601 transitions. [2019-12-27 17:43:20,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:43:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 15062 states and 34601 transitions. [2019-12-27 17:43:20,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:43:20,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:20,494 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:20,494 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:20,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:20,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1624199791, now seen corresponding path program 7 times [2019-12-27 17:43:20,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:20,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305835335] [2019-12-27 17:43:20,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:20,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305835335] [2019-12-27 17:43:20,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:20,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:43:20,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1325210327] [2019-12-27 17:43:20,651 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:20,680 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:20,872 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 214 transitions. [2019-12-27 17:43:20,872 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:20,911 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 17:43:20,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:43:20,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:20,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:43:20,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:43:20,912 INFO L87 Difference]: Start difference. First operand 15062 states and 34601 transitions. Second operand 11 states. [2019-12-27 17:43:24,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:24,095 INFO L93 Difference]: Finished difference Result 38606 states and 87843 transitions. [2019-12-27 17:43:24,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 17:43:24,096 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-12-27 17:43:24,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:24,136 INFO L225 Difference]: With dead ends: 38606 [2019-12-27 17:43:24,136 INFO L226 Difference]: Without dead ends: 36212 [2019-12-27 17:43:24,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=1005, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 17:43:24,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36212 states. [2019-12-27 17:43:24,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36212 to 19534. [2019-12-27 17:43:24,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19534 states. [2019-12-27 17:43:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19534 states to 19534 states and 45380 transitions. [2019-12-27 17:43:24,921 INFO L78 Accepts]: Start accepts. Automaton has 19534 states and 45380 transitions. Word has length 95 [2019-12-27 17:43:24,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:24,921 INFO L462 AbstractCegarLoop]: Abstraction has 19534 states and 45380 transitions. [2019-12-27 17:43:24,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:43:24,921 INFO L276 IsEmpty]: Start isEmpty. Operand 19534 states and 45380 transitions. [2019-12-27 17:43:24,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:43:24,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:24,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:24,940 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:24,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:24,941 INFO L82 PathProgramCache]: Analyzing trace with hash -2079306305, now seen corresponding path program 8 times [2019-12-27 17:43:24,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:24,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738433697] [2019-12-27 17:43:24,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:25,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738433697] [2019-12-27 17:43:25,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:25,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:43:25,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1304226016] [2019-12-27 17:43:25,067 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:25,091 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:25,331 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 204 transitions. [2019-12-27 17:43:25,332 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:25,356 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:43:25,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:43:25,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:25,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:43:25,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:43:25,357 INFO L87 Difference]: Start difference. First operand 19534 states and 45380 transitions. Second operand 7 states. [2019-12-27 17:43:26,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:26,405 INFO L93 Difference]: Finished difference Result 43058 states and 99568 transitions. [2019-12-27 17:43:26,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 17:43:26,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-27 17:43:26,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:26,445 INFO L225 Difference]: With dead ends: 43058 [2019-12-27 17:43:26,445 INFO L226 Difference]: Without dead ends: 34763 [2019-12-27 17:43:26,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:43:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34763 states. [2019-12-27 17:43:26,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34763 to 25011. [2019-12-27 17:43:26,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25011 states. [2019-12-27 17:43:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25011 states to 25011 states and 57938 transitions. [2019-12-27 17:43:26,809 INFO L78 Accepts]: Start accepts. Automaton has 25011 states and 57938 transitions. Word has length 95 [2019-12-27 17:43:26,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:26,809 INFO L462 AbstractCegarLoop]: Abstraction has 25011 states and 57938 transitions. [2019-12-27 17:43:26,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:43:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 25011 states and 57938 transitions. [2019-12-27 17:43:26,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:43:26,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:26,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:26,833 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:26,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:26,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1365619281, now seen corresponding path program 9 times [2019-12-27 17:43:26,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:26,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733369936] [2019-12-27 17:43:26,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:26,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:26,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733369936] [2019-12-27 17:43:26,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:26,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:43:26,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1890076744] [2019-12-27 17:43:26,913 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:26,945 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:27,133 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 149 states and 184 transitions. [2019-12-27 17:43:27,133 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:27,163 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:43:27,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:43:27,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:27,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:43:27,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:43:27,165 INFO L87 Difference]: Start difference. First operand 25011 states and 57938 transitions. Second operand 6 states. [2019-12-27 17:43:28,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:28,411 INFO L93 Difference]: Finished difference Result 47635 states and 110686 transitions. [2019-12-27 17:43:28,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:43:28,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 17:43:28,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:28,466 INFO L225 Difference]: With dead ends: 47635 [2019-12-27 17:43:28,466 INFO L226 Difference]: Without dead ends: 47635 [2019-12-27 17:43:28,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:43:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47635 states. [2019-12-27 17:43:29,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47635 to 26970. [2019-12-27 17:43:29,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26970 states. [2019-12-27 17:43:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26970 states to 26970 states and 62360 transitions. [2019-12-27 17:43:29,394 INFO L78 Accepts]: Start accepts. Automaton has 26970 states and 62360 transitions. Word has length 95 [2019-12-27 17:43:29,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:29,394 INFO L462 AbstractCegarLoop]: Abstraction has 26970 states and 62360 transitions. [2019-12-27 17:43:29,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:43:29,394 INFO L276 IsEmpty]: Start isEmpty. Operand 26970 states and 62360 transitions. [2019-12-27 17:43:29,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:29,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:29,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:29,420 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:29,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:29,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1607730014, now seen corresponding path program 1 times [2019-12-27 17:43:29,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:29,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671284125] [2019-12-27 17:43:29,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:29,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671284125] [2019-12-27 17:43:29,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:29,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:43:29,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1541650429] [2019-12-27 17:43:29,513 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:29,538 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:29,660 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 162 transitions. [2019-12-27 17:43:29,660 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:29,681 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:43:29,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:43:29,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:29,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:43:29,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:43:29,682 INFO L87 Difference]: Start difference. First operand 26970 states and 62360 transitions. Second operand 8 states. [2019-12-27 17:43:30,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:30,303 INFO L93 Difference]: Finished difference Result 33685 states and 76775 transitions. [2019-12-27 17:43:30,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 17:43:30,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-12-27 17:43:30,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:30,342 INFO L225 Difference]: With dead ends: 33685 [2019-12-27 17:43:30,342 INFO L226 Difference]: Without dead ends: 32464 [2019-12-27 17:43:30,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:43:30,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32464 states. [2019-12-27 17:43:30,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32464 to 27284. [2019-12-27 17:43:30,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27284 states. [2019-12-27 17:43:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27284 states to 27284 states and 63128 transitions. [2019-12-27 17:43:30,731 INFO L78 Accepts]: Start accepts. Automaton has 27284 states and 63128 transitions. Word has length 96 [2019-12-27 17:43:30,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:30,731 INFO L462 AbstractCegarLoop]: Abstraction has 27284 states and 63128 transitions. [2019-12-27 17:43:30,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:43:30,731 INFO L276 IsEmpty]: Start isEmpty. Operand 27284 states and 63128 transitions. [2019-12-27 17:43:30,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:30,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:30,757 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:30,757 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:30,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:30,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1923547038, now seen corresponding path program 2 times [2019-12-27 17:43:30,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:30,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280549332] [2019-12-27 17:43:30,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:30,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:30,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280549332] [2019-12-27 17:43:30,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:30,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:43:30,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1951411115] [2019-12-27 17:43:30,963 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:30,982 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:31,119 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 215 transitions. [2019-12-27 17:43:31,119 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:31,190 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 17:43:31,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 17:43:31,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:31,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 17:43:31,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:43:31,191 INFO L87 Difference]: Start difference. First operand 27284 states and 63128 transitions. Second operand 15 states. [2019-12-27 17:43:32,674 WARN L192 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-12-27 17:43:35,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:35,558 INFO L93 Difference]: Finished difference Result 60021 states and 136758 transitions. [2019-12-27 17:43:35,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-12-27 17:43:35,558 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-12-27 17:43:35,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:35,616 INFO L225 Difference]: With dead ends: 60021 [2019-12-27 17:43:35,616 INFO L226 Difference]: Without dead ends: 50695 [2019-12-27 17:43:35,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1761 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=711, Invalid=4691, Unknown=0, NotChecked=0, Total=5402 [2019-12-27 17:43:35,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50695 states. [2019-12-27 17:43:36,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50695 to 33126. [2019-12-27 17:43:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33126 states. [2019-12-27 17:43:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33126 states to 33126 states and 77169 transitions. [2019-12-27 17:43:36,165 INFO L78 Accepts]: Start accepts. Automaton has 33126 states and 77169 transitions. Word has length 96 [2019-12-27 17:43:36,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:36,165 INFO L462 AbstractCegarLoop]: Abstraction has 33126 states and 77169 transitions. [2019-12-27 17:43:36,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 17:43:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 33126 states and 77169 transitions. [2019-12-27 17:43:36,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:36,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:36,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:36,197 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:36,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:36,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1937169854, now seen corresponding path program 3 times [2019-12-27 17:43:36,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:36,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315578644] [2019-12-27 17:43:36,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:36,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:36,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315578644] [2019-12-27 17:43:36,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:36,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:43:36,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1314088358] [2019-12-27 17:43:36,282 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:36,307 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:36,549 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 220 transitions. [2019-12-27 17:43:36,549 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:36,557 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:43:36,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:43:36,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:36,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:43:36,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:43:36,559 INFO L87 Difference]: Start difference. First operand 33126 states and 77169 transitions. Second operand 6 states. [2019-12-27 17:43:37,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:37,654 INFO L93 Difference]: Finished difference Result 41325 states and 95231 transitions. [2019-12-27 17:43:37,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:43:37,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-27 17:43:37,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:37,701 INFO L225 Difference]: With dead ends: 41325 [2019-12-27 17:43:37,701 INFO L226 Difference]: Without dead ends: 41325 [2019-12-27 17:43:37,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:43:37,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41325 states. [2019-12-27 17:43:38,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41325 to 36054. [2019-12-27 17:43:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36054 states. [2019-12-27 17:43:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36054 states to 36054 states and 83970 transitions. [2019-12-27 17:43:38,747 INFO L78 Accepts]: Start accepts. Automaton has 36054 states and 83970 transitions. Word has length 96 [2019-12-27 17:43:38,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:38,747 INFO L462 AbstractCegarLoop]: Abstraction has 36054 states and 83970 transitions. [2019-12-27 17:43:38,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:43:38,747 INFO L276 IsEmpty]: Start isEmpty. Operand 36054 states and 83970 transitions. [2019-12-27 17:43:38,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:38,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:38,779 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:38,779 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:38,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:38,780 INFO L82 PathProgramCache]: Analyzing trace with hash 798116452, now seen corresponding path program 4 times [2019-12-27 17:43:38,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:38,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826455736] [2019-12-27 17:43:38,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:38,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826455736] [2019-12-27 17:43:38,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:38,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:43:38,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [501554631] [2019-12-27 17:43:38,932 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:38,956 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:39,117 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 147 transitions. [2019-12-27 17:43:39,118 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:39,133 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:43:39,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:43:39,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:39,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:43:39,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:43:39,134 INFO L87 Difference]: Start difference. First operand 36054 states and 83970 transitions. Second operand 10 states. [2019-12-27 17:43:40,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:40,040 INFO L93 Difference]: Finished difference Result 54126 states and 124789 transitions. [2019-12-27 17:43:40,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 17:43:40,040 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 17:43:40,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:40,101 INFO L225 Difference]: With dead ends: 54126 [2019-12-27 17:43:40,102 INFO L226 Difference]: Without dead ends: 52503 [2019-12-27 17:43:40,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-27 17:43:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52503 states. [2019-12-27 17:43:40,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52503 to 44101. [2019-12-27 17:43:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44101 states. [2019-12-27 17:43:40,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44101 states to 44101 states and 103181 transitions. [2019-12-27 17:43:40,708 INFO L78 Accepts]: Start accepts. Automaton has 44101 states and 103181 transitions. Word has length 96 [2019-12-27 17:43:40,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:40,709 INFO L462 AbstractCegarLoop]: Abstraction has 44101 states and 103181 transitions. [2019-12-27 17:43:40,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:43:40,709 INFO L276 IsEmpty]: Start isEmpty. Operand 44101 states and 103181 transitions. [2019-12-27 17:43:40,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:40,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:40,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:40,748 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:40,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:40,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1267480048, now seen corresponding path program 5 times [2019-12-27 17:43:40,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:40,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072185586] [2019-12-27 17:43:40,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:40,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072185586] [2019-12-27 17:43:40,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:40,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:43:40,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [678061587] [2019-12-27 17:43:40,879 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:40,903 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:41,602 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 222 transitions. [2019-12-27 17:43:41,603 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:41,629 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 17:43:41,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:43:41,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:41,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:43:41,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:43:41,630 INFO L87 Difference]: Start difference. First operand 44101 states and 103181 transitions. Second operand 12 states. [2019-12-27 17:43:44,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:44,550 INFO L93 Difference]: Finished difference Result 78532 states and 178935 transitions. [2019-12-27 17:43:44,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 17:43:44,551 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-27 17:43:44,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:44,640 INFO L225 Difference]: With dead ends: 78532 [2019-12-27 17:43:44,640 INFO L226 Difference]: Without dead ends: 77103 [2019-12-27 17:43:44,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=490, Invalid=3050, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 17:43:44,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77103 states. [2019-12-27 17:43:45,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77103 to 46726. [2019-12-27 17:43:45,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46726 states. [2019-12-27 17:43:45,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46726 states to 46726 states and 109884 transitions. [2019-12-27 17:43:45,514 INFO L78 Accepts]: Start accepts. Automaton has 46726 states and 109884 transitions. Word has length 96 [2019-12-27 17:43:45,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:45,515 INFO L462 AbstractCegarLoop]: Abstraction has 46726 states and 109884 transitions. [2019-12-27 17:43:45,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:43:45,515 INFO L276 IsEmpty]: Start isEmpty. Operand 46726 states and 109884 transitions. [2019-12-27 17:43:45,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:45,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:45,557 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:45,557 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:45,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:45,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1061893144, now seen corresponding path program 6 times [2019-12-27 17:43:45,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:45,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609700630] [2019-12-27 17:43:45,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:45,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609700630] [2019-12-27 17:43:45,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:45,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:43:45,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [366455592] [2019-12-27 17:43:45,799 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:45,824 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:46,274 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 185 transitions. [2019-12-27 17:43:46,274 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:46,317 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:43:46,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:43:46,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:46,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:43:46,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:43:46,318 INFO L87 Difference]: Start difference. First operand 46726 states and 109884 transitions. Second operand 14 states. [2019-12-27 17:43:47,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:47,200 INFO L93 Difference]: Finished difference Result 57960 states and 135709 transitions. [2019-12-27 17:43:47,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 17:43:47,200 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-27 17:43:47,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:47,275 INFO L225 Difference]: With dead ends: 57960 [2019-12-27 17:43:47,275 INFO L226 Difference]: Without dead ends: 57921 [2019-12-27 17:43:47,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2019-12-27 17:43:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57921 states. [2019-12-27 17:43:47,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57921 to 53929. [2019-12-27 17:43:47,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53929 states. [2019-12-27 17:43:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53929 states to 53929 states and 127195 transitions. [2019-12-27 17:43:47,980 INFO L78 Accepts]: Start accepts. Automaton has 53929 states and 127195 transitions. Word has length 96 [2019-12-27 17:43:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:47,980 INFO L462 AbstractCegarLoop]: Abstraction has 53929 states and 127195 transitions. [2019-12-27 17:43:47,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:43:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 53929 states and 127195 transitions. [2019-12-27 17:43:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:48,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:48,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:48,033 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:48,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:48,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1560206146, now seen corresponding path program 7 times [2019-12-27 17:43:48,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:48,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669355559] [2019-12-27 17:43:48,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:48,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669355559] [2019-12-27 17:43:48,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:48,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:43:48,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1610256935] [2019-12-27 17:43:48,169 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:48,192 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:48,325 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 201 transitions. [2019-12-27 17:43:48,325 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:48,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:43:48,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:48,344 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:43:48,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:43:48,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:48,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:43:48,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:43:48,345 INFO L87 Difference]: Start difference. First operand 53929 states and 127195 transitions. Second operand 7 states. [2019-12-27 17:43:48,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:48,834 INFO L93 Difference]: Finished difference Result 50470 states and 119341 transitions. [2019-12-27 17:43:48,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:43:48,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-12-27 17:43:48,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:48,894 INFO L225 Difference]: With dead ends: 50470 [2019-12-27 17:43:48,894 INFO L226 Difference]: Without dead ends: 50470 [2019-12-27 17:43:48,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:43:48,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50470 states. [2019-12-27 17:43:49,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50470 to 49904. [2019-12-27 17:43:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49904 states. [2019-12-27 17:43:49,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49904 states to 49904 states and 118263 transitions. [2019-12-27 17:43:49,903 INFO L78 Accepts]: Start accepts. Automaton has 49904 states and 118263 transitions. Word has length 96 [2019-12-27 17:43:49,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:49,904 INFO L462 AbstractCegarLoop]: Abstraction has 49904 states and 118263 transitions. [2019-12-27 17:43:49,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:43:49,904 INFO L276 IsEmpty]: Start isEmpty. Operand 49904 states and 118263 transitions. [2019-12-27 17:43:49,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:49,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:49,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:49,951 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:49,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:49,951 INFO L82 PathProgramCache]: Analyzing trace with hash -428888642, now seen corresponding path program 8 times [2019-12-27 17:43:49,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:49,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916639970] [2019-12-27 17:43:49,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:50,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:50,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916639970] [2019-12-27 17:43:50,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:50,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:43:50,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2050672349] [2019-12-27 17:43:50,105 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:50,131 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:50,333 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 203 transitions. [2019-12-27 17:43:50,333 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:50,390 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 17:43:50,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 17:43:50,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:50,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 17:43:50,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:43:50,391 INFO L87 Difference]: Start difference. First operand 49904 states and 118263 transitions. Second operand 15 states. [2019-12-27 17:43:54,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:54,349 INFO L93 Difference]: Finished difference Result 86051 states and 200409 transitions. [2019-12-27 17:43:54,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-12-27 17:43:54,350 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-12-27 17:43:54,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:54,445 INFO L225 Difference]: With dead ends: 86051 [2019-12-27 17:43:54,445 INFO L226 Difference]: Without dead ends: 77482 [2019-12-27 17:43:54,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=624, Invalid=3798, Unknown=0, NotChecked=0, Total=4422 [2019-12-27 17:43:54,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77482 states. [2019-12-27 17:43:55,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77482 to 49982. [2019-12-27 17:43:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49982 states. [2019-12-27 17:43:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49982 states to 49982 states and 118427 transitions. [2019-12-27 17:43:55,630 INFO L78 Accepts]: Start accepts. Automaton has 49982 states and 118427 transitions. Word has length 96 [2019-12-27 17:43:55,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:55,630 INFO L462 AbstractCegarLoop]: Abstraction has 49982 states and 118427 transitions. [2019-12-27 17:43:55,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 17:43:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 49982 states and 118427 transitions. [2019-12-27 17:43:55,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:55,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:55,678 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:55,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:55,679 INFO L82 PathProgramCache]: Analyzing trace with hash -743312710, now seen corresponding path program 9 times [2019-12-27 17:43:55,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:55,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226856397] [2019-12-27 17:43:55,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:55,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226856397] [2019-12-27 17:43:55,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:55,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:43:55,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [51105514] [2019-12-27 17:43:55,831 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:55,851 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:55,986 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 201 transitions. [2019-12-27 17:43:55,986 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:56,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:43:56,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:56,022 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:43:56,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:43:56,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:56,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:43:56,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:43:56,023 INFO L87 Difference]: Start difference. First operand 49982 states and 118427 transitions. Second operand 11 states. [2019-12-27 17:43:57,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:57,646 INFO L93 Difference]: Finished difference Result 70381 states and 164217 transitions. [2019-12-27 17:43:57,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 17:43:57,646 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-27 17:43:57,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:57,731 INFO L225 Difference]: With dead ends: 70381 [2019-12-27 17:43:57,731 INFO L226 Difference]: Without dead ends: 70381 [2019-12-27 17:43:57,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:43:57,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70381 states. [2019-12-27 17:43:58,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70381 to 51297. [2019-12-27 17:43:58,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51297 states. [2019-12-27 17:43:58,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51297 states to 51297 states and 121518 transitions. [2019-12-27 17:43:58,491 INFO L78 Accepts]: Start accepts. Automaton has 51297 states and 121518 transitions. Word has length 96 [2019-12-27 17:43:58,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:58,491 INFO L462 AbstractCegarLoop]: Abstraction has 51297 states and 121518 transitions. [2019-12-27 17:43:58,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:43:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 51297 states and 121518 transitions. [2019-12-27 17:43:58,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:58,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:58,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:58,541 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:58,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:58,541 INFO L82 PathProgramCache]: Analyzing trace with hash -458881122, now seen corresponding path program 10 times [2019-12-27 17:43:58,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:58,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975385123] [2019-12-27 17:43:58,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:58,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975385123] [2019-12-27 17:43:58,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:58,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:43:58,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [870682213] [2019-12-27 17:43:58,686 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:58,702 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:59,056 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 199 transitions. [2019-12-27 17:43:59,056 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:59,065 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:43:59,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:43:59,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:59,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:43:59,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:43:59,066 INFO L87 Difference]: Start difference. First operand 51297 states and 121518 transitions. Second operand 10 states. [2019-12-27 17:44:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:00,819 INFO L93 Difference]: Finished difference Result 61823 states and 142902 transitions. [2019-12-27 17:44:00,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 17:44:00,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 17:44:00,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:00,892 INFO L225 Difference]: With dead ends: 61823 [2019-12-27 17:44:00,892 INFO L226 Difference]: Without dead ends: 61823 [2019-12-27 17:44:00,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:44:00,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61823 states. [2019-12-27 17:44:01,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61823 to 45035. [2019-12-27 17:44:01,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45035 states. [2019-12-27 17:44:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45035 states to 45035 states and 105634 transitions. [2019-12-27 17:44:01,563 INFO L78 Accepts]: Start accepts. Automaton has 45035 states and 105634 transitions. Word has length 96 [2019-12-27 17:44:01,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:01,564 INFO L462 AbstractCegarLoop]: Abstraction has 45035 states and 105634 transitions. [2019-12-27 17:44:01,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:44:01,564 INFO L276 IsEmpty]: Start isEmpty. Operand 45035 states and 105634 transitions. [2019-12-27 17:44:01,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:01,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:01,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:01,605 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:01,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:01,605 INFO L82 PathProgramCache]: Analyzing trace with hash 347004684, now seen corresponding path program 11 times [2019-12-27 17:44:01,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:01,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065914461] [2019-12-27 17:44:01,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:01,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:01,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065914461] [2019-12-27 17:44:01,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:01,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:44:01,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1746849204] [2019-12-27 17:44:01,745 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:01,761 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:01,892 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 199 transitions. [2019-12-27 17:44:01,892 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:01,915 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:44:01,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:44:01,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:01,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:44:01,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:44:01,916 INFO L87 Difference]: Start difference. First operand 45035 states and 105634 transitions. Second operand 11 states. [2019-12-27 17:44:04,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:04,222 INFO L93 Difference]: Finished difference Result 60709 states and 140580 transitions. [2019-12-27 17:44:04,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 17:44:04,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-27 17:44:04,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:04,289 INFO L225 Difference]: With dead ends: 60709 [2019-12-27 17:44:04,290 INFO L226 Difference]: Without dead ends: 60709 [2019-12-27 17:44:04,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2019-12-27 17:44:04,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60709 states. [2019-12-27 17:44:04,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60709 to 45245. [2019-12-27 17:44:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45245 states. [2019-12-27 17:44:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45245 states to 45245 states and 106195 transitions. [2019-12-27 17:44:04,943 INFO L78 Accepts]: Start accepts. Automaton has 45245 states and 106195 transitions. Word has length 96 [2019-12-27 17:44:04,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:04,943 INFO L462 AbstractCegarLoop]: Abstraction has 45245 states and 106195 transitions. [2019-12-27 17:44:04,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:44:04,943 INFO L276 IsEmpty]: Start isEmpty. Operand 45245 states and 106195 transitions. [2019-12-27 17:44:04,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 17:44:04,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:04,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:04,985 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:04,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:04,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1931956007, now seen corresponding path program 1 times [2019-12-27 17:44:04,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:04,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714808444] [2019-12-27 17:44:04,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:05,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:05,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714808444] [2019-12-27 17:44:05,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:05,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:44:05,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1594182138] [2019-12-27 17:44:05,309 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:05,328 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:05,471 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 213 transitions. [2019-12-27 17:44:05,472 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:05,736 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 17:44:05,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 17:44:05,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:05,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 17:44:05,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:44:05,738 INFO L87 Difference]: Start difference. First operand 45245 states and 106195 transitions. Second operand 19 states. [2019-12-27 17:44:07,181 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-12-27 17:44:07,819 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-12-27 17:44:07,957 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-12-27 17:44:09,511 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-27 17:44:12,453 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-12-27 17:44:12,667 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-12-27 17:44:13,185 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-12-27 17:44:13,598 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-27 17:44:14,812 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-27 17:44:17,127 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-27 17:44:18,002 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-27 17:44:18,556 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 17:44:18,738 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-27 17:44:18,922 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-27 17:44:19,094 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-12-27 17:44:20,033 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-12-27 17:44:21,170 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 17:44:21,780 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-12-27 17:44:22,246 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-27 17:44:24,108 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-12-27 17:44:24,345 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-12-27 17:44:26,420 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-12-27 17:44:27,502 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-12-27 17:44:35,801 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-12-27 17:44:37,267 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-12-27 17:44:39,567 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-12-27 17:44:40,111 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2019-12-27 17:44:40,921 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-12-27 17:44:48,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:48,385 INFO L93 Difference]: Finished difference Result 156028 states and 354917 transitions. [2019-12-27 17:44:48,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 308 states. [2019-12-27 17:44:48,386 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2019-12-27 17:44:48,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:48,586 INFO L225 Difference]: With dead ends: 156028 [2019-12-27 17:44:48,586 INFO L226 Difference]: Without dead ends: 141527 [2019-12-27 17:44:48,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43288 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=8802, Invalid=86988, Unknown=0, NotChecked=0, Total=95790 [2019-12-27 17:44:48,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141527 states. [2019-12-27 17:44:50,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141527 to 52003. [2019-12-27 17:44:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52003 states. [2019-12-27 17:44:50,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52003 states to 52003 states and 122790 transitions. [2019-12-27 17:44:50,170 INFO L78 Accepts]: Start accepts. Automaton has 52003 states and 122790 transitions. Word has length 97 [2019-12-27 17:44:50,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:50,171 INFO L462 AbstractCegarLoop]: Abstraction has 52003 states and 122790 transitions. [2019-12-27 17:44:50,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 17:44:50,171 INFO L276 IsEmpty]: Start isEmpty. Operand 52003 states and 122790 transitions. [2019-12-27 17:44:50,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 17:44:50,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:50,222 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:50,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:50,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1686919759, now seen corresponding path program 2 times [2019-12-27 17:44:50,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:50,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414110439] [2019-12-27 17:44:50,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:50,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:50,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414110439] [2019-12-27 17:44:50,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:50,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:44:50,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2096544944] [2019-12-27 17:44:50,312 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:50,347 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:50,466 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 166 transitions. [2019-12-27 17:44:50,466 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:50,466 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:44:50,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:44:50,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:50,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:44:50,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:44:50,467 INFO L87 Difference]: Start difference. First operand 52003 states and 122790 transitions. Second operand 6 states. [2019-12-27 17:44:50,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:50,700 INFO L93 Difference]: Finished difference Result 50830 states and 119119 transitions. [2019-12-27 17:44:50,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:44:50,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-27 17:44:50,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:50,758 INFO L225 Difference]: With dead ends: 50830 [2019-12-27 17:44:50,759 INFO L226 Difference]: Without dead ends: 50830 [2019-12-27 17:44:50,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:44:50,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50830 states. [2019-12-27 17:44:51,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50830 to 35578. [2019-12-27 17:44:51,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35578 states. [2019-12-27 17:44:51,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35578 states to 35578 states and 82682 transitions. [2019-12-27 17:44:51,263 INFO L78 Accepts]: Start accepts. Automaton has 35578 states and 82682 transitions. Word has length 97 [2019-12-27 17:44:51,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:51,263 INFO L462 AbstractCegarLoop]: Abstraction has 35578 states and 82682 transitions. [2019-12-27 17:44:51,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:44:51,263 INFO L276 IsEmpty]: Start isEmpty. Operand 35578 states and 82682 transitions. [2019-12-27 17:44:51,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 17:44:51,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:51,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:51,295 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:51,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:51,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1220428195, now seen corresponding path program 1 times [2019-12-27 17:44:51,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:51,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124331835] [2019-12-27 17:44:51,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:51,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124331835] [2019-12-27 17:44:51,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:51,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:44:51,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [909816017] [2019-12-27 17:44:51,404 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:51,421 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:51,713 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 148 transitions. [2019-12-27 17:44:51,713 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:51,716 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:44:51,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:44:51,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:51,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:44:51,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:44:51,717 INFO L87 Difference]: Start difference. First operand 35578 states and 82682 transitions. Second operand 7 states. [2019-12-27 17:44:52,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:52,771 INFO L93 Difference]: Finished difference Result 53760 states and 122808 transitions. [2019-12-27 17:44:52,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:44:52,772 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-27 17:44:52,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:52,835 INFO L225 Difference]: With dead ends: 53760 [2019-12-27 17:44:52,835 INFO L226 Difference]: Without dead ends: 53746 [2019-12-27 17:44:52,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:44:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53746 states. [2019-12-27 17:44:53,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53746 to 43943. [2019-12-27 17:44:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43943 states. [2019-12-27 17:44:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43943 states to 43943 states and 101852 transitions. [2019-12-27 17:44:53,410 INFO L78 Accepts]: Start accepts. Automaton has 43943 states and 101852 transitions. Word has length 97 [2019-12-27 17:44:53,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:53,411 INFO L462 AbstractCegarLoop]: Abstraction has 43943 states and 101852 transitions. [2019-12-27 17:44:53,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:44:53,411 INFO L276 IsEmpty]: Start isEmpty. Operand 43943 states and 101852 transitions. [2019-12-27 17:44:53,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 17:44:53,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:53,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:53,450 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:53,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:53,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1780327349, now seen corresponding path program 2 times [2019-12-27 17:44:53,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:53,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940607274] [2019-12-27 17:44:53,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:53,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940607274] [2019-12-27 17:44:53,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:53,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:44:53,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1419616812] [2019-12-27 17:44:53,573 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:53,598 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:53,734 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 127 states and 150 transitions. [2019-12-27 17:44:53,735 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:53,737 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:44:53,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:44:53,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:53,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:44:53,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:44:53,737 INFO L87 Difference]: Start difference. First operand 43943 states and 101852 transitions. Second operand 8 states. [2019-12-27 17:44:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:54,700 INFO L93 Difference]: Finished difference Result 52450 states and 120438 transitions. [2019-12-27 17:44:54,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 17:44:54,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-27 17:44:54,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:54,781 INFO L225 Difference]: With dead ends: 52450 [2019-12-27 17:44:54,782 INFO L226 Difference]: Without dead ends: 52436 [2019-12-27 17:44:54,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:44:54,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52436 states. [2019-12-27 17:44:55,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52436 to 43636. [2019-12-27 17:44:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43636 states. [2019-12-27 17:44:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43636 states to 43636 states and 101149 transitions. [2019-12-27 17:44:55,363 INFO L78 Accepts]: Start accepts. Automaton has 43636 states and 101149 transitions. Word has length 97 [2019-12-27 17:44:55,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:55,363 INFO L462 AbstractCegarLoop]: Abstraction has 43636 states and 101149 transitions. [2019-12-27 17:44:55,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:44:55,363 INFO L276 IsEmpty]: Start isEmpty. Operand 43636 states and 101149 transitions. [2019-12-27 17:44:55,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 17:44:55,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:55,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:55,402 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:55,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:55,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1166833459, now seen corresponding path program 3 times [2019-12-27 17:44:55,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:55,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558417257] [2019-12-27 17:44:55,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:55,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558417257] [2019-12-27 17:44:55,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:55,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:44:55,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2110011551] [2019-12-27 17:44:55,651 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:55,668 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:55,767 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 134 transitions. [2019-12-27 17:44:55,768 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:55,768 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:44:55,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:44:55,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:55,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:44:55,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:44:55,769 INFO L87 Difference]: Start difference. First operand 43636 states and 101149 transitions. Second operand 7 states. [2019-12-27 17:44:56,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:56,755 INFO L93 Difference]: Finished difference Result 57826 states and 133252 transitions. [2019-12-27 17:44:56,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 17:44:56,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-27 17:44:56,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:56,822 INFO L225 Difference]: With dead ends: 57826 [2019-12-27 17:44:56,822 INFO L226 Difference]: Without dead ends: 57805 [2019-12-27 17:44:56,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:44:56,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57805 states. [2019-12-27 17:44:57,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57805 to 46611. [2019-12-27 17:44:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46611 states. [2019-12-27 17:44:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46611 states to 46611 states and 108058 transitions. [2019-12-27 17:44:57,428 INFO L78 Accepts]: Start accepts. Automaton has 46611 states and 108058 transitions. Word has length 97 [2019-12-27 17:44:57,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:57,428 INFO L462 AbstractCegarLoop]: Abstraction has 46611 states and 108058 transitions. [2019-12-27 17:44:57,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:44:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 46611 states and 108058 transitions. [2019-12-27 17:44:57,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 17:44:57,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:57,470 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:57,470 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:57,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:57,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1279789301, now seen corresponding path program 4 times [2019-12-27 17:44:57,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:57,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295922682] [2019-12-27 17:44:57,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:58,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:58,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295922682] [2019-12-27 17:44:58,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:58,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 17:44:58,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1896295092] [2019-12-27 17:44:58,020 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:58,036 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:58,170 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 171 states and 238 transitions. [2019-12-27 17:44:58,170 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:58,701 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 17:44:58,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 17:44:58,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:58,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 17:44:58,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2019-12-27 17:44:58,703 INFO L87 Difference]: Start difference. First operand 46611 states and 108058 transitions. Second operand 29 states. [2019-12-27 17:45:03,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:03,000 INFO L93 Difference]: Finished difference Result 58670 states and 135028 transitions. [2019-12-27 17:45:03,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 17:45:03,001 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 97 [2019-12-27 17:45:03,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:03,072 INFO L225 Difference]: With dead ends: 58670 [2019-12-27 17:45:03,072 INFO L226 Difference]: Without dead ends: 55985 [2019-12-27 17:45:03,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=318, Invalid=1938, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 17:45:03,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55985 states. [2019-12-27 17:45:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55985 to 49140. [2019-12-27 17:45:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49140 states. [2019-12-27 17:45:03,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49140 states to 49140 states and 113795 transitions. [2019-12-27 17:45:03,650 INFO L78 Accepts]: Start accepts. Automaton has 49140 states and 113795 transitions. Word has length 97 [2019-12-27 17:45:03,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:03,650 INFO L462 AbstractCegarLoop]: Abstraction has 49140 states and 113795 transitions. [2019-12-27 17:45:03,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 17:45:03,650 INFO L276 IsEmpty]: Start isEmpty. Operand 49140 states and 113795 transitions. [2019-12-27 17:45:03,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 17:45:03,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:03,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:45:03,697 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:03,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:03,697 INFO L82 PathProgramCache]: Analyzing trace with hash -522924491, now seen corresponding path program 5 times [2019-12-27 17:45:03,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:03,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000914113] [2019-12-27 17:45:03,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:45:03,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000914113] [2019-12-27 17:45:03,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:03,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:45:03,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [301753288] [2019-12-27 17:45:03,812 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:03,838 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:04,119 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 287 transitions. [2019-12-27 17:45:04,119 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:04,258 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 17:45:04,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:45:04,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:04,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:45:04,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:45:04,261 INFO L87 Difference]: Start difference. First operand 49140 states and 113795 transitions. Second operand 12 states. [2019-12-27 17:45:07,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:07,299 INFO L93 Difference]: Finished difference Result 54332 states and 123579 transitions. [2019-12-27 17:45:07,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 17:45:07,299 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-12-27 17:45:07,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:07,365 INFO L225 Difference]: With dead ends: 54332 [2019-12-27 17:45:07,365 INFO L226 Difference]: Without dead ends: 53891 [2019-12-27 17:45:07,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:45:07,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53891 states. Received shutdown request... [2019-12-27 17:45:07,960 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 17:45:07,963 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 17:45:07,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:45:07 BasicIcfg [2019-12-27 17:45:07,964 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:45:07,966 INFO L168 Benchmark]: Toolchain (without parser) took 218642.01 ms. Allocated memory was 144.2 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 98.5 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2019-12-27 17:45:07,966 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 17:45:07,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 838.39 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 98.1 MB in the beginning and 153.1 MB in the end (delta: -55.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:45:07,967 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.43 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 149.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 17:45:07,967 INFO L168 Benchmark]: Boogie Preprocessor took 46.80 ms. Allocated memory is still 202.4 MB. Free memory was 149.7 MB in the beginning and 146.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:45:07,967 INFO L168 Benchmark]: RCFGBuilder took 1044.52 ms. Allocated memory was 202.4 MB in the beginning and 232.8 MB in the end (delta: 30.4 MB). Free memory was 146.3 MB in the beginning and 190.9 MB in the end (delta: -44.5 MB). Peak memory consumption was 67.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:45:07,968 INFO L168 Benchmark]: TraceAbstraction took 216624.37 ms. Allocated memory was 232.8 MB in the beginning and 3.7 GB in the end (delta: 3.4 GB). Free memory was 190.9 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2019-12-27 17:45:07,970 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 838.39 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 98.1 MB in the beginning and 153.1 MB in the end (delta: -55.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.43 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 149.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.80 ms. Allocated memory is still 202.4 MB. Free memory was 149.7 MB in the beginning and 146.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1044.52 ms. Allocated memory was 202.4 MB in the beginning and 232.8 MB in the end (delta: 30.4 MB). Free memory was 146.3 MB in the beginning and 190.9 MB in the end (delta: -44.5 MB). Peak memory consumption was 67.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 216624.37 ms. Allocated memory was 232.8 MB in the beginning and 3.7 GB in the end (delta: 3.4 GB). Free memory was 190.9 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.5s, 244 ProgramPointsBefore, 154 ProgramPointsAfterwards, 326 TransitionsBefore, 193 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 46 ChoiceCompositions, 19062 VarBasedMoverChecksPositive, 524 VarBasedMoverChecksNegative, 190 SemBasedMoverChecksPositive, 479 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.2s, 0 MoverChecksTotal, 326763 CheckedPairsTotal, 143 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 216.4s, OverallIterations: 43, TraceHistogramMax: 1, AutomataDifference: 116.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 20684 SDtfs, 31788 SDslu, 101235 SDs, 0 SdLazy, 61479 SolverSat, 2865 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 54.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1462 GetRequests, 318 SyntacticMatches, 87 SemanticMatches, 1057 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49673 ImplicationChecksByTransitivity, 36.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184484occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 57.7s AutomataMinimizationTime, 43 MinimizatonAttempts, 421940 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 3595 NumberOfCodeBlocks, 3595 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 3552 ConstructedInterpolants, 0 QuantifiedInterpolants, 1137210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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