/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:14:42,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:14:42,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:14:42,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:14:42,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:14:42,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:14:42,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:14:42,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:14:42,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:14:42,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:14:42,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:14:42,111 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:14:42,111 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:14:42,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:14:42,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:14:42,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:14:42,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:14:42,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:14:42,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:14:42,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:14:42,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:14:42,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:14:42,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:14:42,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:14:42,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:14:42,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:14:42,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:14:42,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:14:42,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:14:42,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:14:42,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:14:42,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:14:42,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:14:42,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:14:42,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:14:42,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:14:42,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:14:42,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:14:42,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:14:42,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:14:42,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:14:42,136 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 23:14:42,150 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:14:42,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:14:42,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:14:42,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:14:42,152 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:14:42,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:14:42,152 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:14:42,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:14:42,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:14:42,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:14:42,153 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:14:42,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:14:42,153 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:14:42,153 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:14:42,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:14:42,154 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:14:42,154 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:14:42,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:14:42,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:14:42,154 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:14:42,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:14:42,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:14:42,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:14:42,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:14:42,155 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:14:42,156 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:14:42,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:14:42,156 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 23:14:42,156 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:14:42,156 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:14:42,479 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:14:42,501 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:14:42,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:14:42,506 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:14:42,506 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:14:42,507 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2019-12-18 23:14:42,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cb2b6059/7b8905fc6b3d4c6cae9e9c9d0fc231d5/FLAGf5bf90098 [2019-12-18 23:14:43,201 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:14:43,202 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2019-12-18 23:14:43,230 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cb2b6059/7b8905fc6b3d4c6cae9e9c9d0fc231d5/FLAGf5bf90098 [2019-12-18 23:14:43,430 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cb2b6059/7b8905fc6b3d4c6cae9e9c9d0fc231d5 [2019-12-18 23:14:43,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:14:43,442 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:14:43,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:14:43,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:14:43,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:14:43,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:14:43" (1/1) ... [2019-12-18 23:14:43,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@682403da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:14:43, skipping insertion in model container [2019-12-18 23:14:43,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:14:43" (1/1) ... [2019-12-18 23:14:43,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:14:43,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:14:44,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:14:44,240 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:14:44,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:14:44,830 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:14:44,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:14:44 WrapperNode [2019-12-18 23:14:44,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:14:44,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:14:44,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:14:44,832 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:14:44,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:14:44" (1/1) ... [2019-12-18 23:14:44,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:14:44" (1/1) ... [2019-12-18 23:14:44,986 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:14:44,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:14:44,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:14:44,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:14:45,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:14:44" (1/1) ... [2019-12-18 23:14:45,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:14:44" (1/1) ... [2019-12-18 23:14:45,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:14:44" (1/1) ... [2019-12-18 23:14:45,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:14:44" (1/1) ... [2019-12-18 23:14:45,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:14:44" (1/1) ... [2019-12-18 23:14:45,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:14:44" (1/1) ... [2019-12-18 23:14:45,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:14:44" (1/1) ... [2019-12-18 23:14:45,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:14:45,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:14:45,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:14:45,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:14:45,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:14:44" (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 23:14:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:14:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 23:14:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-18 23:14:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-18 23:14:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:14:45,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:14:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-12-18 23:14:45,173 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-12-18 23:14:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:14:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:14:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-18 23:14:45,176 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 23:14:46,113 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:14:46,114 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-12-18 23:14:46,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:14:46 BoogieIcfgContainer [2019-12-18 23:14:46,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:14:46,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:14:46,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:14:46,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:14:46,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:14:43" (1/3) ... [2019-12-18 23:14:46,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5651bd71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:14:46, skipping insertion in model container [2019-12-18 23:14:46,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:14:44" (2/3) ... [2019-12-18 23:14:46,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5651bd71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:14:46, skipping insertion in model container [2019-12-18 23:14:46,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:14:46" (3/3) ... [2019-12-18 23:14:46,124 INFO L109 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2019-12-18 23:14:46,135 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:14:46,135 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:14:46,143 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-12-18 23:14:46,144 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:14:46,175 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,176 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,176 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,176 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,177 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,177 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,177 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,177 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,177 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,178 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,178 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,178 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,178 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,178 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,179 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,179 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,179 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,179 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,179 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,180 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,180 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,180 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,180 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,181 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,181 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,181 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,181 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,182 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,182 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,182 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,183 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,183 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,183 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,183 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,183 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,184 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,184 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,184 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,184 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,185 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,185 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,185 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,185 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,186 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,186 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,186 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,186 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,187 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,187 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,187 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,187 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,188 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,188 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,188 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,188 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,189 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,189 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,189 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,193 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,194 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,194 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,194 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,194 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,194 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,195 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,195 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,195 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,195 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,207 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,207 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,208 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,210 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,210 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,210 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,211 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,211 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,211 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,211 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:14:46,243 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-18 23:14:46,264 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:14:46,264 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:14:46,265 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:14:46,265 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:14:46,265 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:14:46,265 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:14:46,265 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:14:46,266 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:14:46,284 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 154 transitions [2019-12-18 23:14:46,286 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions [2019-12-18 23:14:46,365 INFO L126 PetriNetUnfolder]: 11/192 cut-off events. [2019-12-18 23:14:46,366 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:14:46,375 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs. 21/193 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2019-12-18 23:14:46,384 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions [2019-12-18 23:14:46,475 INFO L126 PetriNetUnfolder]: 11/192 cut-off events. [2019-12-18 23:14:46,476 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:14:46,479 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs. 21/193 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2019-12-18 23:14:46,487 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2652 [2019-12-18 23:14:46,488 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:14:48,271 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:14:48,304 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:14:48,320 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:14:48,347 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:14:48,349 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:14:48,349 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:78 [2019-12-18 23:14:50,017 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-12-18 23:14:51,151 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:14:51,177 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:14:51,188 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:14:51,215 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:14:51,216 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:14:51,217 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2019-12-18 23:14:52,070 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-12-18 23:14:52,449 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-12-18 23:14:52,599 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-12-18 23:14:53,636 WARN L192 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2019-12-18 23:14:53,670 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:14:53,857 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-12-18 23:14:53,857 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:14:53,865 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:14:54,084 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 23:14:54,085 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:14:54,086 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-18 23:14:54,087 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:187, output treesize:199 [2019-12-18 23:14:54,256 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 23:14:54,544 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2019-12-18 23:14:54,670 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 23:14:54,841 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-12-18 23:14:55,530 WARN L192 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2019-12-18 23:14:55,824 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-12-18 23:14:56,817 WARN L192 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2019-12-18 23:14:57,232 WARN L192 SmtUtils]: Spent 409.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-18 23:14:57,246 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5214 [2019-12-18 23:14:57,247 INFO L214 etLargeBlockEncoding]: Total number of compositions: 166 [2019-12-18 23:14:57,250 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 39 transitions [2019-12-18 23:14:57,277 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 425 states. [2019-12-18 23:14:57,280 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2019-12-18 23:14:57,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-18 23:14:57,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:57,286 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-18 23:14:57,287 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:57,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:57,292 INFO L82 PathProgramCache]: Analyzing trace with hash 562, now seen corresponding path program 1 times [2019-12-18 23:14:57,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:57,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317812850] [2019-12-18 23:14:57,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:57,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:14:57,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317812850] [2019-12-18 23:14:57,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:14:57,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-18 23:14:57,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893301693] [2019-12-18 23:14:57,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-18 23:14:57,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:57,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-18 23:14:57,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 23:14:57,569 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 2 states. [2019-12-18 23:14:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:57,605 INFO L93 Difference]: Finished difference Result 423 states and 1029 transitions. [2019-12-18 23:14:57,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-18 23:14:57,607 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-18 23:14:57,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:57,624 INFO L225 Difference]: With dead ends: 423 [2019-12-18 23:14:57,625 INFO L226 Difference]: Without dead ends: 348 [2019-12-18 23:14:57,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 23:14:57,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-12-18 23:14:57,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2019-12-18 23:14:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-18 23:14:57,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 834 transitions. [2019-12-18 23:14:57,698 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 834 transitions. Word has length 1 [2019-12-18 23:14:57,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:57,698 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 834 transitions. [2019-12-18 23:14:57,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-18 23:14:57,698 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 834 transitions. [2019-12-18 23:14:57,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-18 23:14:57,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:57,699 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-18 23:14:57,699 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:57,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:57,700 INFO L82 PathProgramCache]: Analyzing trace with hash 17204672, now seen corresponding path program 1 times [2019-12-18 23:14:57,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:57,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525293719] [2019-12-18 23:14:57,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:57,917 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 23:14:57,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525293719] [2019-12-18 23:14:57,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:14:57,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:14:57,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114900578] [2019-12-18 23:14:57,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:14:57,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:57,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:14:57,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:14:57,921 INFO L87 Difference]: Start difference. First operand 348 states and 834 transitions. Second operand 3 states. [2019-12-18 23:14:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:58,058 INFO L93 Difference]: Finished difference Result 471 states and 1125 transitions. [2019-12-18 23:14:58,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:14:58,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-18 23:14:58,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:58,064 INFO L225 Difference]: With dead ends: 471 [2019-12-18 23:14:58,064 INFO L226 Difference]: Without dead ends: 471 [2019-12-18 23:14:58,065 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 23:14:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-18 23:14:58,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 407. [2019-12-18 23:14:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-18 23:14:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 989 transitions. [2019-12-18 23:14:58,097 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 989 transitions. Word has length 4 [2019-12-18 23:14:58,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:58,097 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 989 transitions. [2019-12-18 23:14:58,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:14:58,097 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 989 transitions. [2019-12-18 23:14:58,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 23:14:58,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:58,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 23:14:58,098 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:58,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:58,099 INFO L82 PathProgramCache]: Analyzing trace with hash 533344430, now seen corresponding path program 1 times [2019-12-18 23:14:58,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:58,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890895682] [2019-12-18 23:14:58,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:58,177 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 23:14:58,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890895682] [2019-12-18 23:14:58,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:14:58,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:14:58,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490826139] [2019-12-18 23:14:58,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:14:58,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:58,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:14:58,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:14:58,179 INFO L87 Difference]: Start difference. First operand 407 states and 989 transitions. Second operand 3 states. [2019-12-18 23:14:58,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:58,282 INFO L93 Difference]: Finished difference Result 498 states and 1196 transitions. [2019-12-18 23:14:58,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:14:58,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 23:14:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:58,288 INFO L225 Difference]: With dead ends: 498 [2019-12-18 23:14:58,289 INFO L226 Difference]: Without dead ends: 482 [2019-12-18 23:14:58,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:14:58,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-18 23:14:58,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 450. [2019-12-18 23:14:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-12-18 23:14:58,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1111 transitions. [2019-12-18 23:14:58,310 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1111 transitions. Word has length 5 [2019-12-18 23:14:58,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:58,310 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 1111 transitions. [2019-12-18 23:14:58,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:14:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1111 transitions. [2019-12-18 23:14:58,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-18 23:14:58,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:58,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:58,313 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:58,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:58,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1592212615, now seen corresponding path program 1 times [2019-12-18 23:14:58,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:58,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127401004] [2019-12-18 23:14:58,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:58,382 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 23:14:58,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127401004] [2019-12-18 23:14:58,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:14:58,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:14:58,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615738754] [2019-12-18 23:14:58,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:14:58,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:58,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:14:58,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:14:58,385 INFO L87 Difference]: Start difference. First operand 450 states and 1111 transitions. Second operand 3 states. [2019-12-18 23:14:58,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:58,404 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2019-12-18 23:14:58,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:14:58,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-18 23:14:58,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:58,406 INFO L225 Difference]: With dead ends: 162 [2019-12-18 23:14:58,406 INFO L226 Difference]: Without dead ends: 162 [2019-12-18 23:14:58,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:14:58,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-18 23:14:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-12-18 23:14:58,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-18 23:14:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2019-12-18 23:14:58,412 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2019-12-18 23:14:58,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:58,413 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2019-12-18 23:14:58,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:14:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2019-12-18 23:14:58,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:14:58,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:58,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:58,416 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:58,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:58,416 INFO L82 PathProgramCache]: Analyzing trace with hash 869571194, now seen corresponding path program 1 times [2019-12-18 23:14:58,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:58,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587444966] [2019-12-18 23:14:58,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:58,603 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 23:14:58,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587444966] [2019-12-18 23:14:58,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:14:58,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:14:58,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305450014] [2019-12-18 23:14:58,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:14:58,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:58,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:14:58,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:14:58,607 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 5 states. [2019-12-18 23:14:58,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:58,834 INFO L93 Difference]: Finished difference Result 206 states and 427 transitions. [2019-12-18 23:14:58,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:14:58,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 23:14:58,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:58,862 INFO L225 Difference]: With dead ends: 206 [2019-12-18 23:14:58,862 INFO L226 Difference]: Without dead ends: 206 [2019-12-18 23:14:58,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:14:58,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-12-18 23:14:58,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2019-12-18 23:14:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-12-18 23:14:58,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 405 transitions. [2019-12-18 23:14:58,869 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 405 transitions. Word has length 22 [2019-12-18 23:14:58,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:58,869 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 405 transitions. [2019-12-18 23:14:58,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:14:58,869 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 405 transitions. [2019-12-18 23:14:58,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:14:58,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:58,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:58,875 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:58,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:58,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1480892578, now seen corresponding path program 1 times [2019-12-18 23:14:58,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:58,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192373474] [2019-12-18 23:14:58,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:59,072 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 23:14:59,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192373474] [2019-12-18 23:14:59,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:14:59,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:14:59,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960414404] [2019-12-18 23:14:59,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:14:59,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:59,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:14:59,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:14:59,075 INFO L87 Difference]: Start difference. First operand 194 states and 405 transitions. Second operand 4 states. [2019-12-18 23:14:59,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:59,122 INFO L93 Difference]: Finished difference Result 222 states and 438 transitions. [2019-12-18 23:14:59,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:14:59,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-18 23:14:59,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:59,125 INFO L225 Difference]: With dead ends: 222 [2019-12-18 23:14:59,125 INFO L226 Difference]: Without dead ends: 222 [2019-12-18 23:14:59,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:14:59,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-12-18 23:14:59,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 194. [2019-12-18 23:14:59,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-12-18 23:14:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 390 transitions. [2019-12-18 23:14:59,134 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 390 transitions. Word has length 22 [2019-12-18 23:14:59,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:59,134 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 390 transitions. [2019-12-18 23:14:59,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:14:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 390 transitions. [2019-12-18 23:14:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:14:59,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:59,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:59,136 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:59,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:59,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1401747938, now seen corresponding path program 2 times [2019-12-18 23:14:59,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:59,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977419633] [2019-12-18 23:14:59,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:59,755 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 28 [2019-12-18 23:14:59,930 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 22 [2019-12-18 23:15:00,499 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 23:15:00,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977419633] [2019-12-18 23:15:00,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:00,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:15:00,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126364135] [2019-12-18 23:15:00,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:15:00,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:00,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:15:00,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:15:00,502 INFO L87 Difference]: Start difference. First operand 194 states and 390 transitions. Second operand 14 states. [2019-12-18 23:15:02,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:02,076 INFO L93 Difference]: Finished difference Result 294 states and 552 transitions. [2019-12-18 23:15:02,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:15:02,077 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 23:15:02,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:02,079 INFO L225 Difference]: With dead ends: 294 [2019-12-18 23:15:02,080 INFO L226 Difference]: Without dead ends: 294 [2019-12-18 23:15:02,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-12-18 23:15:02,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-18 23:15:02,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 235. [2019-12-18 23:15:02,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-18 23:15:02,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 452 transitions. [2019-12-18 23:15:02,088 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 452 transitions. Word has length 22 [2019-12-18 23:15:02,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:02,089 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 452 transitions. [2019-12-18 23:15:02,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:15:02,089 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 452 transitions. [2019-12-18 23:15:02,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:15:02,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:02,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:02,090 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:15:02,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:02,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1401747950, now seen corresponding path program 1 times [2019-12-18 23:15:02,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:02,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673130065] [2019-12-18 23:15:02,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:02,357 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 23:15:02,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673130065] [2019-12-18 23:15:02,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:02,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:15:02,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486285346] [2019-12-18 23:15:02,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 23:15:02,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:02,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 23:15:02,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:15:02,360 INFO L87 Difference]: Start difference. First operand 235 states and 452 transitions. Second operand 8 states. [2019-12-18 23:15:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:02,902 INFO L93 Difference]: Finished difference Result 312 states and 578 transitions. [2019-12-18 23:15:02,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:15:02,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-18 23:15:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:02,905 INFO L225 Difference]: With dead ends: 312 [2019-12-18 23:15:02,905 INFO L226 Difference]: Without dead ends: 270 [2019-12-18 23:15:02,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:15:02,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-12-18 23:15:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 232. [2019-12-18 23:15:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-18 23:15:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 451 transitions. [2019-12-18 23:15:02,917 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 451 transitions. Word has length 22 [2019-12-18 23:15:02,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:02,917 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 451 transitions. [2019-12-18 23:15:02,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 23:15:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 451 transitions. [2019-12-18 23:15:02,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:15:02,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:02,918 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:02,919 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:15:02,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:02,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1297988672, now seen corresponding path program 3 times [2019-12-18 23:15:02,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:02,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910286159] [2019-12-18 23:15:02,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:03,566 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 21 [2019-12-18 23:15:03,712 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2019-12-18 23:15:04,171 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 23:15:04,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910286159] [2019-12-18 23:15:04,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:04,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:15:04,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680635081] [2019-12-18 23:15:04,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:15:04,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:04,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:15:04,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:15:04,174 INFO L87 Difference]: Start difference. First operand 232 states and 451 transitions. Second operand 14 states. [2019-12-18 23:15:05,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:05,476 INFO L93 Difference]: Finished difference Result 322 states and 607 transitions. [2019-12-18 23:15:05,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:15:05,478 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 23:15:05,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:05,480 INFO L225 Difference]: With dead ends: 322 [2019-12-18 23:15:05,481 INFO L226 Difference]: Without dead ends: 291 [2019-12-18 23:15:05,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-12-18 23:15:05,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-18 23:15:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 231. [2019-12-18 23:15:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-12-18 23:15:05,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 449 transitions. [2019-12-18 23:15:05,488 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 449 transitions. Word has length 22 [2019-12-18 23:15:05,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:05,489 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 449 transitions. [2019-12-18 23:15:05,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:15:05,489 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 449 transitions. [2019-12-18 23:15:05,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:15:05,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:05,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:05,490 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:15:05,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:05,491 INFO L82 PathProgramCache]: Analyzing trace with hash 666257692, now seen corresponding path program 4 times [2019-12-18 23:15:05,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:05,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786178784] [2019-12-18 23:15:05,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:06,190 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2019-12-18 23:15:06,523 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 23:15:06,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786178784] [2019-12-18 23:15:06,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:06,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:15:06,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888491782] [2019-12-18 23:15:06,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:15:06,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:06,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:15:06,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:15:06,526 INFO L87 Difference]: Start difference. First operand 231 states and 449 transitions. Second operand 14 states. [2019-12-18 23:15:08,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:08,130 INFO L93 Difference]: Finished difference Result 348 states and 656 transitions. [2019-12-18 23:15:08,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 23:15:08,132 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 23:15:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:08,134 INFO L225 Difference]: With dead ends: 348 [2019-12-18 23:15:08,134 INFO L226 Difference]: Without dead ends: 318 [2019-12-18 23:15:08,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-12-18 23:15:08,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-12-18 23:15:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 221. [2019-12-18 23:15:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-12-18 23:15:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 431 transitions. [2019-12-18 23:15:08,141 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 431 transitions. Word has length 22 [2019-12-18 23:15:08,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:08,141 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 431 transitions. [2019-12-18 23:15:08,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:15:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 431 transitions. [2019-12-18 23:15:08,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:15:08,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:08,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:08,143 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:15:08,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:08,143 INFO L82 PathProgramCache]: Analyzing trace with hash -677505490, now seen corresponding path program 5 times [2019-12-18 23:15:08,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:08,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452707525] [2019-12-18 23:15:08,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:08,422 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-12-18 23:15:09,115 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 23:15:09,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452707525] [2019-12-18 23:15:09,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:09,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:15:09,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087940316] [2019-12-18 23:15:09,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:15:09,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:09,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:15:09,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:15:09,117 INFO L87 Difference]: Start difference. First operand 221 states and 431 transitions. Second operand 14 states. [2019-12-18 23:15:10,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:10,554 INFO L93 Difference]: Finished difference Result 325 states and 624 transitions. [2019-12-18 23:15:10,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:15:10,554 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 23:15:10,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:10,557 INFO L225 Difference]: With dead ends: 325 [2019-12-18 23:15:10,557 INFO L226 Difference]: Without dead ends: 325 [2019-12-18 23:15:10,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-12-18 23:15:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-12-18 23:15:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 250. [2019-12-18 23:15:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-18 23:15:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 477 transitions. [2019-12-18 23:15:10,564 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 477 transitions. Word has length 22 [2019-12-18 23:15:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:10,565 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 477 transitions. [2019-12-18 23:15:10,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:15:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 477 transitions. [2019-12-18 23:15:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:15:10,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:10,566 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:10,567 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:15:10,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:10,567 INFO L82 PathProgramCache]: Analyzing trace with hash -677505502, now seen corresponding path program 2 times [2019-12-18 23:15:10,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:10,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017917458] [2019-12-18 23:15:10,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:10,977 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 23:15:10,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017917458] [2019-12-18 23:15:10,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:10,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:15:10,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022063304] [2019-12-18 23:15:10,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 23:15:10,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:10,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 23:15:10,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:15:10,980 INFO L87 Difference]: Start difference. First operand 250 states and 477 transitions. Second operand 8 states. [2019-12-18 23:15:11,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:11,683 INFO L93 Difference]: Finished difference Result 351 states and 645 transitions. [2019-12-18 23:15:11,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 23:15:11,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-18 23:15:11,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:11,685 INFO L225 Difference]: With dead ends: 351 [2019-12-18 23:15:11,685 INFO L226 Difference]: Without dead ends: 326 [2019-12-18 23:15:11,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:15:11,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-12-18 23:15:11,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 246. [2019-12-18 23:15:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-12-18 23:15:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 480 transitions. [2019-12-18 23:15:11,697 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 480 transitions. Word has length 22 [2019-12-18 23:15:11,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:11,697 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 480 transitions. [2019-12-18 23:15:11,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 23:15:11,698 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 480 transitions. [2019-12-18 23:15:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:15:11,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:11,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:11,701 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:15:11,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:11,702 INFO L82 PathProgramCache]: Analyzing trace with hash -680803282, now seen corresponding path program 6 times [2019-12-18 23:15:11,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:11,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980955185] [2019-12-18 23:15:11,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:12,764 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 23:15:12,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980955185] [2019-12-18 23:15:12,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:12,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:15:12,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484245426] [2019-12-18 23:15:12,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:15:12,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:12,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:15:12,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:15:12,767 INFO L87 Difference]: Start difference. First operand 246 states and 480 transitions. Second operand 14 states. [2019-12-18 23:15:14,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:14,342 INFO L93 Difference]: Finished difference Result 352 states and 670 transitions. [2019-12-18 23:15:14,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 23:15:14,342 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 23:15:14,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:14,348 INFO L225 Difference]: With dead ends: 352 [2019-12-18 23:15:14,348 INFO L226 Difference]: Without dead ends: 335 [2019-12-18 23:15:14,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-18 23:15:14,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-12-18 23:15:14,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 250. [2019-12-18 23:15:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-18 23:15:14,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 486 transitions. [2019-12-18 23:15:14,356 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 486 transitions. Word has length 22 [2019-12-18 23:15:14,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:14,356 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 486 transitions. [2019-12-18 23:15:14,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:15:14,357 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 486 transitions. [2019-12-18 23:15:14,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:15:14,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:14,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:14,358 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:15:14,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:14,358 INFO L82 PathProgramCache]: Analyzing trace with hash 382303790, now seen corresponding path program 7 times [2019-12-18 23:15:14,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:14,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056976114] [2019-12-18 23:15:14,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:15,291 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 23:15:15,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056976114] [2019-12-18 23:15:15,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:15,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:15:15,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597979253] [2019-12-18 23:15:15,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:15:15,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:15,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:15:15,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:15:15,293 INFO L87 Difference]: Start difference. First operand 250 states and 486 transitions. Second operand 14 states. [2019-12-18 23:15:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:16,582 INFO L93 Difference]: Finished difference Result 342 states and 651 transitions. [2019-12-18 23:15:16,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:15:16,583 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 23:15:16,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:16,586 INFO L225 Difference]: With dead ends: 342 [2019-12-18 23:15:16,586 INFO L226 Difference]: Without dead ends: 303 [2019-12-18 23:15:16,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-12-18 23:15:16,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-12-18 23:15:16,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 222. [2019-12-18 23:15:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-18 23:15:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 437 transitions. [2019-12-18 23:15:16,593 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 437 transitions. Word has length 22 [2019-12-18 23:15:16,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:16,593 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 437 transitions. [2019-12-18 23:15:16,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:15:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 437 transitions. [2019-12-18 23:15:16,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:15:16,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:16,595 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:16,595 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:15:16,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:16,595 INFO L82 PathProgramCache]: Analyzing trace with hash -524064374, now seen corresponding path program 8 times [2019-12-18 23:15:16,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:16,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360590686] [2019-12-18 23:15:16,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:16,804 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-12-18 23:15:17,535 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 23:15:17,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360590686] [2019-12-18 23:15:17,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:17,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:15:17,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407452407] [2019-12-18 23:15:17,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:15:17,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:17,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:15:17,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:15:17,537 INFO L87 Difference]: Start difference. First operand 222 states and 437 transitions. Second operand 14 states. [2019-12-18 23:15:19,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:19,411 INFO L93 Difference]: Finished difference Result 342 states and 636 transitions. [2019-12-18 23:15:19,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 23:15:19,412 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 23:15:19,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:19,414 INFO L225 Difference]: With dead ends: 342 [2019-12-18 23:15:19,415 INFO L226 Difference]: Without dead ends: 342 [2019-12-18 23:15:19,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:15:19,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-12-18 23:15:19,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 276. [2019-12-18 23:15:19,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-12-18 23:15:19,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 525 transitions. [2019-12-18 23:15:19,423 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 525 transitions. Word has length 22 [2019-12-18 23:15:19,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:19,424 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 525 transitions. [2019-12-18 23:15:19,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:15:19,424 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 525 transitions. [2019-12-18 23:15:19,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:15:19,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:19,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:19,425 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:15:19,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:19,426 INFO L82 PathProgramCache]: Analyzing trace with hash -524064386, now seen corresponding path program 3 times [2019-12-18 23:15:19,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:19,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086469381] [2019-12-18 23:15:19,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:19,666 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 23:15:19,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086469381] [2019-12-18 23:15:19,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:19,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:15:19,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795223864] [2019-12-18 23:15:19,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 23:15:19,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:19,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 23:15:19,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:15:19,669 INFO L87 Difference]: Start difference. First operand 276 states and 525 transitions. Second operand 8 states. [2019-12-18 23:15:20,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:20,114 INFO L93 Difference]: Finished difference Result 411 states and 748 transitions. [2019-12-18 23:15:20,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:15:20,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-18 23:15:20,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:20,117 INFO L225 Difference]: With dead ends: 411 [2019-12-18 23:15:20,117 INFO L226 Difference]: Without dead ends: 361 [2019-12-18 23:15:20,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:15:20,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-12-18 23:15:20,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 252. [2019-12-18 23:15:20,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-12-18 23:15:20,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 489 transitions. [2019-12-18 23:15:20,123 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 489 transitions. Word has length 22 [2019-12-18 23:15:20,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:20,124 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 489 transitions. [2019-12-18 23:15:20,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 23:15:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 489 transitions. [2019-12-18 23:15:20,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:15:20,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:20,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:20,125 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:15:20,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:20,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1923000708, now seen corresponding path program 9 times [2019-12-18 23:15:20,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:20,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836621466] [2019-12-18 23:15:20,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:20,246 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 23:15:20,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836621466] [2019-12-18 23:15:20,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:20,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:15:20,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631761162] [2019-12-18 23:15:20,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:15:20,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:20,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:15:20,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:15:20,249 INFO L87 Difference]: Start difference. First operand 252 states and 489 transitions. Second operand 4 states. [2019-12-18 23:15:20,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:20,282 INFO L93 Difference]: Finished difference Result 124 states and 186 transitions. [2019-12-18 23:15:20,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:15:20,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-18 23:15:20,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:20,284 INFO L225 Difference]: With dead ends: 124 [2019-12-18 23:15:20,284 INFO L226 Difference]: Without dead ends: 119 [2019-12-18 23:15:20,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:15:20,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-18 23:15:20,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-12-18 23:15:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-18 23:15:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 181 transitions. [2019-12-18 23:15:20,289 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 181 transitions. Word has length 22 [2019-12-18 23:15:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:20,289 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 181 transitions. [2019-12-18 23:15:20,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:15:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 181 transitions. [2019-12-18 23:15:20,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:15:20,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:20,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:20,290 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:15:20,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:20,290 INFO L82 PathProgramCache]: Analyzing trace with hash -615135152, now seen corresponding path program 2 times [2019-12-18 23:15:20,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:20,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682031023] [2019-12-18 23:15:20,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:20,467 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 23:15:20,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682031023] [2019-12-18 23:15:20,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:20,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:15:20,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690054428] [2019-12-18 23:15:20,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:15:20,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:20,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:15:20,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:15:20,470 INFO L87 Difference]: Start difference. First operand 119 states and 181 transitions. Second operand 6 states. [2019-12-18 23:15:20,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:20,925 INFO L93 Difference]: Finished difference Result 104 states and 147 transitions. [2019-12-18 23:15:20,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 23:15:20,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 23:15:20,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:20,926 INFO L225 Difference]: With dead ends: 104 [2019-12-18 23:15:20,926 INFO L226 Difference]: Without dead ends: 104 [2019-12-18 23:15:20,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-18 23:15:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-18 23:15:20,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2019-12-18 23:15:20,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-18 23:15:20,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2019-12-18 23:15:20,929 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 22 [2019-12-18 23:15:20,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:20,929 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2019-12-18 23:15:20,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:15:20,929 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2019-12-18 23:15:20,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:15:20,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:20,930 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:20,930 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:15:20,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:20,931 INFO L82 PathProgramCache]: Analyzing trace with hash -113614644, now seen corresponding path program 10 times [2019-12-18 23:15:20,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:20,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872654134] [2019-12-18 23:15:20,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:21,348 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2019-12-18 23:15:21,490 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2019-12-18 23:15:22,125 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 23:15:22,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872654134] [2019-12-18 23:15:22,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:22,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:15:22,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376455911] [2019-12-18 23:15:22,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:15:22,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:22,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:15:22,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:15:22,127 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand 14 states. [2019-12-18 23:15:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:23,274 INFO L93 Difference]: Finished difference Result 108 states and 150 transitions. [2019-12-18 23:15:23,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:15:23,274 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 23:15:23,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:23,275 INFO L225 Difference]: With dead ends: 108 [2019-12-18 23:15:23,275 INFO L226 Difference]: Without dead ends: 95 [2019-12-18 23:15:23,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2019-12-18 23:15:23,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-18 23:15:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-12-18 23:15:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-18 23:15:23,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2019-12-18 23:15:23,278 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 22 [2019-12-18 23:15:23,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:23,278 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2019-12-18 23:15:23,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:15:23,278 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2019-12-18 23:15:23,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:15:23,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:23,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:23,279 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:15:23,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:23,279 INFO L82 PathProgramCache]: Analyzing trace with hash -138827586, now seen corresponding path program 11 times [2019-12-18 23:15:23,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:23,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407393708] [2019-12-18 23:15:23,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:24,196 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 23:15:24,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407393708] [2019-12-18 23:15:24,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:24,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:15:24,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330023597] [2019-12-18 23:15:24,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:15:24,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:24,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:15:24,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:15:24,199 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand 14 states. [2019-12-18 23:15:25,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:25,442 INFO L93 Difference]: Finished difference Result 106 states and 147 transitions. [2019-12-18 23:15:25,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 23:15:25,443 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 23:15:25,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:25,443 INFO L225 Difference]: With dead ends: 106 [2019-12-18 23:15:25,444 INFO L226 Difference]: Without dead ends: 94 [2019-12-18 23:15:25,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2019-12-18 23:15:25,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-18 23:15:25,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-12-18 23:15:25,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-18 23:15:25,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2019-12-18 23:15:25,447 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 22 [2019-12-18 23:15:25,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:25,447 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2019-12-18 23:15:25,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:15:25,448 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2019-12-18 23:15:25,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:15:25,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:25,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:25,448 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:15:25,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:25,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1653182388, now seen corresponding path program 12 times [2019-12-18 23:15:25,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:25,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11220988] [2019-12-18 23:15:25,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:26,354 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 23:15:26,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11220988] [2019-12-18 23:15:26,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:26,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:15:26,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424444420] [2019-12-18 23:15:26,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:15:26,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:26,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:15:26,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:15:26,357 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand 14 states. [2019-12-18 23:15:27,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:27,532 INFO L93 Difference]: Finished difference Result 112 states and 158 transitions. [2019-12-18 23:15:27,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 23:15:27,533 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 23:15:27,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:27,534 INFO L225 Difference]: With dead ends: 112 [2019-12-18 23:15:27,534 INFO L226 Difference]: Without dead ends: 112 [2019-12-18 23:15:27,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-12-18 23:15:27,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-18 23:15:27,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-12-18 23:15:27,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-18 23:15:27,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2019-12-18 23:15:27,538 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 22 [2019-12-18 23:15:27,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:27,538 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2019-12-18 23:15:27,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:15:27,538 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2019-12-18 23:15:27,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:15:27,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:27,539 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:27,539 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:15:27,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:27,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1653182376, now seen corresponding path program 4 times [2019-12-18 23:15:27,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:27,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977397904] [2019-12-18 23:15:27,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:27,745 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 23:15:27,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977397904] [2019-12-18 23:15:27,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:27,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:15:27,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534521368] [2019-12-18 23:15:27,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 23:15:27,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:27,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 23:15:27,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:15:27,747 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand 8 states. [2019-12-18 23:15:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:28,237 INFO L93 Difference]: Finished difference Result 113 states and 158 transitions. [2019-12-18 23:15:28,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 23:15:28,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-18 23:15:28,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:28,238 INFO L225 Difference]: With dead ends: 113 [2019-12-18 23:15:28,238 INFO L226 Difference]: Without dead ends: 87 [2019-12-18 23:15:28,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:15:28,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-18 23:15:28,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2019-12-18 23:15:28,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-18 23:15:28,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2019-12-18 23:15:28,241 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 114 transitions. Word has length 22 [2019-12-18 23:15:28,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:28,241 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 114 transitions. [2019-12-18 23:15:28,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 23:15:28,241 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 114 transitions. [2019-12-18 23:15:28,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:15:28,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:28,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:28,242 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:15:28,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:28,243 INFO L82 PathProgramCache]: Analyzing trace with hash 468192644, now seen corresponding path program 3 times [2019-12-18 23:15:28,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:28,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677376305] [2019-12-18 23:15:28,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:15:28,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677376305] [2019-12-18 23:15:28,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:28,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:15:28,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31283892] [2019-12-18 23:15:28,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 23:15:28,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:28,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 23:15:28,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:15:28,564 INFO L87 Difference]: Start difference. First operand 79 states and 114 transitions. Second operand 8 states. [2019-12-18 23:15:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:29,231 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2019-12-18 23:15:29,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:15:29,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-18 23:15:29,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:29,232 INFO L225 Difference]: With dead ends: 70 [2019-12-18 23:15:29,232 INFO L226 Difference]: Without dead ends: 70 [2019-12-18 23:15:29,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:15:29,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-18 23:15:29,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2019-12-18 23:15:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-18 23:15:29,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2019-12-18 23:15:29,234 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 22 [2019-12-18 23:15:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:29,234 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2019-12-18 23:15:29,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 23:15:29,235 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2019-12-18 23:15:29,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:15:29,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:29,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:29,235 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:15:29,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:29,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1814694994, now seen corresponding path program 13 times [2019-12-18 23:15:29,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:29,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186394321] [2019-12-18 23:15:29,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:30,207 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 23:15:30,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186394321] [2019-12-18 23:15:30,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:30,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:15:30,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490428832] [2019-12-18 23:15:30,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:15:30,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:30,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:15:30,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:15:30,209 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. Second operand 14 states. [2019-12-18 23:15:31,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:31,299 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2019-12-18 23:15:31,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 23:15:31,300 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 23:15:31,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:31,300 INFO L225 Difference]: With dead ends: 77 [2019-12-18 23:15:31,300 INFO L226 Difference]: Without dead ends: 69 [2019-12-18 23:15:31,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-12-18 23:15:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-18 23:15:31,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-12-18 23:15:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-18 23:15:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2019-12-18 23:15:31,303 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 22 [2019-12-18 23:15:31,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:31,303 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2019-12-18 23:15:31,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:15:31,303 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2019-12-18 23:15:31,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:15:31,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:31,304 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:31,304 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:15:31,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:31,304 INFO L82 PathProgramCache]: Analyzing trace with hash -437525002, now seen corresponding path program 14 times [2019-12-18 23:15:31,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:31,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44118877] [2019-12-18 23:15:31,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:15:32,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44118877] [2019-12-18 23:15:32,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:32,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:15:32,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839952150] [2019-12-18 23:15:32,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:15:32,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:32,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:15:32,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:15:32,182 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 14 states. [2019-12-18 23:15:33,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:33,217 INFO L93 Difference]: Finished difference Result 76 states and 102 transitions. [2019-12-18 23:15:33,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:15:33,218 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 23:15:33,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:33,219 INFO L225 Difference]: With dead ends: 76 [2019-12-18 23:15:33,219 INFO L226 Difference]: Without dead ends: 49 [2019-12-18 23:15:33,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-12-18 23:15:33,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-18 23:15:33,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-12-18 23:15:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-18 23:15:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-12-18 23:15:33,221 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 22 [2019-12-18 23:15:33,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:33,221 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-12-18 23:15:33,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:15:33,222 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-12-18 23:15:33,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:15:33,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:33,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:33,222 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:15:33,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:33,223 INFO L82 PathProgramCache]: Analyzing trace with hash 448489492, now seen corresponding path program 15 times [2019-12-18 23:15:33,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:33,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125056309] [2019-12-18 23:15:33,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:34,063 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 23:15:34,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125056309] [2019-12-18 23:15:34,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:34,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:15:34,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100143584] [2019-12-18 23:15:34,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:15:34,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:34,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:15:34,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:15:34,065 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 14 states. [2019-12-18 23:15:35,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:35,064 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-12-18 23:15:35,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:15:35,064 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 23:15:35,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:35,064 INFO L225 Difference]: With dead ends: 53 [2019-12-18 23:15:35,064 INFO L226 Difference]: Without dead ends: 38 [2019-12-18 23:15:35,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-12-18 23:15:35,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-18 23:15:35,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-18 23:15:35,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-18 23:15:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2019-12-18 23:15:35,067 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 22 [2019-12-18 23:15:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:35,067 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2019-12-18 23:15:35,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:15:35,067 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2019-12-18 23:15:35,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:15:35,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:35,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:35,068 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:15:35,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:35,068 INFO L82 PathProgramCache]: Analyzing trace with hash 45305018, now seen corresponding path program 16 times [2019-12-18 23:15:35,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:35,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90550826] [2019-12-18 23:15:35,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:35,704 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 28 [2019-12-18 23:15:36,106 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 23:15:36,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90550826] [2019-12-18 23:15:36,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:15:36,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:15:36,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257461672] [2019-12-18 23:15:36,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:15:36,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:36,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:15:36,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:15:36,108 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand 14 states. [2019-12-18 23:15:36,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:36,998 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-12-18 23:15:36,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:15:36,999 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 23:15:36,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:36,999 INFO L225 Difference]: With dead ends: 37 [2019-12-18 23:15:36,999 INFO L226 Difference]: Without dead ends: 0 [2019-12-18 23:15:37,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-18 23:15:37,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-18 23:15:37,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-18 23:15:37,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-18 23:15:37,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-18 23:15:37,001 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-12-18 23:15:37,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:37,001 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-18 23:15:37,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:15:37,001 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-18 23:15:37,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-18 23:15:37,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:15:37 BasicIcfg [2019-12-18 23:15:37,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:15:37,006 INFO L168 Benchmark]: Toolchain (without parser) took 53565.34 ms. Allocated memory was 143.1 MB in the beginning and 498.1 MB in the end (delta: 354.9 MB). Free memory was 97.5 MB in the beginning and 279.0 MB in the end (delta: -181.5 MB). Peak memory consumption was 173.5 MB. Max. memory is 7.1 GB. [2019-12-18 23:15:37,007 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 23:15:37,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1388.22 ms. Allocated memory was 143.1 MB in the beginning and 229.6 MB in the end (delta: 86.5 MB). Free memory was 97.1 MB in the beginning and 166.4 MB in the end (delta: -69.3 MB). Peak memory consumption was 78.6 MB. Max. memory is 7.1 GB. [2019-12-18 23:15:37,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 154.23 ms. Allocated memory is still 229.6 MB. Free memory was 166.4 MB in the beginning and 163.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-18 23:15:37,008 INFO L168 Benchmark]: Boogie Preprocessor took 97.89 ms. Allocated memory is still 229.6 MB. Free memory was 163.4 MB in the beginning and 160.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-18 23:15:37,009 INFO L168 Benchmark]: RCFGBuilder took 1032.66 ms. Allocated memory is still 229.6 MB. Free memory was 160.4 MB in the beginning and 113.3 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. [2019-12-18 23:15:37,010 INFO L168 Benchmark]: TraceAbstraction took 50887.34 ms. Allocated memory was 229.6 MB in the beginning and 498.1 MB in the end (delta: 268.4 MB). Free memory was 111.8 MB in the beginning and 279.0 MB in the end (delta: -167.1 MB). Peak memory consumption was 101.3 MB. Max. memory is 7.1 GB. [2019-12-18 23:15:37,013 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.50 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1388.22 ms. Allocated memory was 143.1 MB in the beginning and 229.6 MB in the end (delta: 86.5 MB). Free memory was 97.1 MB in the beginning and 166.4 MB in the end (delta: -69.3 MB). Peak memory consumption was 78.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 154.23 ms. Allocated memory is still 229.6 MB. Free memory was 166.4 MB in the beginning and 163.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 97.89 ms. Allocated memory is still 229.6 MB. Free memory was 163.4 MB in the beginning and 160.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1032.66 ms. Allocated memory is still 229.6 MB. Free memory was 160.4 MB in the beginning and 113.3 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 50887.34 ms. Allocated memory was 229.6 MB in the beginning and 498.1 MB in the end (delta: 268.4 MB). Free memory was 111.8 MB in the beginning and 279.0 MB in the end (delta: -167.1 MB). Peak memory consumption was 101.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 10.9s, 150 ProgramPointsBefore, 40 ProgramPointsAfterwards, 154 TransitionsBefore, 39 TransitionsAfterwards, 2652 CoEnabledTransitionPairs, 8 FixpointIterations, 90 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 15 ConcurrentYvCompositions, 6 ChoiceCompositions, 1364 VarBasedMoverChecksPositive, 37 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 5214 CheckedPairsTotal, 166 TotalNumberOfCompositions - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 6 error locations. Result: SAFE, OverallTime: 50.7s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 22.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 710 SDtfs, 983 SDslu, 2568 SDs, 0 SdLazy, 6462 SolverSat, 444 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 24 SyntacticMatches, 45 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 21.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 913 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 526 NumberOfCodeBlocks, 526 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 499 ConstructedInterpolants, 0 QuantifiedInterpolants, 199353 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...