/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:06:40,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:06:40,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:06:40,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:06:40,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:06:40,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:06:40,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:06:40,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:06:40,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:06:40,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:06:40,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:06:40,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:06:40,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:06:40,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:06:40,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:06:40,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:06:40,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:06:40,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:06:40,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:06:40,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:06:40,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:06:40,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:06:40,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:06:40,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:06:40,975 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:06:40,975 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:06:40,975 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:06:40,976 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:06:40,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:06:40,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:06:40,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:06:40,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:06:40,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:06:40,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:06:40,981 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:06:40,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:06:40,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:06:40,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:06:40,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:06:40,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:06:40,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:06:40,985 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:06:40,999 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:06:40,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:06:41,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:06:41,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:06:41,001 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:06:41,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:06:41,001 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:06:41,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:06:41,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:06:41,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:06:41,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:06:41,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:06:41,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:06:41,002 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:06:41,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:06:41,003 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:06:41,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:06:41,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:06:41,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:06:41,004 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:06:41,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:06:41,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:06:41,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:06:41,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:06:41,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:06:41,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:06:41,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:06:41,005 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:06:41,006 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:06:41,006 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:06:41,290 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:06:41,303 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:06:41,307 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:06:41,308 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:06:41,309 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:06:41,310 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.oepc.i [2019-12-18 14:06:41,376 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e07cba1/615f73e6fb6c4c838ec1b5cfdb1dccf6/FLAG5e007f09d [2019-12-18 14:06:41,983 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:06:41,984 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_pso.oepc.i [2019-12-18 14:06:42,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e07cba1/615f73e6fb6c4c838ec1b5cfdb1dccf6/FLAG5e007f09d [2019-12-18 14:06:42,248 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e07cba1/615f73e6fb6c4c838ec1b5cfdb1dccf6 [2019-12-18 14:06:42,260 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:06:42,262 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:06:42,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:06:42,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:06:42,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:06:42,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:06:42" (1/1) ... [2019-12-18 14:06:42,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115225be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:42, skipping insertion in model container [2019-12-18 14:06:42,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:06:42" (1/1) ... [2019-12-18 14:06:42,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:06:42,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:06:42,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:06:42,927 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:06:43,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:06:43,155 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:06:43,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:43 WrapperNode [2019-12-18 14:06:43,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:06:43,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:06:43,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:06:43,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:06:43,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:43" (1/1) ... [2019-12-18 14:06:43,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:43" (1/1) ... [2019-12-18 14:06:43,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:06:43,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:06:43,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:06:43,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:06:43,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:43" (1/1) ... [2019-12-18 14:06:43,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:43" (1/1) ... [2019-12-18 14:06:43,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:43" (1/1) ... [2019-12-18 14:06:43,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:43" (1/1) ... [2019-12-18 14:06:43,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:43" (1/1) ... [2019-12-18 14:06:43,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:43" (1/1) ... [2019-12-18 14:06:43,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:43" (1/1) ... [2019-12-18 14:06:43,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:06:43,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:06:43,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:06:43,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:06:43,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:06:43,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:06:43,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:06:43,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:06:43,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:06:43,382 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:06:43,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:06:43,383 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:06:43,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:06:43,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:06:43,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:06:43,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:06:43,388 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:06:44,569 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:06:44,570 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:06:44,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:06:44 BoogieIcfgContainer [2019-12-18 14:06:44,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:06:44,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:06:44,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:06:44,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:06:44,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:06:42" (1/3) ... [2019-12-18 14:06:44,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ef26bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:06:44, skipping insertion in model container [2019-12-18 14:06:44,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:43" (2/3) ... [2019-12-18 14:06:44,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ef26bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:06:44, skipping insertion in model container [2019-12-18 14:06:44,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:06:44" (3/3) ... [2019-12-18 14:06:44,580 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_pso.oepc.i [2019-12-18 14:06:44,590 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:06:44,591 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:06:44,599 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:06:44,600 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:06:44,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,644 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,644 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,674 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,675 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,675 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,675 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,675 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,702 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,704 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,712 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,714 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,716 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:44,731 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:06:44,752 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:06:44,752 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:06:44,752 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:06:44,752 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:06:44,752 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:06:44,753 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:06:44,753 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:06:44,753 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:06:44,771 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-18 14:06:44,773 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 14:06:44,911 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 14:06:44,912 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:06:44,964 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. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-18 14:06:45,070 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 14:06:45,197 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 14:06:45,198 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:06:45,218 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. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-18 14:06:45,268 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-18 14:06:45,269 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:06:53,006 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 14:06:53,117 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 14:06:53,274 INFO L206 etLargeBlockEncoding]: Checked pairs total: 326763 [2019-12-18 14:06:53,274 INFO L214 etLargeBlockEncoding]: Total number of compositions: 143 [2019-12-18 14:06:53,279 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 193 transitions [2019-12-18 14:07:08,099 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 116492 states. [2019-12-18 14:07:08,102 INFO L276 IsEmpty]: Start isEmpty. Operand 116492 states. [2019-12-18 14:07:08,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:07:08,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:08,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:07:08,110 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:08,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:08,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1351330582, now seen corresponding path program 1 times [2019-12-18 14:07:08,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:08,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516716656] [2019-12-18 14:07:08,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:08,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:07:08,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516716656] [2019-12-18 14:07:08,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:08,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:07:08,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611447570] [2019-12-18 14:07:08,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:07:08,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:08,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:07:08,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:07:08,362 INFO L87 Difference]: Start difference. First operand 116492 states. Second operand 3 states. [2019-12-18 14:07:09,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:09,764 INFO L93 Difference]: Finished difference Result 116456 states and 442542 transitions. [2019-12-18 14:07:09,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:07:09,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:07:09,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:07:10,439 INFO L225 Difference]: With dead ends: 116456 [2019-12-18 14:07:10,440 INFO L226 Difference]: Without dead ends: 114036 [2019-12-18 14:07:10,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:07:18,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114036 states. [2019-12-18 14:07:20,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114036 to 114036. [2019-12-18 14:07:20,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114036 states. [2019-12-18 14:07:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114036 states to 114036 states and 433940 transitions. [2019-12-18 14:07:21,338 INFO L78 Accepts]: Start accepts. Automaton has 114036 states and 433940 transitions. Word has length 5 [2019-12-18 14:07:21,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:07:21,339 INFO L462 AbstractCegarLoop]: Abstraction has 114036 states and 433940 transitions. [2019-12-18 14:07:21,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:07:21,339 INFO L276 IsEmpty]: Start isEmpty. Operand 114036 states and 433940 transitions. [2019-12-18 14:07:21,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:07:21,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:21,341 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:07:21,342 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:21,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:21,342 INFO L82 PathProgramCache]: Analyzing trace with hash -168516540, now seen corresponding path program 1 times [2019-12-18 14:07:21,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:21,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789472285] [2019-12-18 14:07:21,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:21,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:07:21,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789472285] [2019-12-18 14:07:21,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:21,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:07:21,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305954565] [2019-12-18 14:07:21,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:07:21,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:21,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:07:21,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:07:21,429 INFO L87 Difference]: Start difference. First operand 114036 states and 433940 transitions. Second operand 4 states. [2019-12-18 14:07:26,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:26,716 INFO L93 Difference]: Finished difference Result 152998 states and 565528 transitions. [2019-12-18 14:07:26,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:07:26,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:07:26,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:07:27,443 INFO L225 Difference]: With dead ends: 152998 [2019-12-18 14:07:27,443 INFO L226 Difference]: Without dead ends: 152998 [2019-12-18 14:07:27,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:07:32,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152998 states. [2019-12-18 14:07:35,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152998 to 152836. [2019-12-18 14:07:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152836 states. [2019-12-18 14:07:36,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152836 states to 152836 states and 565076 transitions. [2019-12-18 14:07:36,095 INFO L78 Accepts]: Start accepts. Automaton has 152836 states and 565076 transitions. Word has length 11 [2019-12-18 14:07:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:07:36,095 INFO L462 AbstractCegarLoop]: Abstraction has 152836 states and 565076 transitions. [2019-12-18 14:07:36,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:07:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 152836 states and 565076 transitions. [2019-12-18 14:07:36,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:07:36,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:36,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:07:36,098 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:36,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:36,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1184191968, now seen corresponding path program 1 times [2019-12-18 14:07:36,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:36,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930190091] [2019-12-18 14:07:36,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:36,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:07:36,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930190091] [2019-12-18 14:07:36,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:36,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:07:36,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440928340] [2019-12-18 14:07:36,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:07:36,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:36,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:07:36,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:07:36,196 INFO L87 Difference]: Start difference. First operand 152836 states and 565076 transitions. Second operand 4 states. [2019-12-18 14:07:41,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:41,237 INFO L93 Difference]: Finished difference Result 198503 states and 719540 transitions. [2019-12-18 14:07:41,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:07:41,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:07:41,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:07:41,811 INFO L225 Difference]: With dead ends: 198503 [2019-12-18 14:07:41,811 INFO L226 Difference]: Without dead ends: 198503 [2019-12-18 14:07:41,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:07:51,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198503 states. [2019-12-18 14:07:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198503 to 184484. [2019-12-18 14:07:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184484 states. [2019-12-18 14:07:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184484 states to 184484 states and 671271 transitions. [2019-12-18 14:07:55,127 INFO L78 Accepts]: Start accepts. Automaton has 184484 states and 671271 transitions. Word has length 11 [2019-12-18 14:07:55,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:07:55,127 INFO L462 AbstractCegarLoop]: Abstraction has 184484 states and 671271 transitions. [2019-12-18 14:07:55,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:07:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 184484 states and 671271 transitions. [2019-12-18 14:07:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 14:07:55,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:55,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:07:55,135 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:55,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:55,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1389779890, now seen corresponding path program 1 times [2019-12-18 14:07:55,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:55,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920086214] [2019-12-18 14:07:55,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:07:55,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920086214] [2019-12-18 14:07:55,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:55,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:07:55,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377927505] [2019-12-18 14:07:55,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:07:55,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:55,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:07:55,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:07:55,227 INFO L87 Difference]: Start difference. First operand 184484 states and 671271 transitions. Second operand 5 states. [2019-12-18 14:07:57,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:57,002 INFO L93 Difference]: Finished difference Result 244942 states and 875227 transitions. [2019-12-18 14:07:57,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:07:57,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 14:07:57,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:04,701 INFO L225 Difference]: With dead ends: 244942 [2019-12-18 14:08:04,702 INFO L226 Difference]: Without dead ends: 244942 [2019-12-18 14:08:04,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:08:10,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244942 states. [2019-12-18 14:08:13,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244942 to 183475. [2019-12-18 14:08:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183475 states. [2019-12-18 14:08:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183475 states to 183475 states and 667588 transitions. [2019-12-18 14:08:14,632 INFO L78 Accepts]: Start accepts. Automaton has 183475 states and 667588 transitions. Word has length 17 [2019-12-18 14:08:14,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:14,633 INFO L462 AbstractCegarLoop]: Abstraction has 183475 states and 667588 transitions. [2019-12-18 14:08:14,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:08:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 183475 states and 667588 transitions. [2019-12-18 14:08:14,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:08:14,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:14,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:14,656 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:14,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:14,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1044109860, now seen corresponding path program 1 times [2019-12-18 14:08:14,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:14,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670801459] [2019-12-18 14:08:14,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:14,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670801459] [2019-12-18 14:08:14,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:14,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:08:14,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334841941] [2019-12-18 14:08:14,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:08:14,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:14,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:08:14,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:08:14,821 INFO L87 Difference]: Start difference. First operand 183475 states and 667588 transitions. Second operand 5 states. [2019-12-18 14:08:17,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:17,891 INFO L93 Difference]: Finished difference Result 255390 states and 912359 transitions. [2019-12-18 14:08:17,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:08:17,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 14:08:17,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:18,486 INFO L225 Difference]: With dead ends: 255390 [2019-12-18 14:08:18,486 INFO L226 Difference]: Without dead ends: 255390 [2019-12-18 14:08:18,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:08:31,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255390 states. [2019-12-18 14:08:34,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255390 to 240862. [2019-12-18 14:08:34,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240862 states. [2019-12-18 14:08:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240862 states to 240862 states and 862677 transitions. [2019-12-18 14:08:35,468 INFO L78 Accepts]: Start accepts. Automaton has 240862 states and 862677 transitions. Word has length 25 [2019-12-18 14:08:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:35,469 INFO L462 AbstractCegarLoop]: Abstraction has 240862 states and 862677 transitions. [2019-12-18 14:08:35,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:08:35,469 INFO L276 IsEmpty]: Start isEmpty. Operand 240862 states and 862677 transitions. [2019-12-18 14:08:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:08:35,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:35,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:35,491 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:35,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:35,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1942527613, now seen corresponding path program 1 times [2019-12-18 14:08:35,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:35,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484547713] [2019-12-18 14:08:35,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:35,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484547713] [2019-12-18 14:08:35,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:35,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:08:35,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011171278] [2019-12-18 14:08:35,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:08:35,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:35,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:08:35,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:08:35,566 INFO L87 Difference]: Start difference. First operand 240862 states and 862677 transitions. Second operand 4 states. [2019-12-18 14:08:35,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:35,636 INFO L93 Difference]: Finished difference Result 14741 states and 40177 transitions. [2019-12-18 14:08:35,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:08:35,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:08:35,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:35,649 INFO L225 Difference]: With dead ends: 14741 [2019-12-18 14:08:35,649 INFO L226 Difference]: Without dead ends: 10693 [2019-12-18 14:08:35,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:08:35,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10693 states. [2019-12-18 14:08:40,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10693 to 10653. [2019-12-18 14:08:40,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10653 states. [2019-12-18 14:08:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10653 states to 10653 states and 26288 transitions. [2019-12-18 14:08:40,985 INFO L78 Accepts]: Start accepts. Automaton has 10653 states and 26288 transitions. Word has length 25 [2019-12-18 14:08:40,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:40,985 INFO L462 AbstractCegarLoop]: Abstraction has 10653 states and 26288 transitions. [2019-12-18 14:08:40,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:08:40,985 INFO L276 IsEmpty]: Start isEmpty. Operand 10653 states and 26288 transitions. [2019-12-18 14:08:40,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 14:08:40,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:40,989 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-18 14:08:40,989 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:40,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:40,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1864535946, now seen corresponding path program 1 times [2019-12-18 14:08:40,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:40,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593728424] [2019-12-18 14:08:40,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:41,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:41,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593728424] [2019-12-18 14:08:41,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:41,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:08:41,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106503205] [2019-12-18 14:08:41,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:08:41,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:41,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:08:41,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:41,081 INFO L87 Difference]: Start difference. First operand 10653 states and 26288 transitions. Second operand 6 states. [2019-12-18 14:08:41,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:41,944 INFO L93 Difference]: Finished difference Result 11962 states and 29091 transitions. [2019-12-18 14:08:41,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:08:41,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-18 14:08:41,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:41,960 INFO L225 Difference]: With dead ends: 11962 [2019-12-18 14:08:41,960 INFO L226 Difference]: Without dead ends: 11914 [2019-12-18 14:08:41,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:08:41,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11914 states. [2019-12-18 14:08:42,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11914 to 11586. [2019-12-18 14:08:42,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11586 states. [2019-12-18 14:08:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11586 states to 11586 states and 28348 transitions. [2019-12-18 14:08:42,086 INFO L78 Accepts]: Start accepts. Automaton has 11586 states and 28348 transitions. Word has length 38 [2019-12-18 14:08:42,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:42,087 INFO L462 AbstractCegarLoop]: Abstraction has 11586 states and 28348 transitions. [2019-12-18 14:08:42,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:08:42,087 INFO L276 IsEmpty]: Start isEmpty. Operand 11586 states and 28348 transitions. [2019-12-18 14:08:42,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 14:08:42,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:42,094 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-18 14:08:42,094 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:42,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:42,095 INFO L82 PathProgramCache]: Analyzing trace with hash -555471960, now seen corresponding path program 1 times [2019-12-18 14:08:42,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:42,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195513673] [2019-12-18 14:08:42,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:42,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:42,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195513673] [2019-12-18 14:08:42,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:42,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:08:42,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712274994] [2019-12-18 14:08:42,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:08:42,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:42,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:08:42,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:08:42,214 INFO L87 Difference]: Start difference. First operand 11586 states and 28348 transitions. Second operand 7 states. [2019-12-18 14:08:43,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:43,415 INFO L93 Difference]: Finished difference Result 13314 states and 32232 transitions. [2019-12-18 14:08:43,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:08:43,415 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-18 14:08:43,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:43,431 INFO L225 Difference]: With dead ends: 13314 [2019-12-18 14:08:43,432 INFO L226 Difference]: Without dead ends: 13314 [2019-12-18 14:08:43,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:08:43,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13314 states. [2019-12-18 14:08:43,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13314 to 11791. [2019-12-18 14:08:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11791 states. [2019-12-18 14:08:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11791 states to 11791 states and 28782 transitions. [2019-12-18 14:08:43,568 INFO L78 Accepts]: Start accepts. Automaton has 11791 states and 28782 transitions. Word has length 50 [2019-12-18 14:08:43,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:43,569 INFO L462 AbstractCegarLoop]: Abstraction has 11791 states and 28782 transitions. [2019-12-18 14:08:43,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:08:43,569 INFO L276 IsEmpty]: Start isEmpty. Operand 11791 states and 28782 transitions. [2019-12-18 14:08:43,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 14:08:43,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:43,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:43,577 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:43,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:43,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1176117867, now seen corresponding path program 1 times [2019-12-18 14:08:43,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:43,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275254455] [2019-12-18 14:08:43,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:43,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:43,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275254455] [2019-12-18 14:08:43,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:43,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:08:43,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993639461] [2019-12-18 14:08:43,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:08:43,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:43,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:08:43,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:08:43,673 INFO L87 Difference]: Start difference. First operand 11791 states and 28782 transitions. Second operand 5 states. [2019-12-18 14:08:44,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:44,515 INFO L93 Difference]: Finished difference Result 13152 states and 31669 transitions. [2019-12-18 14:08:44,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:08:44,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 14:08:44,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:44,530 INFO L225 Difference]: With dead ends: 13152 [2019-12-18 14:08:44,530 INFO L226 Difference]: Without dead ends: 13152 [2019-12-18 14:08:44,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:44,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13152 states. [2019-12-18 14:08:44,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13152 to 12781. [2019-12-18 14:08:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12781 states. [2019-12-18 14:08:44,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12781 states to 12781 states and 30933 transitions. [2019-12-18 14:08:44,785 INFO L78 Accepts]: Start accepts. Automaton has 12781 states and 30933 transitions. Word has length 57 [2019-12-18 14:08:44,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:44,786 INFO L462 AbstractCegarLoop]: Abstraction has 12781 states and 30933 transitions. [2019-12-18 14:08:44,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:08:44,786 INFO L276 IsEmpty]: Start isEmpty. Operand 12781 states and 30933 transitions. [2019-12-18 14:08:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 14:08:44,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:44,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:44,795 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:44,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:44,795 INFO L82 PathProgramCache]: Analyzing trace with hash -313859631, now seen corresponding path program 1 times [2019-12-18 14:08:44,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:44,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649796990] [2019-12-18 14:08:44,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:44,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-18 14:08:44,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649796990] [2019-12-18 14:08:44,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:44,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:08:44,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727880662] [2019-12-18 14:08:44,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:08:44,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:44,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:08:44,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:08:44,965 INFO L87 Difference]: Start difference. First operand 12781 states and 30933 transitions. Second operand 5 states. [2019-12-18 14:08:45,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:45,124 INFO L93 Difference]: Finished difference Result 13209 states and 31846 transitions. [2019-12-18 14:08:45,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:08:45,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 14:08:45,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:45,140 INFO L225 Difference]: With dead ends: 13209 [2019-12-18 14:08:45,140 INFO L226 Difference]: Without dead ends: 13009 [2019-12-18 14:08:45,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:08:45,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13009 states. [2019-12-18 14:08:45,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13009 to 12709. [2019-12-18 14:08:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12709 states. [2019-12-18 14:08:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12709 states to 12709 states and 30712 transitions. [2019-12-18 14:08:45,281 INFO L78 Accepts]: Start accepts. Automaton has 12709 states and 30712 transitions. Word has length 58 [2019-12-18 14:08:45,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:45,281 INFO L462 AbstractCegarLoop]: Abstraction has 12709 states and 30712 transitions. [2019-12-18 14:08:45,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:08:45,282 INFO L276 IsEmpty]: Start isEmpty. Operand 12709 states and 30712 transitions. [2019-12-18 14:08:45,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:08:45,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:45,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:45,293 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:45,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:45,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1587335685, now seen corresponding path program 1 times [2019-12-18 14:08:45,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:45,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648534119] [2019-12-18 14:08:45,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:45,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648534119] [2019-12-18 14:08:45,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:45,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:08:45,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393664552] [2019-12-18 14:08:45,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:08:45,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:45,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:08:45,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:08:45,392 INFO L87 Difference]: Start difference. First operand 12709 states and 30712 transitions. Second operand 5 states. [2019-12-18 14:08:45,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:45,445 INFO L93 Difference]: Finished difference Result 5405 states and 12587 transitions. [2019-12-18 14:08:45,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:08:45,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-18 14:08:45,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:45,452 INFO L225 Difference]: With dead ends: 5405 [2019-12-18 14:08:45,452 INFO L226 Difference]: Without dead ends: 5151 [2019-12-18 14:08:45,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:08:45,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5151 states. [2019-12-18 14:08:45,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5151 to 4998. [2019-12-18 14:08:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4998 states. [2019-12-18 14:08:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4998 states to 4998 states and 11757 transitions. [2019-12-18 14:08:45,504 INFO L78 Accepts]: Start accepts. Automaton has 4998 states and 11757 transitions. Word has length 64 [2019-12-18 14:08:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:45,504 INFO L462 AbstractCegarLoop]: Abstraction has 4998 states and 11757 transitions. [2019-12-18 14:08:45,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:08:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4998 states and 11757 transitions. [2019-12-18 14:08:45,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:45,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:45,510 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-18 14:08:45,510 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:45,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:45,511 INFO L82 PathProgramCache]: Analyzing trace with hash 608253419, now seen corresponding path program 1 times [2019-12-18 14:08:45,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:45,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356496934] [2019-12-18 14:08:45,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:45,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:45,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356496934] [2019-12-18 14:08:45,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:45,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:08:45,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223141960] [2019-12-18 14:08:45,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:08:45,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:45,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:08:45,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:45,634 INFO L87 Difference]: Start difference. First operand 4998 states and 11757 transitions. Second operand 6 states. [2019-12-18 14:08:46,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:46,434 INFO L93 Difference]: Finished difference Result 6626 states and 15449 transitions. [2019-12-18 14:08:46,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:08:46,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-18 14:08:46,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:46,444 INFO L225 Difference]: With dead ends: 6626 [2019-12-18 14:08:46,444 INFO L226 Difference]: Without dead ends: 6626 [2019-12-18 14:08:46,445 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-18 14:08:46,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6626 states. [2019-12-18 14:08:46,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6626 to 6177. [2019-12-18 14:08:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6177 states. [2019-12-18 14:08:46,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6177 states to 6177 states and 14495 transitions. [2019-12-18 14:08:46,538 INFO L78 Accepts]: Start accepts. Automaton has 6177 states and 14495 transitions. Word has length 94 [2019-12-18 14:08:46,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:46,538 INFO L462 AbstractCegarLoop]: Abstraction has 6177 states and 14495 transitions. [2019-12-18 14:08:46,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:08:46,538 INFO L276 IsEmpty]: Start isEmpty. Operand 6177 states and 14495 transitions. [2019-12-18 14:08:46,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:46,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:46,547 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-18 14:08:46,547 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:46,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:46,547 INFO L82 PathProgramCache]: Analyzing trace with hash 577720363, now seen corresponding path program 2 times [2019-12-18 14:08:46,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:46,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943553694] [2019-12-18 14:08:46,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:46,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943553694] [2019-12-18 14:08:46,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:46,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:08:46,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686188469] [2019-12-18 14:08:46,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:08:46,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:46,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:08:46,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:08:46,668 INFO L87 Difference]: Start difference. First operand 6177 states and 14495 transitions. Second operand 7 states. [2019-12-18 14:08:47,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:47,682 INFO L93 Difference]: Finished difference Result 7484 states and 17393 transitions. [2019-12-18 14:08:47,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:08:47,683 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-18 14:08:47,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:47,692 INFO L225 Difference]: With dead ends: 7484 [2019-12-18 14:08:47,692 INFO L226 Difference]: Without dead ends: 7484 [2019-12-18 14:08:47,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:08:47,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7484 states. [2019-12-18 14:08:47,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7484 to 6666. [2019-12-18 14:08:47,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6666 states. [2019-12-18 14:08:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6666 states to 6666 states and 15594 transitions. [2019-12-18 14:08:47,770 INFO L78 Accepts]: Start accepts. Automaton has 6666 states and 15594 transitions. Word has length 94 [2019-12-18 14:08:47,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:47,770 INFO L462 AbstractCegarLoop]: Abstraction has 6666 states and 15594 transitions. [2019-12-18 14:08:47,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:08:47,770 INFO L276 IsEmpty]: Start isEmpty. Operand 6666 states and 15594 transitions. [2019-12-18 14:08:47,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:47,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:47,780 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-18 14:08:47,780 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:47,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:47,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1726596845, now seen corresponding path program 3 times [2019-12-18 14:08:47,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:47,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450367302] [2019-12-18 14:08:47,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:47,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450367302] [2019-12-18 14:08:47,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:47,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:08:47,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295919611] [2019-12-18 14:08:47,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:08:47,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:47,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:08:47,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:08:47,881 INFO L87 Difference]: Start difference. First operand 6666 states and 15594 transitions. Second operand 5 states. [2019-12-18 14:08:48,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:48,442 INFO L93 Difference]: Finished difference Result 7181 states and 16661 transitions. [2019-12-18 14:08:48,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:08:48,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-18 14:08:48,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:48,453 INFO L225 Difference]: With dead ends: 7181 [2019-12-18 14:08:48,453 INFO L226 Difference]: Without dead ends: 7181 [2019-12-18 14:08:48,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7181 states. [2019-12-18 14:08:48,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7181 to 6807. [2019-12-18 14:08:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6807 states. [2019-12-18 14:08:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6807 states to 6807 states and 15915 transitions. [2019-12-18 14:08:48,630 INFO L78 Accepts]: Start accepts. Automaton has 6807 states and 15915 transitions. Word has length 94 [2019-12-18 14:08:48,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:48,630 INFO L462 AbstractCegarLoop]: Abstraction has 6807 states and 15915 transitions. [2019-12-18 14:08:48,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:08:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 6807 states and 15915 transitions. [2019-12-18 14:08:48,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:48,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:48,643 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-18 14:08:48,644 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:48,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:48,644 INFO L82 PathProgramCache]: Analyzing trace with hash 2017255555, now seen corresponding path program 4 times [2019-12-18 14:08:48,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:48,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553923531] [2019-12-18 14:08:48,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:48,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553923531] [2019-12-18 14:08:48,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:48,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:08:48,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762050319] [2019-12-18 14:08:48,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:08:48,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:48,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:08:48,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:48,826 INFO L87 Difference]: Start difference. First operand 6807 states and 15915 transitions. Second operand 6 states. [2019-12-18 14:08:49,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:49,464 INFO L93 Difference]: Finished difference Result 7132 states and 16535 transitions. [2019-12-18 14:08:49,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:08:49,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-18 14:08:49,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:49,475 INFO L225 Difference]: With dead ends: 7132 [2019-12-18 14:08:49,475 INFO L226 Difference]: Without dead ends: 7132 [2019-12-18 14:08:49,477 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-18 14:08:49,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7132 states. [2019-12-18 14:08:49,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7132 to 6891. [2019-12-18 14:08:49,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6891 states. [2019-12-18 14:08:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6891 states to 6891 states and 16087 transitions. [2019-12-18 14:08:49,588 INFO L78 Accepts]: Start accepts. Automaton has 6891 states and 16087 transitions. Word has length 94 [2019-12-18 14:08:49,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:49,589 INFO L462 AbstractCegarLoop]: Abstraction has 6891 states and 16087 transitions. [2019-12-18 14:08:49,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:08:49,589 INFO L276 IsEmpty]: Start isEmpty. Operand 6891 states and 16087 transitions. [2019-12-18 14:08:49,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:49,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:49,600 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-18 14:08:49,600 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:49,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:49,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1442306179, now seen corresponding path program 5 times [2019-12-18 14:08:49,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:49,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325641992] [2019-12-18 14:08:49,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:49,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325641992] [2019-12-18 14:08:49,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:49,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:08:49,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082810087] [2019-12-18 14:08:49,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:08:49,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:49,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:08:49,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:08:49,722 INFO L87 Difference]: Start difference. First operand 6891 states and 16087 transitions. Second operand 3 states. [2019-12-18 14:08:49,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:49,781 INFO L93 Difference]: Finished difference Result 6891 states and 16086 transitions. [2019-12-18 14:08:49,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:08:49,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-18 14:08:49,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:49,791 INFO L225 Difference]: With dead ends: 6891 [2019-12-18 14:08:49,792 INFO L226 Difference]: Without dead ends: 6891 [2019-12-18 14:08:49,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:08:49,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6891 states. [2019-12-18 14:08:49,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6891 to 6683. [2019-12-18 14:08:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6683 states. [2019-12-18 14:08:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6683 states to 6683 states and 15685 transitions. [2019-12-18 14:08:49,912 INFO L78 Accepts]: Start accepts. Automaton has 6683 states and 15685 transitions. Word has length 94 [2019-12-18 14:08:49,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:49,913 INFO L462 AbstractCegarLoop]: Abstraction has 6683 states and 15685 transitions. [2019-12-18 14:08:49,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:08:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 6683 states and 15685 transitions. [2019-12-18 14:08:49,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 14:08:49,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:49,924 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-18 14:08:49,924 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:49,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:49,924 INFO L82 PathProgramCache]: Analyzing trace with hash -524016775, now seen corresponding path program 1 times [2019-12-18 14:08:49,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:49,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933197128] [2019-12-18 14:08:49,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:50,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933197128] [2019-12-18 14:08:50,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:50,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:08:50,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760840351] [2019-12-18 14:08:50,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:08:50,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:50,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:08:50,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:08:50,044 INFO L87 Difference]: Start difference. First operand 6683 states and 15685 transitions. Second operand 4 states. [2019-12-18 14:08:50,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:50,480 INFO L93 Difference]: Finished difference Result 9635 states and 23047 transitions. [2019-12-18 14:08:50,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:08:50,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-18 14:08:50,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:50,495 INFO L225 Difference]: With dead ends: 9635 [2019-12-18 14:08:50,495 INFO L226 Difference]: Without dead ends: 9635 [2019-12-18 14:08:50,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:08:50,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9635 states. [2019-12-18 14:08:50,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9635 to 7505. [2019-12-18 14:08:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7505 states. [2019-12-18 14:08:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7505 states to 7505 states and 17629 transitions. [2019-12-18 14:08:50,600 INFO L78 Accepts]: Start accepts. Automaton has 7505 states and 17629 transitions. Word has length 95 [2019-12-18 14:08:50,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:50,600 INFO L462 AbstractCegarLoop]: Abstraction has 7505 states and 17629 transitions. [2019-12-18 14:08:50,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:08:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand 7505 states and 17629 transitions. [2019-12-18 14:08:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:50,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:50,608 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-18 14:08:50,608 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:50,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:50,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1607730014, now seen corresponding path program 1 times [2019-12-18 14:08:50,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:50,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339793117] [2019-12-18 14:08:50,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:50,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339793117] [2019-12-18 14:08:50,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:50,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:08:50,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798182283] [2019-12-18 14:08:50,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:08:50,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:50,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:08:50,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:08:50,705 INFO L87 Difference]: Start difference. First operand 7505 states and 17629 transitions. Second operand 5 states. [2019-12-18 14:08:51,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:51,274 INFO L93 Difference]: Finished difference Result 9424 states and 22296 transitions. [2019-12-18 14:08:51,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:08:51,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-18 14:08:51,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:51,286 INFO L225 Difference]: With dead ends: 9424 [2019-12-18 14:08:51,286 INFO L226 Difference]: Without dead ends: 9424 [2019-12-18 14:08:51,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9424 states. [2019-12-18 14:08:51,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9424 to 8093. [2019-12-18 14:08:51,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8093 states. [2019-12-18 14:08:51,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8093 states to 8093 states and 19115 transitions. [2019-12-18 14:08:51,378 INFO L78 Accepts]: Start accepts. Automaton has 8093 states and 19115 transitions. Word has length 96 [2019-12-18 14:08:51,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:51,378 INFO L462 AbstractCegarLoop]: Abstraction has 8093 states and 19115 transitions. [2019-12-18 14:08:51,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:08:51,379 INFO L276 IsEmpty]: Start isEmpty. Operand 8093 states and 19115 transitions. [2019-12-18 14:08:51,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:51,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:51,386 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-18 14:08:51,386 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:51,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:51,387 INFO L82 PathProgramCache]: Analyzing trace with hash 798116452, now seen corresponding path program 2 times [2019-12-18 14:08:51,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:51,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179190044] [2019-12-18 14:08:51,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:51,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:51,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179190044] [2019-12-18 14:08:51,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:51,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:08:51,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749820602] [2019-12-18 14:08:51,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:08:51,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:51,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:08:51,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:08:51,545 INFO L87 Difference]: Start difference. First operand 8093 states and 19115 transitions. Second operand 10 states. [2019-12-18 14:08:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:52,602 INFO L93 Difference]: Finished difference Result 14995 states and 35141 transitions. [2019-12-18 14:08:52,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 14:08:52,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:08:52,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:52,619 INFO L225 Difference]: With dead ends: 14995 [2019-12-18 14:08:52,619 INFO L226 Difference]: Without dead ends: 13933 [2019-12-18 14:08:52,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:08:52,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13933 states. [2019-12-18 14:08:52,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13933 to 9795. [2019-12-18 14:08:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9795 states. [2019-12-18 14:08:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9795 states to 9795 states and 23671 transitions. [2019-12-18 14:08:52,764 INFO L78 Accepts]: Start accepts. Automaton has 9795 states and 23671 transitions. Word has length 96 [2019-12-18 14:08:52,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:52,764 INFO L462 AbstractCegarLoop]: Abstraction has 9795 states and 23671 transitions. [2019-12-18 14:08:52,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:08:52,765 INFO L276 IsEmpty]: Start isEmpty. Operand 9795 states and 23671 transitions. [2019-12-18 14:08:52,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:52,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:52,780 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-18 14:08:52,780 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:52,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:52,780 INFO L82 PathProgramCache]: Analyzing trace with hash -517412620, now seen corresponding path program 3 times [2019-12-18 14:08:52,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:52,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679895913] [2019-12-18 14:08:52,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:52,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:52,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679895913] [2019-12-18 14:08:52,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:52,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:08:52,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606999737] [2019-12-18 14:08:52,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:08:52,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:52,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:08:52,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:52,886 INFO L87 Difference]: Start difference. First operand 9795 states and 23671 transitions. Second operand 6 states. [2019-12-18 14:08:53,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:53,352 INFO L93 Difference]: Finished difference Result 12011 states and 28985 transitions. [2019-12-18 14:08:53,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:08:53,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-18 14:08:53,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:53,366 INFO L225 Difference]: With dead ends: 12011 [2019-12-18 14:08:53,366 INFO L226 Difference]: Without dead ends: 12011 [2019-12-18 14:08:53,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:08:53,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12011 states. [2019-12-18 14:08:53,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12011 to 9800. [2019-12-18 14:08:53,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9800 states. [2019-12-18 14:08:53,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9800 states to 9800 states and 23683 transitions. [2019-12-18 14:08:53,483 INFO L78 Accepts]: Start accepts. Automaton has 9800 states and 23683 transitions. Word has length 96 [2019-12-18 14:08:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:53,484 INFO L462 AbstractCegarLoop]: Abstraction has 9800 states and 23683 transitions. [2019-12-18 14:08:53,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:08:53,484 INFO L276 IsEmpty]: Start isEmpty. Operand 9800 states and 23683 transitions. [2019-12-18 14:08:53,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:53,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:53,497 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-18 14:08:53,497 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:53,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:53,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1061893144, now seen corresponding path program 4 times [2019-12-18 14:08:53,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:53,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470701945] [2019-12-18 14:08:53,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:54,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:54,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470701945] [2019-12-18 14:08:54,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:54,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 14:08:54,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216027789] [2019-12-18 14:08:54,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 14:08:54,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:54,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 14:08:54,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:08:54,002 INFO L87 Difference]: Start difference. First operand 9800 states and 23683 transitions. Second operand 18 states. [2019-12-18 14:08:57,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:57,236 INFO L93 Difference]: Finished difference Result 15882 states and 38117 transitions. [2019-12-18 14:08:57,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 14:08:57,241 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2019-12-18 14:08:57,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:57,257 INFO L225 Difference]: With dead ends: 15882 [2019-12-18 14:08:57,257 INFO L226 Difference]: Without dead ends: 15852 [2019-12-18 14:08:57,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=248, Invalid=1474, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 14:08:57,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15852 states. [2019-12-18 14:08:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15852 to 11632. [2019-12-18 14:08:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11632 states. [2019-12-18 14:08:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11632 states to 11632 states and 28354 transitions. [2019-12-18 14:08:57,398 INFO L78 Accepts]: Start accepts. Automaton has 11632 states and 28354 transitions. Word has length 96 [2019-12-18 14:08:57,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:57,398 INFO L462 AbstractCegarLoop]: Abstraction has 11632 states and 28354 transitions. [2019-12-18 14:08:57,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 14:08:57,398 INFO L276 IsEmpty]: Start isEmpty. Operand 11632 states and 28354 transitions. [2019-12-18 14:08:57,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:57,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:57,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:57,409 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:57,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:57,409 INFO L82 PathProgramCache]: Analyzing trace with hash 471395218, now seen corresponding path program 5 times [2019-12-18 14:08:57,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:57,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408938558] [2019-12-18 14:08:57,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:57,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408938558] [2019-12-18 14:08:57,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:57,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:08:57,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653336210] [2019-12-18 14:08:57,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:08:57,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:57,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:08:57,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:57,506 INFO L87 Difference]: Start difference. First operand 11632 states and 28354 transitions. Second operand 6 states. [2019-12-18 14:08:58,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:58,143 INFO L93 Difference]: Finished difference Result 12117 states and 29287 transitions. [2019-12-18 14:08:58,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:08:58,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-18 14:08:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:58,157 INFO L225 Difference]: With dead ends: 12117 [2019-12-18 14:08:58,158 INFO L226 Difference]: Without dead ends: 12117 [2019-12-18 14:08:58,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:08:58,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12117 states. [2019-12-18 14:08:58,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12117 to 11536. [2019-12-18 14:08:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11536 states. [2019-12-18 14:08:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11536 states to 11536 states and 28160 transitions. [2019-12-18 14:08:58,303 INFO L78 Accepts]: Start accepts. Automaton has 11536 states and 28160 transitions. Word has length 96 [2019-12-18 14:08:58,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:58,303 INFO L462 AbstractCegarLoop]: Abstraction has 11536 states and 28160 transitions. [2019-12-18 14:08:58,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:08:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand 11536 states and 28160 transitions. [2019-12-18 14:08:58,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:58,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:58,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:58,314 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:58,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:58,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1234955586, now seen corresponding path program 6 times [2019-12-18 14:08:58,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:58,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543275479] [2019-12-18 14:08:58,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:58,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:58,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543275479] [2019-12-18 14:08:58,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:58,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:08:58,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616192120] [2019-12-18 14:08:58,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:08:58,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:58,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:08:58,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:08:58,496 INFO L87 Difference]: Start difference. First operand 11536 states and 28160 transitions. Second operand 10 states. [2019-12-18 14:08:59,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:59,550 INFO L93 Difference]: Finished difference Result 21776 states and 51432 transitions. [2019-12-18 14:08:59,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 14:08:59,550 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:08:59,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:59,574 INFO L225 Difference]: With dead ends: 21776 [2019-12-18 14:08:59,575 INFO L226 Difference]: Without dead ends: 20028 [2019-12-18 14:08:59,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-18 14:08:59,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20028 states. [2019-12-18 14:08:59,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20028 to 14323. [2019-12-18 14:08:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14323 states. [2019-12-18 14:08:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14323 states to 14323 states and 35241 transitions. [2019-12-18 14:08:59,784 INFO L78 Accepts]: Start accepts. Automaton has 14323 states and 35241 transitions. Word has length 96 [2019-12-18 14:08:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:59,784 INFO L462 AbstractCegarLoop]: Abstraction has 14323 states and 35241 transitions. [2019-12-18 14:08:59,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:08:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 14323 states and 35241 transitions. [2019-12-18 14:08:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:59,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:59,798 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-18 14:08:59,798 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:59,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:59,798 INFO L82 PathProgramCache]: Analyzing trace with hash 2113869856, now seen corresponding path program 7 times [2019-12-18 14:08:59,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:59,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098946604] [2019-12-18 14:08:59,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:00,068 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 9 [2019-12-18 14:09:00,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:00,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098946604] [2019-12-18 14:09:00,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:00,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:09:00,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602445042] [2019-12-18 14:09:00,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:09:00,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:00,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:09:00,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:09:00,084 INFO L87 Difference]: Start difference. First operand 14323 states and 35241 transitions. Second operand 6 states. [2019-12-18 14:09:00,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:00,441 INFO L93 Difference]: Finished difference Result 13103 states and 32281 transitions. [2019-12-18 14:09:00,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:09:00,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-18 14:09:00,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:00,461 INFO L225 Difference]: With dead ends: 13103 [2019-12-18 14:09:00,461 INFO L226 Difference]: Without dead ends: 13103 [2019-12-18 14:09:00,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:09:00,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13103 states. [2019-12-18 14:09:00,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13103 to 12825. [2019-12-18 14:09:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12825 states. [2019-12-18 14:09:00,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12825 states to 12825 states and 31671 transitions. [2019-12-18 14:09:00,599 INFO L78 Accepts]: Start accepts. Automaton has 12825 states and 31671 transitions. Word has length 96 [2019-12-18 14:09:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:00,599 INFO L462 AbstractCegarLoop]: Abstraction has 12825 states and 31671 transitions. [2019-12-18 14:09:00,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:09:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 12825 states and 31671 transitions. [2019-12-18 14:09:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:00,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:00,611 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-18 14:09:00,611 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:00,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:00,611 INFO L82 PathProgramCache]: Analyzing trace with hash 888465312, now seen corresponding path program 8 times [2019-12-18 14:09:00,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:00,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497075755] [2019-12-18 14:09:00,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:00,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497075755] [2019-12-18 14:09:00,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:00,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:09:00,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742459942] [2019-12-18 14:09:00,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:09:00,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:00,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:09:00,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:09:00,730 INFO L87 Difference]: Start difference. First operand 12825 states and 31671 transitions. Second operand 7 states. [2019-12-18 14:09:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:01,050 INFO L93 Difference]: Finished difference Result 15300 states and 37084 transitions. [2019-12-18 14:09:01,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:09:01,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-12-18 14:09:01,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:01,078 INFO L225 Difference]: With dead ends: 15300 [2019-12-18 14:09:01,078 INFO L226 Difference]: Without dead ends: 13727 [2019-12-18 14:09:01,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:09:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13727 states. [2019-12-18 14:09:01,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13727 to 13285. [2019-12-18 14:09:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13285 states. [2019-12-18 14:09:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13285 states to 13285 states and 32774 transitions. [2019-12-18 14:09:01,387 INFO L78 Accepts]: Start accepts. Automaton has 13285 states and 32774 transitions. Word has length 96 [2019-12-18 14:09:01,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:01,388 INFO L462 AbstractCegarLoop]: Abstraction has 13285 states and 32774 transitions. [2019-12-18 14:09:01,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:09:01,388 INFO L276 IsEmpty]: Start isEmpty. Operand 13285 states and 32774 transitions. [2019-12-18 14:09:01,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:01,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:01,412 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-18 14:09:01,412 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:01,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:01,413 INFO L82 PathProgramCache]: Analyzing trace with hash 124775068, now seen corresponding path program 9 times [2019-12-18 14:09:01,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:01,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478097370] [2019-12-18 14:09:01,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:01,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478097370] [2019-12-18 14:09:01,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:01,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:09:01,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909032108] [2019-12-18 14:09:01,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:09:01,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:01,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:09:01,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:09:01,718 INFO L87 Difference]: Start difference. First operand 13285 states and 32774 transitions. Second operand 11 states. [2019-12-18 14:09:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:03,781 INFO L93 Difference]: Finished difference Result 29650 states and 73677 transitions. [2019-12-18 14:09:03,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 14:09:03,781 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 14:09:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:03,815 INFO L225 Difference]: With dead ends: 29650 [2019-12-18 14:09:03,816 INFO L226 Difference]: Without dead ends: 29650 [2019-12-18 14:09:03,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:09:03,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29650 states. [2019-12-18 14:09:04,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29650 to 16316. [2019-12-18 14:09:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16316 states. [2019-12-18 14:09:04,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16316 states to 16316 states and 40812 transitions. [2019-12-18 14:09:04,163 INFO L78 Accepts]: Start accepts. Automaton has 16316 states and 40812 transitions. Word has length 96 [2019-12-18 14:09:04,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:04,163 INFO L462 AbstractCegarLoop]: Abstraction has 16316 states and 40812 transitions. [2019-12-18 14:09:04,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:09:04,163 INFO L276 IsEmpty]: Start isEmpty. Operand 16316 states and 40812 transitions. [2019-12-18 14:09:04,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:04,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:04,178 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-18 14:09:04,178 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:04,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:04,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1598558890, now seen corresponding path program 10 times [2019-12-18 14:09:04,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:04,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165215105] [2019-12-18 14:09:04,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:04,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:04,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165215105] [2019-12-18 14:09:04,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:04,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:09:04,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17976938] [2019-12-18 14:09:04,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:09:04,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:04,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:09:04,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:09:04,307 INFO L87 Difference]: Start difference. First operand 16316 states and 40812 transitions. Second operand 10 states. [2019-12-18 14:09:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:04,938 INFO L93 Difference]: Finished difference Result 29807 states and 74629 transitions. [2019-12-18 14:09:04,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:09:04,939 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:09:04,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:04,973 INFO L225 Difference]: With dead ends: 29807 [2019-12-18 14:09:04,974 INFO L226 Difference]: Without dead ends: 28956 [2019-12-18 14:09:04,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-12-18 14:09:05,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28956 states. [2019-12-18 14:09:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28956 to 23653. [2019-12-18 14:09:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23653 states. [2019-12-18 14:09:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23653 states to 23653 states and 60613 transitions. [2019-12-18 14:09:05,298 INFO L78 Accepts]: Start accepts. Automaton has 23653 states and 60613 transitions. Word has length 96 [2019-12-18 14:09:05,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:05,298 INFO L462 AbstractCegarLoop]: Abstraction has 23653 states and 60613 transitions. [2019-12-18 14:09:05,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:09:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 23653 states and 60613 transitions. [2019-12-18 14:09:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:05,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:05,322 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-18 14:09:05,323 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:05,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:05,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1612181706, now seen corresponding path program 11 times [2019-12-18 14:09:05,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:05,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950615405] [2019-12-18 14:09:05,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:05,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950615405] [2019-12-18 14:09:05,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:05,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:09:05,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225012021] [2019-12-18 14:09:05,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:09:05,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:05,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:09:05,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:09:05,507 INFO L87 Difference]: Start difference. First operand 23653 states and 60613 transitions. Second operand 10 states. [2019-12-18 14:09:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:06,641 INFO L93 Difference]: Finished difference Result 34554 states and 86563 transitions. [2019-12-18 14:09:06,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 14:09:06,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:09:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:06,695 INFO L225 Difference]: With dead ends: 34554 [2019-12-18 14:09:06,695 INFO L226 Difference]: Without dead ends: 33930 [2019-12-18 14:09:06,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:09:06,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33930 states. [2019-12-18 14:09:07,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33930 to 24370. [2019-12-18 14:09:07,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24370 states. [2019-12-18 14:09:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24370 states to 24370 states and 62486 transitions. [2019-12-18 14:09:07,200 INFO L78 Accepts]: Start accepts. Automaton has 24370 states and 62486 transitions. Word has length 96 [2019-12-18 14:09:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:07,200 INFO L462 AbstractCegarLoop]: Abstraction has 24370 states and 62486 transitions. [2019-12-18 14:09:07,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:09:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 24370 states and 62486 transitions. [2019-12-18 14:09:07,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:07,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:07,226 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-18 14:09:07,226 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:07,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:07,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1233995906, now seen corresponding path program 12 times [2019-12-18 14:09:07,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:07,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506947697] [2019-12-18 14:09:07,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:07,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506947697] [2019-12-18 14:09:07,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:07,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:09:07,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59057678] [2019-12-18 14:09:07,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:09:07,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:07,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:09:07,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:09:07,387 INFO L87 Difference]: Start difference. First operand 24370 states and 62486 transitions. Second operand 9 states. [2019-12-18 14:09:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:08,614 INFO L93 Difference]: Finished difference Result 27611 states and 70151 transitions. [2019-12-18 14:09:08,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 14:09:08,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-18 14:09:08,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:08,649 INFO L225 Difference]: With dead ends: 27611 [2019-12-18 14:09:08,649 INFO L226 Difference]: Without dead ends: 26919 [2019-12-18 14:09:08,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:09:08,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26919 states. [2019-12-18 14:09:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26919 to 24560. [2019-12-18 14:09:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24560 states. [2019-12-18 14:09:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24560 states to 24560 states and 62890 transitions. [2019-12-18 14:09:08,971 INFO L78 Accepts]: Start accepts. Automaton has 24560 states and 62890 transitions. Word has length 96 [2019-12-18 14:09:08,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:08,971 INFO L462 AbstractCegarLoop]: Abstraction has 24560 states and 62890 transitions. [2019-12-18 14:09:08,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:09:08,971 INFO L276 IsEmpty]: Start isEmpty. Operand 24560 states and 62890 transitions. [2019-12-18 14:09:08,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:08,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:08,995 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-18 14:09:08,995 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:08,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:08,995 INFO L82 PathProgramCache]: Analyzing trace with hash 247628674, now seen corresponding path program 13 times [2019-12-18 14:09:08,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:08,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995270187] [2019-12-18 14:09:08,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:09,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995270187] [2019-12-18 14:09:09,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:09,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:09:09,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91031886] [2019-12-18 14:09:09,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:09:09,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:09,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:09:09,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:09:09,327 INFO L87 Difference]: Start difference. First operand 24560 states and 62890 transitions. Second operand 16 states. [2019-12-18 14:09:12,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:12,106 INFO L93 Difference]: Finished difference Result 42415 states and 108003 transitions. [2019-12-18 14:09:12,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 14:09:12,111 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 96 [2019-12-18 14:09:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:12,158 INFO L225 Difference]: With dead ends: 42415 [2019-12-18 14:09:12,158 INFO L226 Difference]: Without dead ends: 38929 [2019-12-18 14:09:12,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=313, Invalid=1579, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 14:09:12,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38929 states. [2019-12-18 14:09:12,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38929 to 32354. [2019-12-18 14:09:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32354 states. [2019-12-18 14:09:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32354 states to 32354 states and 83438 transitions. [2019-12-18 14:09:12,592 INFO L78 Accepts]: Start accepts. Automaton has 32354 states and 83438 transitions. Word has length 96 [2019-12-18 14:09:12,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:12,592 INFO L462 AbstractCegarLoop]: Abstraction has 32354 states and 83438 transitions. [2019-12-18 14:09:12,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:09:12,592 INFO L276 IsEmpty]: Start isEmpty. Operand 32354 states and 83438 transitions. [2019-12-18 14:09:12,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:12,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:12,624 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-18 14:09:12,624 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:12,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:12,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1483719856, now seen corresponding path program 14 times [2019-12-18 14:09:12,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:12,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320092977] [2019-12-18 14:09:12,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:12,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320092977] [2019-12-18 14:09:12,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:12,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 14:09:12,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509259368] [2019-12-18 14:09:12,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 14:09:12,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:12,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 14:09:12,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:09:12,982 INFO L87 Difference]: Start difference. First operand 32354 states and 83438 transitions. Second operand 17 states. [2019-12-18 14:09:17,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:17,840 INFO L93 Difference]: Finished difference Result 65342 states and 166937 transitions. [2019-12-18 14:09:17,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-18 14:09:17,841 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-12-18 14:09:17,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:17,930 INFO L225 Difference]: With dead ends: 65342 [2019-12-18 14:09:17,930 INFO L226 Difference]: Without dead ends: 64085 [2019-12-18 14:09:17,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=395, Invalid=2467, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 14:09:18,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64085 states. [2019-12-18 14:09:18,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64085 to 45574. [2019-12-18 14:09:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45574 states. [2019-12-18 14:09:18,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45574 states to 45574 states and 118736 transitions. [2019-12-18 14:09:18,814 INFO L78 Accepts]: Start accepts. Automaton has 45574 states and 118736 transitions. Word has length 96 [2019-12-18 14:09:18,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:18,815 INFO L462 AbstractCegarLoop]: Abstraction has 45574 states and 118736 transitions. [2019-12-18 14:09:18,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 14:09:18,815 INFO L276 IsEmpty]: Start isEmpty. Operand 45574 states and 118736 transitions. [2019-12-18 14:09:18,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:18,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:18,860 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-18 14:09:18,860 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:18,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:18,861 INFO L82 PathProgramCache]: Analyzing trace with hash 102499484, now seen corresponding path program 15 times [2019-12-18 14:09:18,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:18,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647488002] [2019-12-18 14:09:18,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:19,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647488002] [2019-12-18 14:09:19,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:19,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:09:19,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994005503] [2019-12-18 14:09:19,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:09:19,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:19,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:09:19,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:09:19,024 INFO L87 Difference]: Start difference. First operand 45574 states and 118736 transitions. Second operand 10 states. [2019-12-18 14:09:20,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:20,068 INFO L93 Difference]: Finished difference Result 55594 states and 141173 transitions. [2019-12-18 14:09:20,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 14:09:20,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:09:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:20,139 INFO L225 Difference]: With dead ends: 55594 [2019-12-18 14:09:20,139 INFO L226 Difference]: Without dead ends: 54836 [2019-12-18 14:09:20,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:09:20,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54836 states. [2019-12-18 14:09:20,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54836 to 40936. [2019-12-18 14:09:20,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40936 states. [2019-12-18 14:09:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40936 states to 40936 states and 105743 transitions. [2019-12-18 14:09:21,045 INFO L78 Accepts]: Start accepts. Automaton has 40936 states and 105743 transitions. Word has length 96 [2019-12-18 14:09:21,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:21,046 INFO L462 AbstractCegarLoop]: Abstraction has 40936 states and 105743 transitions. [2019-12-18 14:09:21,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:09:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 40936 states and 105743 transitions. [2019-12-18 14:09:21,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:21,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:21,086 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-18 14:09:21,086 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:21,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:21,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1216761702, now seen corresponding path program 16 times [2019-12-18 14:09:21,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:21,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807827989] [2019-12-18 14:09:21,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:21,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807827989] [2019-12-18 14:09:21,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:21,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:09:21,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751004241] [2019-12-18 14:09:21,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:09:21,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:21,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:09:21,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:09:21,396 INFO L87 Difference]: Start difference. First operand 40936 states and 105743 transitions. Second operand 16 states. [2019-12-18 14:09:23,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:23,614 INFO L93 Difference]: Finished difference Result 69181 states and 181222 transitions. [2019-12-18 14:09:23,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 14:09:23,615 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 96 [2019-12-18 14:09:23,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:23,709 INFO L225 Difference]: With dead ends: 69181 [2019-12-18 14:09:23,709 INFO L226 Difference]: Without dead ends: 67471 [2019-12-18 14:09:23,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=859, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 14:09:23,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67471 states. [2019-12-18 14:09:24,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67471 to 41044. [2019-12-18 14:09:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41044 states. [2019-12-18 14:09:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41044 states to 41044 states and 105989 transitions. [2019-12-18 14:09:24,616 INFO L78 Accepts]: Start accepts. Automaton has 41044 states and 105989 transitions. Word has length 96 [2019-12-18 14:09:24,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:24,617 INFO L462 AbstractCegarLoop]: Abstraction has 41044 states and 105989 transitions. [2019-12-18 14:09:24,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:09:24,617 INFO L276 IsEmpty]: Start isEmpty. Operand 41044 states and 105989 transitions. [2019-12-18 14:09:24,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:24,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:24,656 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-18 14:09:24,657 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:24,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:24,657 INFO L82 PathProgramCache]: Analyzing trace with hash -673974472, now seen corresponding path program 17 times [2019-12-18 14:09:24,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:24,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731515868] [2019-12-18 14:09:24,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:24,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:24,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731515868] [2019-12-18 14:09:24,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:24,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:09:24,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063768412] [2019-12-18 14:09:24,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:09:24,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:24,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:09:24,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:09:24,893 INFO L87 Difference]: Start difference. First operand 41044 states and 105989 transitions. Second operand 15 states. [2019-12-18 14:09:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:26,020 INFO L93 Difference]: Finished difference Result 67776 states and 174905 transitions. [2019-12-18 14:09:26,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 14:09:26,021 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-12-18 14:09:26,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:26,110 INFO L225 Difference]: With dead ends: 67776 [2019-12-18 14:09:26,110 INFO L226 Difference]: Without dead ends: 67179 [2019-12-18 14:09:26,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:09:26,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67179 states. [2019-12-18 14:09:27,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67179 to 47273. [2019-12-18 14:09:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47273 states. [2019-12-18 14:09:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47273 states to 47273 states and 123156 transitions. [2019-12-18 14:09:27,200 INFO L78 Accepts]: Start accepts. Automaton has 47273 states and 123156 transitions. Word has length 96 [2019-12-18 14:09:27,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:27,200 INFO L462 AbstractCegarLoop]: Abstraction has 47273 states and 123156 transitions. [2019-12-18 14:09:27,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:09:27,200 INFO L276 IsEmpty]: Start isEmpty. Operand 47273 states and 123156 transitions. [2019-12-18 14:09:27,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:27,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:27,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:27,248 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:27,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:27,249 INFO L82 PathProgramCache]: Analyzing trace with hash -361627518, now seen corresponding path program 18 times [2019-12-18 14:09:27,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:27,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095818388] [2019-12-18 14:09:27,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:27,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:27,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095818388] [2019-12-18 14:09:27,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:27,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:09:27,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826672584] [2019-12-18 14:09:27,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:09:27,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:27,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:09:27,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:09:27,408 INFO L87 Difference]: Start difference. First operand 47273 states and 123156 transitions. Second operand 11 states. [2019-12-18 14:09:28,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:28,543 INFO L93 Difference]: Finished difference Result 52616 states and 135563 transitions. [2019-12-18 14:09:28,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 14:09:28,543 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 14:09:28,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:28,610 INFO L225 Difference]: With dead ends: 52616 [2019-12-18 14:09:28,610 INFO L226 Difference]: Without dead ends: 51344 [2019-12-18 14:09:28,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-18 14:09:28,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51344 states. [2019-12-18 14:09:29,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51344 to 47512. [2019-12-18 14:09:29,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47512 states. [2019-12-18 14:09:29,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47512 states to 47512 states and 123850 transitions. [2019-12-18 14:09:29,247 INFO L78 Accepts]: Start accepts. Automaton has 47512 states and 123850 transitions. Word has length 96 [2019-12-18 14:09:29,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:29,248 INFO L462 AbstractCegarLoop]: Abstraction has 47512 states and 123850 transitions. [2019-12-18 14:09:29,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:09:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 47512 states and 123850 transitions. [2019-12-18 14:09:29,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:29,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:29,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, 1] [2019-12-18 14:09:29,294 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:29,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:29,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1869687674, now seen corresponding path program 19 times [2019-12-18 14:09:29,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:29,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988471073] [2019-12-18 14:09:29,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:29,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988471073] [2019-12-18 14:09:29,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:29,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 14:09:29,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288075934] [2019-12-18 14:09:29,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:09:29,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:29,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:09:29,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:09:29,923 INFO L87 Difference]: Start difference. First operand 47512 states and 123850 transitions. Second operand 16 states. [2019-12-18 14:09:33,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:33,375 INFO L93 Difference]: Finished difference Result 67051 states and 171957 transitions. [2019-12-18 14:09:33,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 14:09:33,375 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 96 [2019-12-18 14:09:33,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:33,467 INFO L225 Difference]: With dead ends: 67051 [2019-12-18 14:09:33,467 INFO L226 Difference]: Without dead ends: 65130 [2019-12-18 14:09:33,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=249, Invalid=1473, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 14:09:33,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65130 states. [2019-12-18 14:09:34,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65130 to 47273. [2019-12-18 14:09:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47273 states. [2019-12-18 14:09:34,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47273 states to 47273 states and 123155 transitions. [2019-12-18 14:09:34,589 INFO L78 Accepts]: Start accepts. Automaton has 47273 states and 123155 transitions. Word has length 96 [2019-12-18 14:09:34,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:34,589 INFO L462 AbstractCegarLoop]: Abstraction has 47273 states and 123155 transitions. [2019-12-18 14:09:34,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:09:34,589 INFO L276 IsEmpty]: Start isEmpty. Operand 47273 states and 123155 transitions. [2019-12-18 14:09:34,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:34,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:34,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:34,633 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:34,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:34,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1008360128, now seen corresponding path program 20 times [2019-12-18 14:09:34,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:34,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598518250] [2019-12-18 14:09:34,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:34,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598518250] [2019-12-18 14:09:34,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:34,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:09:34,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17491002] [2019-12-18 14:09:34,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 14:09:34,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:34,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 14:09:34,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:09:34,807 INFO L87 Difference]: Start difference. First operand 47273 states and 123155 transitions. Second operand 13 states. [2019-12-18 14:09:35,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:35,750 INFO L93 Difference]: Finished difference Result 62153 states and 160446 transitions. [2019-12-18 14:09:35,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 14:09:35,750 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-18 14:09:35,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:35,830 INFO L225 Difference]: With dead ends: 62153 [2019-12-18 14:09:35,830 INFO L226 Difference]: Without dead ends: 59408 [2019-12-18 14:09:35,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:09:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59408 states. [2019-12-18 14:09:36,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59408 to 39916. [2019-12-18 14:09:36,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39916 states. [2019-12-18 14:09:36,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39916 states to 39916 states and 102742 transitions. [2019-12-18 14:09:36,404 INFO L78 Accepts]: Start accepts. Automaton has 39916 states and 102742 transitions. Word has length 96 [2019-12-18 14:09:36,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:36,404 INFO L462 AbstractCegarLoop]: Abstraction has 39916 states and 102742 transitions. [2019-12-18 14:09:36,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 14:09:36,405 INFO L276 IsEmpty]: Start isEmpty. Operand 39916 states and 102742 transitions. [2019-12-18 14:09:36,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:36,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:36,443 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-18 14:09:36,443 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:36,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:36,443 INFO L82 PathProgramCache]: Analyzing trace with hash 466191738, now seen corresponding path program 21 times [2019-12-18 14:09:36,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:36,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458247674] [2019-12-18 14:09:36,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:36,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:36,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458247674] [2019-12-18 14:09:36,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:36,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:09:36,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966792714] [2019-12-18 14:09:36,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:09:36,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:36,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:09:36,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:09:36,576 INFO L87 Difference]: Start difference. First operand 39916 states and 102742 transitions. Second operand 9 states. [2019-12-18 14:09:37,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:37,362 INFO L93 Difference]: Finished difference Result 60622 states and 157259 transitions. [2019-12-18 14:09:37,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 14:09:37,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-18 14:09:37,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:37,439 INFO L225 Difference]: With dead ends: 60622 [2019-12-18 14:09:37,439 INFO L226 Difference]: Without dead ends: 58928 [2019-12-18 14:09:37,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:09:37,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58928 states. [2019-12-18 14:09:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58928 to 39844. [2019-12-18 14:09:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39844 states. [2019-12-18 14:09:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39844 states to 39844 states and 102625 transitions. [2019-12-18 14:09:37,979 INFO L78 Accepts]: Start accepts. Automaton has 39844 states and 102625 transitions. Word has length 96 [2019-12-18 14:09:37,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:37,979 INFO L462 AbstractCegarLoop]: Abstraction has 39844 states and 102625 transitions. [2019-12-18 14:09:37,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:09:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 39844 states and 102625 transitions. [2019-12-18 14:09:38,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:38,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:38,017 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-18 14:09:38,017 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:38,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:38,018 INFO L82 PathProgramCache]: Analyzing trace with hash 98412280, now seen corresponding path program 22 times [2019-12-18 14:09:38,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:38,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897571874] [2019-12-18 14:09:38,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:38,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897571874] [2019-12-18 14:09:38,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:38,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:09:38,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854621781] [2019-12-18 14:09:38,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:09:38,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:38,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:09:38,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:09:38,160 INFO L87 Difference]: Start difference. First operand 39844 states and 102625 transitions. Second operand 7 states. [2019-12-18 14:09:38,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:38,815 INFO L93 Difference]: Finished difference Result 41193 states and 105122 transitions. [2019-12-18 14:09:38,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:09:38,815 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-12-18 14:09:38,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:38,863 INFO L225 Difference]: With dead ends: 41193 [2019-12-18 14:09:38,863 INFO L226 Difference]: Without dead ends: 41193 [2019-12-18 14:09:38,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:09:38,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41193 states. [2019-12-18 14:09:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41193 to 35541. [2019-12-18 14:09:39,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35541 states. [2019-12-18 14:09:39,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35541 states to 35541 states and 90675 transitions. [2019-12-18 14:09:39,306 INFO L78 Accepts]: Start accepts. Automaton has 35541 states and 90675 transitions. Word has length 96 [2019-12-18 14:09:39,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:39,306 INFO L462 AbstractCegarLoop]: Abstraction has 35541 states and 90675 transitions. [2019-12-18 14:09:39,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:09:39,306 INFO L276 IsEmpty]: Start isEmpty. Operand 35541 states and 90675 transitions. [2019-12-18 14:09:39,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:39,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:39,340 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-18 14:09:39,340 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:39,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:39,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1931956007, now seen corresponding path program 1 times [2019-12-18 14:09:39,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:39,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931601479] [2019-12-18 14:09:39,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:39,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931601479] [2019-12-18 14:09:39,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:39,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:09:39,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443146129] [2019-12-18 14:09:39,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 14:09:39,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:39,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 14:09:39,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:09:39,887 INFO L87 Difference]: Start difference. First operand 35541 states and 90675 transitions. Second operand 14 states. [2019-12-18 14:09:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:44,560 INFO L93 Difference]: Finished difference Result 71179 states and 179036 transitions. [2019-12-18 14:09:44,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 14:09:44,561 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-12-18 14:09:44,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:44,673 INFO L225 Difference]: With dead ends: 71179 [2019-12-18 14:09:44,674 INFO L226 Difference]: Without dead ends: 63105 [2019-12-18 14:09:44,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=500, Invalid=2470, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 14:09:44,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63105 states. [2019-12-18 14:09:45,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63105 to 48712. [2019-12-18 14:09:45,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48712 states. [2019-12-18 14:09:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48712 states to 48712 states and 126513 transitions. [2019-12-18 14:09:45,563 INFO L78 Accepts]: Start accepts. Automaton has 48712 states and 126513 transitions. Word has length 97 [2019-12-18 14:09:45,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:45,563 INFO L462 AbstractCegarLoop]: Abstraction has 48712 states and 126513 transitions. [2019-12-18 14:09:45,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 14:09:45,564 INFO L276 IsEmpty]: Start isEmpty. Operand 48712 states and 126513 transitions. [2019-12-18 14:09:45,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:45,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:45,610 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-18 14:09:45,610 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:45,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:45,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1686919759, now seen corresponding path program 2 times [2019-12-18 14:09:45,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:45,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114616576] [2019-12-18 14:09:45,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:45,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:45,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114616576] [2019-12-18 14:09:45,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:45,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:09:45,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744342808] [2019-12-18 14:09:45,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:09:45,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:45,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:09:45,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:09:45,718 INFO L87 Difference]: Start difference. First operand 48712 states and 126513 transitions. Second operand 6 states. [2019-12-18 14:09:45,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:45,946 INFO L93 Difference]: Finished difference Result 48079 states and 124704 transitions. [2019-12-18 14:09:45,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:09:45,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-18 14:09:45,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:46,004 INFO L225 Difference]: With dead ends: 48079 [2019-12-18 14:09:46,005 INFO L226 Difference]: Without dead ends: 48079 [2019-12-18 14:09:46,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:09:46,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48079 states. [2019-12-18 14:09:46,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48079 to 41609. [2019-12-18 14:09:46,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41609 states. [2019-12-18 14:09:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41609 states to 41609 states and 107929 transitions. [2019-12-18 14:09:46,544 INFO L78 Accepts]: Start accepts. Automaton has 41609 states and 107929 transitions. Word has length 97 [2019-12-18 14:09:46,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:46,545 INFO L462 AbstractCegarLoop]: Abstraction has 41609 states and 107929 transitions. [2019-12-18 14:09:46,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:09:46,545 INFO L276 IsEmpty]: Start isEmpty. Operand 41609 states and 107929 transitions. [2019-12-18 14:09:46,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:46,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:46,583 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-18 14:09:46,583 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:46,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:46,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1220428195, now seen corresponding path program 1 times [2019-12-18 14:09:46,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:46,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664676466] [2019-12-18 14:09:46,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:46,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:46,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664676466] [2019-12-18 14:09:46,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:46,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:09:46,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209090432] [2019-12-18 14:09:46,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:09:46,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:46,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:09:46,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:09:46,698 INFO L87 Difference]: Start difference. First operand 41609 states and 107929 transitions. Second operand 7 states. [2019-12-18 14:09:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:47,775 INFO L93 Difference]: Finished difference Result 56159 states and 144417 transitions. [2019-12-18 14:09:47,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:09:47,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-18 14:09:47,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:48,080 INFO L225 Difference]: With dead ends: 56159 [2019-12-18 14:09:48,080 INFO L226 Difference]: Without dead ends: 56107 [2019-12-18 14:09:48,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:09:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56107 states. [2019-12-18 14:09:48,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56107 to 46789. [2019-12-18 14:09:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46789 states. [2019-12-18 14:09:48,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46789 states to 46789 states and 120940 transitions. [2019-12-18 14:09:48,674 INFO L78 Accepts]: Start accepts. Automaton has 46789 states and 120940 transitions. Word has length 97 [2019-12-18 14:09:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:48,675 INFO L462 AbstractCegarLoop]: Abstraction has 46789 states and 120940 transitions. [2019-12-18 14:09:48,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:09:48,675 INFO L276 IsEmpty]: Start isEmpty. Operand 46789 states and 120940 transitions. [2019-12-18 14:09:48,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:48,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:48,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:48,719 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:48,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:48,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1780327349, now seen corresponding path program 2 times [2019-12-18 14:09:48,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:48,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521512736] [2019-12-18 14:09:48,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:48,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:48,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521512736] [2019-12-18 14:09:48,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:48,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 14:09:48,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181161013] [2019-12-18 14:09:48,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:09:48,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:48,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:09:48,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:09:48,952 INFO L87 Difference]: Start difference. First operand 46789 states and 120940 transitions. Second operand 12 states. [2019-12-18 14:09:50,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:50,382 INFO L93 Difference]: Finished difference Result 56726 states and 144687 transitions. [2019-12-18 14:09:50,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 14:09:50,382 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-12-18 14:09:50,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:50,454 INFO L225 Difference]: With dead ends: 56726 [2019-12-18 14:09:50,454 INFO L226 Difference]: Without dead ends: 56726 [2019-12-18 14:09:50,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:09:50,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56726 states. [2019-12-18 14:09:51,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56726 to 48856. [2019-12-18 14:09:51,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48856 states. [2019-12-18 14:09:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48856 states to 48856 states and 126086 transitions. [2019-12-18 14:09:51,354 INFO L78 Accepts]: Start accepts. Automaton has 48856 states and 126086 transitions. Word has length 97 [2019-12-18 14:09:51,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:51,354 INFO L462 AbstractCegarLoop]: Abstraction has 48856 states and 126086 transitions. [2019-12-18 14:09:51,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:09:51,355 INFO L276 IsEmpty]: Start isEmpty. Operand 48856 states and 126086 transitions. [2019-12-18 14:09:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:51,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:51,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-18 14:09:51,401 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:51,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:51,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1166833459, now seen corresponding path program 3 times [2019-12-18 14:09:51,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:51,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497021640] [2019-12-18 14:09:51,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:52,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497021640] [2019-12-18 14:09:52,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:52,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 14:09:52,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905275351] [2019-12-18 14:09:52,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 14:09:52,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:52,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 14:09:52,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:09:52,035 INFO L87 Difference]: Start difference. First operand 48856 states and 126086 transitions. Second operand 22 states. [2019-12-18 14:09:58,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:58,277 INFO L93 Difference]: Finished difference Result 56510 states and 144187 transitions. [2019-12-18 14:09:58,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 14:09:58,278 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 97 [2019-12-18 14:09:58,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:58,346 INFO L225 Difference]: With dead ends: 56510 [2019-12-18 14:09:58,346 INFO L226 Difference]: Without dead ends: 56404 [2019-12-18 14:09:58,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=393, Invalid=2363, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 14:09:58,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56404 states. [2019-12-18 14:09:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56404 to 49130. [2019-12-18 14:09:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49130 states. [2019-12-18 14:09:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49130 states to 49130 states and 126724 transitions. [2019-12-18 14:09:58,944 INFO L78 Accepts]: Start accepts. Automaton has 49130 states and 126724 transitions. Word has length 97 [2019-12-18 14:09:58,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:58,944 INFO L462 AbstractCegarLoop]: Abstraction has 49130 states and 126724 transitions. [2019-12-18 14:09:58,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 14:09:58,944 INFO L276 IsEmpty]: Start isEmpty. Operand 49130 states and 126724 transitions. [2019-12-18 14:09:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:58,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:58,990 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-18 14:09:58,990 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:58,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:58,991 INFO L82 PathProgramCache]: Analyzing trace with hash -34513923, now seen corresponding path program 4 times [2019-12-18 14:09:58,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:58,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054348349] [2019-12-18 14:09:58,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:59,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054348349] [2019-12-18 14:09:59,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:59,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:09:59,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779376206] [2019-12-18 14:09:59,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:09:59,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:59,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:09:59,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:09:59,099 INFO L87 Difference]: Start difference. First operand 49130 states and 126724 transitions. Second operand 7 states. [2019-12-18 14:10:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:00,258 INFO L93 Difference]: Finished difference Result 65281 states and 168163 transitions. [2019-12-18 14:10:00,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 14:10:00,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-18 14:10:00,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:00,343 INFO L225 Difference]: With dead ends: 65281 [2019-12-18 14:10:00,343 INFO L226 Difference]: Without dead ends: 65260 [2019-12-18 14:10:00,343 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-18 14:10:00,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65260 states. [2019-12-18 14:10:01,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65260 to 51077. [2019-12-18 14:10:01,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51077 states. [2019-12-18 14:10:01,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51077 states to 51077 states and 131803 transitions. [2019-12-18 14:10:01,300 INFO L78 Accepts]: Start accepts. Automaton has 51077 states and 131803 transitions. Word has length 97 [2019-12-18 14:10:01,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:01,300 INFO L462 AbstractCegarLoop]: Abstraction has 51077 states and 131803 transitions. [2019-12-18 14:10:01,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:10:01,301 INFO L276 IsEmpty]: Start isEmpty. Operand 51077 states and 131803 transitions. [2019-12-18 14:10:01,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:10:01,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:01,351 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-18 14:10:01,352 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:01,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:01,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1279789301, now seen corresponding path program 5 times [2019-12-18 14:10:01,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:01,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736548634] [2019-12-18 14:10:01,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:01,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736548634] [2019-12-18 14:10:01,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:01,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 14:10:01,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604623944] [2019-12-18 14:10:01,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 14:10:01,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:01,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 14:10:01,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-12-18 14:10:01,806 INFO L87 Difference]: Start difference. First operand 51077 states and 131803 transitions. Second operand 20 states. [2019-12-18 14:10:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:04,459 INFO L93 Difference]: Finished difference Result 64399 states and 164666 transitions. [2019-12-18 14:10:04,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 14:10:04,460 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2019-12-18 14:10:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:04,546 INFO L225 Difference]: With dead ends: 64399 [2019-12-18 14:10:04,546 INFO L226 Difference]: Without dead ends: 61659 [2019-12-18 14:10:04,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 14:10:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61659 states. [2019-12-18 14:10:05,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61659 to 53445. [2019-12-18 14:10:05,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53445 states. [2019-12-18 14:10:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53445 states to 53445 states and 137754 transitions. [2019-12-18 14:10:05,629 INFO L78 Accepts]: Start accepts. Automaton has 53445 states and 137754 transitions. Word has length 97 [2019-12-18 14:10:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:05,629 INFO L462 AbstractCegarLoop]: Abstraction has 53445 states and 137754 transitions. [2019-12-18 14:10:05,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 14:10:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 53445 states and 137754 transitions. [2019-12-18 14:10:05,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:10:05,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:05,684 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-18 14:10:05,684 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:05,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:05,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1999136157, now seen corresponding path program 6 times [2019-12-18 14:10:05,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:05,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793460204] [2019-12-18 14:10:05,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:05,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793460204] [2019-12-18 14:10:05,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:05,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 14:10:05,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706840477] [2019-12-18 14:10:05,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 14:10:05,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:05,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 14:10:05,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:10:05,869 INFO L87 Difference]: Start difference. First operand 53445 states and 137754 transitions. Second operand 14 states. [2019-12-18 14:10:07,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:07,539 INFO L93 Difference]: Finished difference Result 63559 states and 162661 transitions. [2019-12-18 14:10:07,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 14:10:07,540 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-12-18 14:10:07,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:07,620 INFO L225 Difference]: With dead ends: 63559 [2019-12-18 14:10:07,620 INFO L226 Difference]: Without dead ends: 62286 [2019-12-18 14:10:07,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2019-12-18 14:10:07,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62286 states. [2019-12-18 14:10:08,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62286 to 53443. [2019-12-18 14:10:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53443 states. [2019-12-18 14:10:08,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53443 states to 53443 states and 137760 transitions. [2019-12-18 14:10:08,324 INFO L78 Accepts]: Start accepts. Automaton has 53443 states and 137760 transitions. Word has length 97 [2019-12-18 14:10:08,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:08,324 INFO L462 AbstractCegarLoop]: Abstraction has 53443 states and 137760 transitions. [2019-12-18 14:10:08,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 14:10:08,324 INFO L276 IsEmpty]: Start isEmpty. Operand 53443 states and 137760 transitions. [2019-12-18 14:10:08,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:10:08,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:08,381 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-18 14:10:08,381 INFO L410 AbstractCegarLoop]: === Iteration 48 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:08,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:08,381 INFO L82 PathProgramCache]: Analyzing trace with hash -522924491, now seen corresponding path program 7 times [2019-12-18 14:10:08,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:08,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188196652] [2019-12-18 14:10:08,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:08,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:08,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188196652] [2019-12-18 14:10:08,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:08,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:10:08,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332609751] [2019-12-18 14:10:08,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:10:08,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:08,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:10:08,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:10:08,528 INFO L87 Difference]: Start difference. First operand 53443 states and 137760 transitions. Second operand 10 states. [2019-12-18 14:10:09,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:09,511 INFO L93 Difference]: Finished difference Result 54911 states and 141198 transitions. [2019-12-18 14:10:09,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:10:09,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 14:10:09,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:09,580 INFO L225 Difference]: With dead ends: 54911 [2019-12-18 14:10:09,580 INFO L226 Difference]: Without dead ends: 54911 [2019-12-18 14:10:09,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:10:09,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54911 states. Received shutdown request... [2019-12-18 14:10:09,673 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 14:10:09,676 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 14:10:09,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:10:09 BasicIcfg [2019-12-18 14:10:09,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:10:09,677 INFO L168 Benchmark]: Toolchain (without parser) took 207416.58 ms. Allocated memory was 134.7 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 97.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 14:10:09,678 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 134.7 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 14:10:09,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 894.04 ms. Allocated memory was 134.7 MB in the beginning and 198.7 MB in the end (delta: 64.0 MB). Free memory was 97.1 MB in the beginning and 149.5 MB in the end (delta: -52.5 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:09,678 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.18 ms. Allocated memory is still 198.7 MB. Free memory was 149.5 MB in the beginning and 146.0 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:09,679 INFO L168 Benchmark]: Boogie Preprocessor took 48.83 ms. Allocated memory is still 198.7 MB. Free memory was 146.0 MB in the beginning and 143.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:09,679 INFO L168 Benchmark]: RCFGBuilder took 1268.81 ms. Allocated memory was 198.7 MB in the beginning and 224.4 MB in the end (delta: 25.7 MB). Free memory was 143.1 MB in the beginning and 188.1 MB in the end (delta: -45.0 MB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:09,680 INFO L168 Benchmark]: TraceAbstraction took 205103.63 ms. Allocated memory was 224.4 MB in the beginning and 3.5 GB in the end (delta: 3.2 GB). Free memory was 186.7 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 14:10:09,682 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.53 ms. Allocated memory is still 134.7 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 894.04 ms. Allocated memory was 134.7 MB in the beginning and 198.7 MB in the end (delta: 64.0 MB). Free memory was 97.1 MB in the beginning and 149.5 MB in the end (delta: -52.5 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 96.18 ms. Allocated memory is still 198.7 MB. Free memory was 149.5 MB in the beginning and 146.0 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.83 ms. Allocated memory is still 198.7 MB. Free memory was 146.0 MB in the beginning and 143.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1268.81 ms. Allocated memory was 198.7 MB in the beginning and 224.4 MB in the end (delta: 25.7 MB). Free memory was 143.1 MB in the beginning and 188.1 MB in the end (delta: -45.0 MB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 205103.63 ms. Allocated memory was 224.4 MB in the beginning and 3.5 GB in the end (delta: 3.2 GB). Free memory was 186.7 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 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.3s, 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: 204.9s, OverallIterations: 48, TraceHistogramMax: 1, AutomataDifference: 87.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 21273 SDtfs, 27470 SDslu, 106123 SDs, 0 SdLazy, 50251 SolverSat, 1580 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1012 GetRequests, 173 SyntacticMatches, 62 SemanticMatches, 777 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5194 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240862occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 83.1s AutomataMinimizationTime, 48 MinimizatonAttempts, 374374 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 3911 NumberOfCodeBlocks, 3911 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3863 ConstructedInterpolants, 0 QuantifiedInterpolants, 1435638 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 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