/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-60729f1 [2020-11-12 00:32:15,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-12 00:32:15,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-12 00:32:15,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-12 00:32:15,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-12 00:32:15,285 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-12 00:32:15,287 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-12 00:32:15,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-12 00:32:15,291 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-12 00:32:15,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-12 00:32:15,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-12 00:32:15,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-12 00:32:15,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-12 00:32:15,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-12 00:32:15,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-12 00:32:15,300 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-12 00:32:15,301 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-12 00:32:15,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-12 00:32:15,305 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-12 00:32:15,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-12 00:32:15,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-12 00:32:15,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-12 00:32:15,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-12 00:32:15,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-12 00:32:15,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-12 00:32:15,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-12 00:32:15,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-12 00:32:15,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-12 00:32:15,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-12 00:32:15,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-12 00:32:15,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-12 00:32:15,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-12 00:32:15,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-12 00:32:15,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-12 00:32:15,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-12 00:32:15,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-12 00:32:15,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-12 00:32:15,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-12 00:32:15,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-12 00:32:15,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-12 00:32:15,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-12 00:32:15,350 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-11-12 00:32:15,413 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-12 00:32:15,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-12 00:32:15,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-12 00:32:15,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-12 00:32:15,419 INFO L138 SettingsManager]: * Use SBE=true [2020-11-12 00:32:15,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-12 00:32:15,419 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-12 00:32:15,420 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-12 00:32:15,420 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-12 00:32:15,420 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-12 00:32:15,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-12 00:32:15,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-12 00:32:15,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-12 00:32:15,422 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-12 00:32:15,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-12 00:32:15,423 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-12 00:32:15,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-12 00:32:15,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-12 00:32:15,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-12 00:32:15,424 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-12 00:32:15,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-12 00:32:15,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-12 00:32:15,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-12 00:32:15,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-12 00:32:15,426 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-12 00:32:15,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-12 00:32:15,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-12 00:32:15,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-12 00:32:15,427 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-12 00:32:15,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-12 00:32:15,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-12 00:32:15,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-12 00:32:15,874 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-12 00:32:15,875 INFO L275 PluginConnector]: CDTParser initialized [2020-11-12 00:32:15,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-11-12 00:32:15,962 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b548cb81/f4d905b7fa394df4a59a8582bcde990f/FLAGd12dedf64 [2020-11-12 00:32:16,790 INFO L306 CDTParser]: Found 1 translation units. [2020-11-12 00:32:16,792 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-11-12 00:32:16,821 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b548cb81/f4d905b7fa394df4a59a8582bcde990f/FLAGd12dedf64 [2020-11-12 00:32:16,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b548cb81/f4d905b7fa394df4a59a8582bcde990f [2020-11-12 00:32:16,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-12 00:32:16,965 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-12 00:32:16,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-12 00:32:16,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-12 00:32:16,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-12 00:32:16,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:32:16" (1/1) ... [2020-11-12 00:32:16,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b3fc39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:16, skipping insertion in model container [2020-11-12 00:32:16,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:32:16" (1/1) ... [2020-11-12 00:32:16,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-12 00:32:17,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-12 00:32:17,199 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-11-12 00:32:17,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 00:32:17,787 INFO L203 MainTranslator]: Completed pre-run [2020-11-12 00:32:17,801 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-11-12 00:32:17,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 00:32:18,254 INFO L208 MainTranslator]: Completed translation [2020-11-12 00:32:18,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:18 WrapperNode [2020-11-12 00:32:18,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-12 00:32:18,256 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-12 00:32:18,256 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-12 00:32:18,256 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-12 00:32:18,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:18" (1/1) ... [2020-11-12 00:32:18,299 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:18" (1/1) ... [2020-11-12 00:32:18,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-12 00:32:18,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-12 00:32:18,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-12 00:32:18,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-12 00:32:18,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:18" (1/1) ... [2020-11-12 00:32:18,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:18" (1/1) ... [2020-11-12 00:32:18,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:18" (1/1) ... [2020-11-12 00:32:18,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:18" (1/1) ... [2020-11-12 00:32:18,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:18" (1/1) ... [2020-11-12 00:32:18,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:18" (1/1) ... [2020-11-12 00:32:18,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:18" (1/1) ... [2020-11-12 00:32:18,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-12 00:32:18,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-12 00:32:18,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-12 00:32:18,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-12 00:32:18,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:18" (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 [2020-11-12 00:32:18,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-12 00:32:18,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-12 00:32:18,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-12 00:32:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-12 00:32:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-12 00:32:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-12 00:32:18,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-12 00:32:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-11-12 00:32:18,483 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-11-12 00:32:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-12 00:32:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-12 00:32:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-12 00:32:18,486 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-12 00:32:19,434 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-12 00:32:19,434 INFO L298 CfgBuilder]: Removed 36 assume(true) statements. [2020-11-12 00:32:19,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:32:19 BoogieIcfgContainer [2020-11-12 00:32:19,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-12 00:32:19,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-12 00:32:19,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-12 00:32:19,442 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-12 00:32:19,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:32:16" (1/3) ... [2020-11-12 00:32:19,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7256e4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:32:19, skipping insertion in model container [2020-11-12 00:32:19,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:18" (2/3) ... [2020-11-12 00:32:19,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7256e4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:32:19, skipping insertion in model container [2020-11-12 00:32:19,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:32:19" (3/3) ... [2020-11-12 00:32:19,446 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2020-11-12 00:32:19,463 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-12 00:32:19,463 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-12 00:32:19,467 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-11-12 00:32:19,468 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-12 00:32:19,506 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,506 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,506 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,507 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,507 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,507 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,507 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,508 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,508 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,508 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,508 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,508 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,509 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,509 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,509 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,509 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,510 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,510 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,510 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,510 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,511 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,511 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,511 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,511 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,511 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,512 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,512 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,512 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,513 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,513 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,513 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,513 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,514 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,514 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,514 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,514 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,515 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,515 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,515 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,515 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,516 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,516 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,516 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,516 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,516 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,517 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,517 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,517 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,517 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,518 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,518 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,518 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,518 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,519 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,519 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,519 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,519 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,519 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,520 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,520 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,520 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,520 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,520 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,521 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,521 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,521 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,522 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,522 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,522 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,522 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,522 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,523 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,523 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,523 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,524 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,524 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,526 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,526 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,527 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,527 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,527 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,527 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,528 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,528 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,528 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,532 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,532 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,532 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,533 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,533 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,533 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,533 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,533 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,534 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:32:19,547 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-11-12 00:32:19,559 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-11-12 00:32:19,582 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-12 00:32:19,582 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-12 00:32:19,582 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-12 00:32:19,582 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-12 00:32:19,582 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-12 00:32:19,582 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-12 00:32:19,583 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-12 00:32:19,583 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-12 00:32:19,600 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-12 00:32:19,603 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 178 transitions, 378 flow [2020-11-12 00:32:19,606 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 178 transitions, 378 flow [2020-11-12 00:32:19,608 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 168 places, 178 transitions, 378 flow [2020-11-12 00:32:19,714 INFO L129 PetriNetUnfolder]: 19/226 cut-off events. [2020-11-12 00:32:19,714 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-11-12 00:32:19,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 226 events. 19/226 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 446 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 126. Up to 4 conditions per place. [2020-11-12 00:32:19,728 INFO L116 LiptonReduction]: Number of co-enabled transitions 1872 [2020-11-12 00:32:20,178 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-11-12 00:32:22,042 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:22,073 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:22,083 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:22,104 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:22,106 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:22,106 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-11-12 00:32:22,123 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:22,142 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:22,149 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:22,175 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:22,176 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:22,177 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-11-12 00:32:24,348 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2020-11-12 00:32:25,349 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:25,395 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:25,401 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:25,452 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:25,454 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:25,454 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2020-11-12 00:32:25,474 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:25,515 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:25,533 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:25,568 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:25,569 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:25,569 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:136, output treesize:138 [2020-11-12 00:32:27,627 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:27,660 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:27,665 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:27,700 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:27,702 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:27,702 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-11-12 00:32:27,726 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:27,773 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:27,778 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:27,814 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:27,815 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:27,816 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-11-12 00:32:29,940 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:30,006 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:30,011 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:30,058 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:30,059 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:30,059 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:142, output treesize:144 [2020-11-12 00:32:30,074 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:30,120 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:30,126 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:30,173 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:30,174 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:30,174 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:140, output treesize:142 [2020-11-12 00:32:32,195 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:32,230 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:32,235 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:32,269 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:32,270 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:32,270 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:158, output treesize:160 [2020-11-12 00:32:32,293 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:32,329 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:32,338 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:32,372 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:32,374 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:32,374 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:158, output treesize:160 [2020-11-12 00:32:35,371 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:35,436 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:35,443 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:35,484 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:35,485 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:35,486 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:158, output treesize:160 [2020-11-12 00:32:35,499 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:35,580 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:35,585 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:35,623 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:35,624 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:35,626 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:158, output treesize:160 [2020-11-12 00:32:35,644 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:35,670 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:35,674 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:35,693 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:35,694 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:35,694 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:126, output treesize:128 [2020-11-12 00:32:35,715 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:35,743 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:35,748 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:35,776 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:35,776 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:35,777 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:128, output treesize:130 [2020-11-12 00:32:38,122 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:38,170 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:38,176 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:38,218 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:38,219 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:38,220 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:108 [2020-11-12 00:32:38,234 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:38,277 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:38,283 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:38,319 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:38,321 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:38,321 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:108, output treesize:110 [2020-11-12 00:32:40,350 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:40,395 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:40,400 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:40,433 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:40,434 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:40,434 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-11-12 00:32:40,452 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:40,500 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:40,505 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:40,546 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:40,547 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:40,548 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-11-12 00:32:43,204 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:43,238 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:43,242 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:43,284 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:43,285 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:43,286 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-11-12 00:32:43,305 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:43,343 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:43,351 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:43,381 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:43,382 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:43,382 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-11-12 00:32:45,944 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-11-12 00:32:46,142 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-11-12 00:32:46,201 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:46,252 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:46,258 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:46,303 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:46,304 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:46,305 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:127 [2020-11-12 00:32:46,318 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:46,369 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:46,374 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:46,417 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:46,419 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:46,419 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:127 [2020-11-12 00:32:48,448 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:48,484 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:48,489 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:48,517 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:48,518 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:48,519 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-11-12 00:32:48,535 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:48,567 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:48,571 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:48,597 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:48,598 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:48,599 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-11-12 00:32:50,677 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:50,699 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:50,704 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:50,721 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:50,722 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:50,723 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2020-11-12 00:32:50,783 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:50,807 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:50,813 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:50,834 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:50,834 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:50,835 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2020-11-12 00:32:51,009 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:51,062 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:51,067 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:51,110 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:51,111 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:51,112 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-11-12 00:32:51,125 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:51,162 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:51,174 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:51,208 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:51,209 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:51,209 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-11-12 00:32:53,811 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:53,865 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:53,870 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:53,925 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:53,926 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:53,926 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-11-12 00:32:53,962 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:54,018 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:54,023 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:54,070 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:54,071 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:54,071 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-11-12 00:32:54,086 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:54,131 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:54,135 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:54,181 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:54,182 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:54,183 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-11-12 00:32:54,194 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:54,228 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:54,232 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:54,263 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:54,264 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:54,264 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:124 [2020-11-12 00:32:56,862 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2020-11-12 00:32:57,058 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:57,087 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:57,091 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:57,121 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:57,121 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:57,122 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-11-12 00:32:57,140 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:57,177 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:57,181 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:57,214 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:57,215 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:57,216 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-11-12 00:32:59,309 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:59,374 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:59,381 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:59,421 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:59,422 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:59,423 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:141, output treesize:143 [2020-11-12 00:32:59,439 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:59,503 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:59,508 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:59,556 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:59,558 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:59,558 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:139, output treesize:141 [2020-11-12 00:33:02,457 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2020-11-12 00:33:02,565 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-12 00:33:02,796 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2020-11-12 00:33:02,903 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-12 00:33:03,556 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2020-11-12 00:33:03,568 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:33:03,708 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-12 00:33:03,709 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:33:03,742 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:33:03,867 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-12 00:33:03,867 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:33:03,868 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:33:03,868 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:172, output treesize:144 [2020-11-12 00:33:03,986 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-12 00:33:04,397 WARN L193 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 100 [2020-11-12 00:33:04,408 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:33:04,536 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-12 00:33:04,536 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:33:04,542 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:33:04,660 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-11-12 00:33:04,660 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:33:04,661 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:33:04,661 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:175, output treesize:147 [2020-11-12 00:33:04,790 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-11-12 00:33:05,227 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2020-11-12 00:33:06,084 WARN L193 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 142 [2020-11-12 00:33:06,376 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-11-12 00:33:07,298 WARN L193 SmtUtils]: Spent 920.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 145 [2020-11-12 00:33:07,670 WARN L193 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2020-11-12 00:33:08,076 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-11-12 00:33:08,459 WARN L193 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-11-12 00:33:08,834 WARN L193 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2020-11-12 00:33:09,204 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2020-11-12 00:33:09,384 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2020-11-12 00:33:09,757 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2020-11-12 00:33:10,037 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2020-11-12 00:33:11,017 WARN L193 SmtUtils]: Spent 904.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 159 [2020-11-12 00:33:11,455 WARN L193 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-11-12 00:33:12,450 WARN L193 SmtUtils]: Spent 993.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 172 [2020-11-12 00:33:12,981 WARN L193 SmtUtils]: Spent 518.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-11-12 00:33:15,028 WARN L193 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 173 DAG size of output: 171 [2020-11-12 00:33:15,056 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:33:15,822 WARN L193 SmtUtils]: Spent 765.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-11-12 00:33:15,823 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:33:15,836 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:33:16,545 WARN L193 SmtUtils]: Spent 708.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-11-12 00:33:16,546 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:33:16,547 INFO L547 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. [2020-11-12 00:33:16,547 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:350, output treesize:362 [2020-11-12 00:33:17,326 WARN L193 SmtUtils]: Spent 777.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-11-12 00:33:19,721 WARN L193 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 188 DAG size of output: 184 [2020-11-12 00:33:19,746 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:33:20,846 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 164 [2020-11-12 00:33:20,847 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:33:20,860 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:33:21,773 WARN L193 SmtUtils]: Spent 912.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-11-12 00:33:21,773 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:33:21,774 INFO L547 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. [2020-11-12 00:33:21,775 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:362, output treesize:374 [2020-11-12 00:33:22,743 WARN L193 SmtUtils]: Spent 967.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-11-12 00:33:22,795 INFO L131 LiptonReduction]: Checked pairs total: 3542 [2020-11-12 00:33:22,795 INFO L133 LiptonReduction]: Total number of compositions: 228 [2020-11-12 00:33:22,802 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 34 transitions, 90 flow [2020-11-12 00:33:22,820 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 131 states, 120 states have (on average 2.2583333333333333) internal successors, (271), 130 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:22,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 120 states have (on average 2.2583333333333333) internal successors, (271), 130 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:22,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-11-12 00:33:22,829 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:22,830 INFO L494 BasicCegarLoop]: trace histogram [1] [2020-11-12 00:33:22,830 INFO L429 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]=== [2020-11-12 00:33:22,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:22,837 INFO L82 PathProgramCache]: Analyzing trace with hash 688, now seen corresponding path program 1 times [2020-11-12 00:33:22,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:22,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869499237] [2020-11-12 00:33:22,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:23,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:23,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869499237] [2020-11-12 00:33:23,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:23,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-11-12 00:33:23,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719836510] [2020-11-12 00:33:23,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-12 00:33:23,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:23,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-12 00:33:23,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-12 00:33:23,141 INFO L87 Difference]: Start difference. First operand has 131 states, 120 states have (on average 2.2583333333333333) internal successors, (271), 130 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:23,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:23,177 INFO L93 Difference]: Finished difference Result 129 states and 258 transitions. [2020-11-12 00:33:23,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-12 00:33:23,178 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2020-11-12 00:33:23,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:23,189 INFO L225 Difference]: With dead ends: 129 [2020-11-12 00:33:23,190 INFO L226 Difference]: Without dead ends: 118 [2020-11-12 00:33:23,191 INFO L749 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 [2020-11-12 00:33:23,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-11-12 00:33:23,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2020-11-12 00:33:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 112 states have (on average 2.0982142857142856) internal successors, (235), 117 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:23,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 235 transitions. [2020-11-12 00:33:23,244 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 235 transitions. Word has length 1 [2020-11-12 00:33:23,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:23,244 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 235 transitions. [2020-11-12 00:33:23,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:23,245 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 235 transitions. [2020-11-12 00:33:23,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-11-12 00:33:23,245 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:23,245 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-11-12 00:33:23,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-12 00:33:23,246 INFO L429 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]=== [2020-11-12 00:33:23,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:23,247 INFO L82 PathProgramCache]: Analyzing trace with hash 21229972, now seen corresponding path program 1 times [2020-11-12 00:33:23,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:23,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138131376] [2020-11-12 00:33:23,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:23,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:23,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138131376] [2020-11-12 00:33:23,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:23,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-12 00:33:23,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132581948] [2020-11-12 00:33:23,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 00:33:23,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:23,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 00:33:23,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:33:23,474 INFO L87 Difference]: Start difference. First operand 118 states and 235 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:23,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:23,583 INFO L93 Difference]: Finished difference Result 156 states and 313 transitions. [2020-11-12 00:33:23,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 00:33:23,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2020-11-12 00:33:23,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:23,587 INFO L225 Difference]: With dead ends: 156 [2020-11-12 00:33:23,588 INFO L226 Difference]: Without dead ends: 156 [2020-11-12 00:33:23,588 INFO L749 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 [2020-11-12 00:33:23,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-11-12 00:33:23,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 132. [2020-11-12 00:33:23,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 2.1023622047244093) internal successors, (267), 131 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 267 transitions. [2020-11-12 00:33:23,607 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 267 transitions. Word has length 4 [2020-11-12 00:33:23,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:23,608 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 267 transitions. [2020-11-12 00:33:23,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 267 transitions. [2020-11-12 00:33:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-12 00:33:23,609 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:23,609 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-12 00:33:23,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-12 00:33:23,609 INFO L429 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]=== [2020-11-12 00:33:23,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:23,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1072804933, now seen corresponding path program 1 times [2020-11-12 00:33:23,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:23,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369386826] [2020-11-12 00:33:23,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:23,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:23,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369386826] [2020-11-12 00:33:23,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:23,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:33:23,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486801094] [2020-11-12 00:33:23,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-12 00:33:23,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:23,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-12 00:33:23,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-12 00:33:23,694 INFO L87 Difference]: Start difference. First operand 132 states and 267 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:23,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:23,814 INFO L93 Difference]: Finished difference Result 170 states and 337 transitions. [2020-11-12 00:33:23,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-12 00:33:23,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2020-11-12 00:33:23,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:23,817 INFO L225 Difference]: With dead ends: 170 [2020-11-12 00:33:23,817 INFO L226 Difference]: Without dead ends: 145 [2020-11-12 00:33:23,818 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:33:23,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-11-12 00:33:23,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 137. [2020-11-12 00:33:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 133 states have (on average 2.1503759398496243) internal successors, (286), 136 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 286 transitions. [2020-11-12 00:33:23,832 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 286 transitions. Word has length 6 [2020-11-12 00:33:23,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:23,832 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 286 transitions. [2020-11-12 00:33:23,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 286 transitions. [2020-11-12 00:33:23,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-12 00:33:23,834 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:23,834 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:23,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-12 00:33:23,835 INFO L429 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]=== [2020-11-12 00:33:23,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:23,835 INFO L82 PathProgramCache]: Analyzing trace with hash -317652726, now seen corresponding path program 1 times [2020-11-12 00:33:23,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:23,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737241329] [2020-11-12 00:33:23,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:23,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737241329] [2020-11-12 00:33:23,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:23,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:33:23,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405106121] [2020-11-12 00:33:23,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 00:33:23,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:23,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 00:33:23,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:33:23,962 INFO L87 Difference]: Start difference. First operand 137 states and 286 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:23,988 INFO L93 Difference]: Finished difference Result 57 states and 101 transitions. [2020-11-12 00:33:23,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 00:33:23,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2020-11-12 00:33:23,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:23,990 INFO L225 Difference]: With dead ends: 57 [2020-11-12 00:33:23,990 INFO L226 Difference]: Without dead ends: 57 [2020-11-12 00:33:23,991 INFO L749 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 [2020-11-12 00:33:23,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-12 00:33:23,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-11-12 00:33:23,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.8363636363636364) internal successors, (101), 56 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 101 transitions. [2020-11-12 00:33:23,998 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 101 transitions. Word has length 9 [2020-11-12 00:33:23,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:23,998 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 101 transitions. [2020-11-12 00:33:23,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:23,999 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 101 transitions. [2020-11-12 00:33:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:24,001 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:24,001 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:24,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-12 00:33:24,003 INFO L429 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]=== [2020-11-12 00:33:24,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:24,004 INFO L82 PathProgramCache]: Analyzing trace with hash -872190712, now seen corresponding path program 1 times [2020-11-12 00:33:24,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:24,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335423282] [2020-11-12 00:33:24,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:24,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:24,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335423282] [2020-11-12 00:33:24,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:24,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:24,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9674619] [2020-11-12 00:33:24,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:24,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:24,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:24,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:24,661 INFO L87 Difference]: Start difference. First operand 57 states and 101 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:25,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:25,238 INFO L93 Difference]: Finished difference Result 81 states and 136 transitions. [2020-11-12 00:33:25,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 00:33:25,239 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:25,240 INFO L225 Difference]: With dead ends: 81 [2020-11-12 00:33:25,241 INFO L226 Difference]: Without dead ends: 81 [2020-11-12 00:33:25,241 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:25,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-11-12 00:33:25,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2020-11-12 00:33:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 73 states have (on average 1.7397260273972603) internal successors, (127), 74 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:25,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 127 transitions. [2020-11-12 00:33:25,248 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 127 transitions. Word has length 16 [2020-11-12 00:33:25,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:25,249 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 127 transitions. [2020-11-12 00:33:25,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:25,249 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 127 transitions. [2020-11-12 00:33:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:25,250 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:25,250 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:25,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-12 00:33:25,250 INFO L429 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]=== [2020-11-12 00:33:25,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:25,251 INFO L82 PathProgramCache]: Analyzing trace with hash -872190733, now seen corresponding path program 1 times [2020-11-12 00:33:25,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:25,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004340790] [2020-11-12 00:33:25,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:25,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004340790] [2020-11-12 00:33:25,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:25,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:33:25,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262630026] [2020-11-12 00:33:25,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:33:25,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:25,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:33:25,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:33:25,614 INFO L87 Difference]: Start difference. First operand 75 states and 127 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:26,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:26,196 INFO L93 Difference]: Finished difference Result 133 states and 210 transitions. [2020-11-12 00:33:26,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 00:33:26,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:26,199 INFO L225 Difference]: With dead ends: 133 [2020-11-12 00:33:26,199 INFO L226 Difference]: Without dead ends: 116 [2020-11-12 00:33:26,199 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2020-11-12 00:33:26,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-11-12 00:33:26,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 84. [2020-11-12 00:33:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.7195121951219512) internal successors, (141), 83 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:26,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 141 transitions. [2020-11-12 00:33:26,206 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 141 transitions. Word has length 16 [2020-11-12 00:33:26,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:26,206 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 141 transitions. [2020-11-12 00:33:26,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:26,207 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 141 transitions. [2020-11-12 00:33:26,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:26,208 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:26,208 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:26,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-12 00:33:26,208 INFO L429 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]=== [2020-11-12 00:33:26,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:26,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1988745822, now seen corresponding path program 2 times [2020-11-12 00:33:26,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:26,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386250124] [2020-11-12 00:33:26,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:26,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386250124] [2020-11-12 00:33:26,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:26,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:26,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986133436] [2020-11-12 00:33:26,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:26,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:26,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:26,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:26,697 INFO L87 Difference]: Start difference. First operand 84 states and 141 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:27,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:27,212 INFO L93 Difference]: Finished difference Result 102 states and 166 transitions. [2020-11-12 00:33:27,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:33:27,212 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:27,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:27,214 INFO L225 Difference]: With dead ends: 102 [2020-11-12 00:33:27,214 INFO L226 Difference]: Without dead ends: 89 [2020-11-12 00:33:27,214 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:27,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-12 00:33:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2020-11-12 00:33:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.7073170731707317) internal successors, (140), 83 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 140 transitions. [2020-11-12 00:33:27,220 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 140 transitions. Word has length 16 [2020-11-12 00:33:27,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:27,220 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 140 transitions. [2020-11-12 00:33:27,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:27,220 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 140 transitions. [2020-11-12 00:33:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:27,221 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:27,222 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:27,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-12 00:33:27,222 INFO L429 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]=== [2020-11-12 00:33:27,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:27,222 INFO L82 PathProgramCache]: Analyzing trace with hash -47842594, now seen corresponding path program 1 times [2020-11-12 00:33:27,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:27,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048860522] [2020-11-12 00:33:27,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:27,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048860522] [2020-11-12 00:33:27,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:27,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 00:33:27,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757335476] [2020-11-12 00:33:27,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:33:27,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:27,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:33:27,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:33:27,390 INFO L87 Difference]: Start difference. First operand 84 states and 140 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:27,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:27,570 INFO L93 Difference]: Finished difference Result 96 states and 155 transitions. [2020-11-12 00:33:27,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:33:27,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:27,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:27,572 INFO L225 Difference]: With dead ends: 96 [2020-11-12 00:33:27,572 INFO L226 Difference]: Without dead ends: 96 [2020-11-12 00:33:27,572 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:33:27,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-11-12 00:33:27,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2020-11-12 00:33:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 1.6704545454545454) internal successors, (147), 89 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:27,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 147 transitions. [2020-11-12 00:33:27,577 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 147 transitions. Word has length 16 [2020-11-12 00:33:27,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:27,577 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 147 transitions. [2020-11-12 00:33:27,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:27,578 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 147 transitions. [2020-11-12 00:33:27,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:27,579 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:27,579 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:27,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-12 00:33:27,579 INFO L429 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]=== [2020-11-12 00:33:27,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:27,580 INFO L82 PathProgramCache]: Analyzing trace with hash 323656392, now seen corresponding path program 3 times [2020-11-12 00:33:27,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:27,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892678675] [2020-11-12 00:33:27,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:27,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:27,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892678675] [2020-11-12 00:33:27,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:27,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:27,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839863453] [2020-11-12 00:33:27,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:27,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:27,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:27,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:27,884 INFO L87 Difference]: Start difference. First operand 90 states and 147 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:28,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:28,397 INFO L93 Difference]: Finished difference Result 100 states and 160 transitions. [2020-11-12 00:33:28,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:33:28,398 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:28,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:28,399 INFO L225 Difference]: With dead ends: 100 [2020-11-12 00:33:28,399 INFO L226 Difference]: Without dead ends: 91 [2020-11-12 00:33:28,399 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:28,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-11-12 00:33:28,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2020-11-12 00:33:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 84 states have (on average 1.6904761904761905) internal successors, (142), 85 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 142 transitions. [2020-11-12 00:33:28,403 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 142 transitions. Word has length 16 [2020-11-12 00:33:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:28,403 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 142 transitions. [2020-11-12 00:33:28,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:28,404 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 142 transitions. [2020-11-12 00:33:28,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:28,409 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:28,409 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:28,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-12 00:33:28,410 INFO L429 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]=== [2020-11-12 00:33:28,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:28,411 INFO L82 PathProgramCache]: Analyzing trace with hash -890571144, now seen corresponding path program 4 times [2020-11-12 00:33:28,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:28,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415550110] [2020-11-12 00:33:28,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:28,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:28,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415550110] [2020-11-12 00:33:28,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:28,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:28,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272465821] [2020-11-12 00:33:28,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:28,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:28,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:28,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:28,841 INFO L87 Difference]: Start difference. First operand 86 states and 142 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:29,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:29,344 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2020-11-12 00:33:29,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:33:29,345 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:29,346 INFO L225 Difference]: With dead ends: 98 [2020-11-12 00:33:29,346 INFO L226 Difference]: Without dead ends: 81 [2020-11-12 00:33:29,347 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:29,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-11-12 00:33:29,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2020-11-12 00:33:29,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 76 states have (on average 1.6710526315789473) internal successors, (127), 77 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 127 transitions. [2020-11-12 00:33:29,352 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 127 transitions. Word has length 16 [2020-11-12 00:33:29,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:29,352 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 127 transitions. [2020-11-12 00:33:29,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:29,353 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 127 transitions. [2020-11-12 00:33:29,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:29,355 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:29,355 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:29,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-12 00:33:29,355 INFO L429 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]=== [2020-11-12 00:33:29,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:29,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1078268834, now seen corresponding path program 5 times [2020-11-12 00:33:29,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:29,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242329935] [2020-11-12 00:33:29,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:29,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:29,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242329935] [2020-11-12 00:33:29,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:29,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:29,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818494887] [2020-11-12 00:33:29,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:29,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:29,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:29,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:29,747 INFO L87 Difference]: Start difference. First operand 78 states and 127 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:30,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:30,263 INFO L93 Difference]: Finished difference Result 102 states and 159 transitions. [2020-11-12 00:33:30,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 00:33:30,264 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:30,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:30,266 INFO L225 Difference]: With dead ends: 102 [2020-11-12 00:33:30,266 INFO L226 Difference]: Without dead ends: 102 [2020-11-12 00:33:30,266 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-11-12 00:33:30,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2020-11-12 00:33:30,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 91 states have (on average 1.6263736263736264) internal successors, (148), 92 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:30,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 148 transitions. [2020-11-12 00:33:30,270 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 148 transitions. Word has length 16 [2020-11-12 00:33:30,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:30,270 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 148 transitions. [2020-11-12 00:33:30,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:30,271 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 148 transitions. [2020-11-12 00:33:30,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:30,271 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:30,271 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:30,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-12 00:33:30,272 INFO L429 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]=== [2020-11-12 00:33:30,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:30,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1078268855, now seen corresponding path program 2 times [2020-11-12 00:33:30,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:30,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222619285] [2020-11-12 00:33:30,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:30,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222619285] [2020-11-12 00:33:30,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:30,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:33:30,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499741468] [2020-11-12 00:33:30,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:33:30,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:30,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:33:30,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:33:30,421 INFO L87 Difference]: Start difference. First operand 93 states and 148 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:30,609 INFO L93 Difference]: Finished difference Result 118 states and 177 transitions. [2020-11-12 00:33:30,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-12 00:33:30,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:30,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:30,611 INFO L225 Difference]: With dead ends: 118 [2020-11-12 00:33:30,611 INFO L226 Difference]: Without dead ends: 105 [2020-11-12 00:33:30,612 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:30,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-11-12 00:33:30,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 80. [2020-11-12 00:33:30,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 1.6666666666666667) internal successors, (130), 79 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 130 transitions. [2020-11-12 00:33:30,616 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 130 transitions. Word has length 16 [2020-11-12 00:33:30,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:30,616 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 130 transitions. [2020-11-12 00:33:30,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:30,616 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 130 transitions. [2020-11-12 00:33:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:30,617 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:30,617 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:30,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-12 00:33:30,617 INFO L429 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]=== [2020-11-12 00:33:30,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:30,618 INFO L82 PathProgramCache]: Analyzing trace with hash 899076664, now seen corresponding path program 6 times [2020-11-12 00:33:30,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:30,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385072666] [2020-11-12 00:33:30,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:30,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:30,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385072666] [2020-11-12 00:33:30,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:30,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:30,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659450403] [2020-11-12 00:33:30,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:30,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:30,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:30,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:30,903 INFO L87 Difference]: Start difference. First operand 80 states and 130 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:31,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:31,296 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2020-11-12 00:33:31,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:33:31,296 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:31,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:31,297 INFO L225 Difference]: With dead ends: 95 [2020-11-12 00:33:31,297 INFO L226 Difference]: Without dead ends: 78 [2020-11-12 00:33:31,297 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:31,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-11-12 00:33:31,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2020-11-12 00:33:31,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 72 states have (on average 1.6388888888888888) internal successors, (118), 73 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 118 transitions. [2020-11-12 00:33:31,301 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 118 transitions. Word has length 16 [2020-11-12 00:33:31,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:31,302 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 118 transitions. [2020-11-12 00:33:31,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 118 transitions. [2020-11-12 00:33:31,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:31,302 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:31,302 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:31,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-12 00:33:31,303 INFO L429 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]=== [2020-11-12 00:33:31,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:31,303 INFO L82 PathProgramCache]: Analyzing trace with hash -713660948, now seen corresponding path program 7 times [2020-11-12 00:33:31,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:31,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721998687] [2020-11-12 00:33:31,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:31,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721998687] [2020-11-12 00:33:31,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:31,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:31,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68006866] [2020-11-12 00:33:31,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:31,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:31,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:31,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:31,634 INFO L87 Difference]: Start difference. First operand 74 states and 118 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:32,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:32,129 INFO L93 Difference]: Finished difference Result 90 states and 142 transitions. [2020-11-12 00:33:32,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 00:33:32,130 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:32,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:32,131 INFO L225 Difference]: With dead ends: 90 [2020-11-12 00:33:32,131 INFO L226 Difference]: Without dead ends: 90 [2020-11-12 00:33:32,132 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-11-12 00:33:32,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2020-11-12 00:33:32,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 85 states have (on average 1.6352941176470588) internal successors, (139), 86 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 139 transitions. [2020-11-12 00:33:32,136 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 139 transitions. Word has length 16 [2020-11-12 00:33:32,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:32,137 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 139 transitions. [2020-11-12 00:33:32,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 139 transitions. [2020-11-12 00:33:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:32,138 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:32,138 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:32,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-12 00:33:32,138 INFO L429 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]=== [2020-11-12 00:33:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:32,138 INFO L82 PathProgramCache]: Analyzing trace with hash -713660969, now seen corresponding path program 3 times [2020-11-12 00:33:32,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:32,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126408305] [2020-11-12 00:33:32,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:32,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126408305] [2020-11-12 00:33:32,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:32,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:33:32,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526820758] [2020-11-12 00:33:32,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:33:32,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:32,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:33:32,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:33:32,370 INFO L87 Difference]: Start difference. First operand 87 states and 139 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:32,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:32,825 INFO L93 Difference]: Finished difference Result 143 states and 216 transitions. [2020-11-12 00:33:32,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-12 00:33:32,826 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:32,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:32,827 INFO L225 Difference]: With dead ends: 143 [2020-11-12 00:33:32,828 INFO L226 Difference]: Without dead ends: 133 [2020-11-12 00:33:32,828 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-11-12 00:33:32,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-11-12 00:33:32,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 85. [2020-11-12 00:33:32,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 84 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:32,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 138 transitions. [2020-11-12 00:33:32,833 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 138 transitions. Word has length 16 [2020-11-12 00:33:32,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:32,833 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 138 transitions. [2020-11-12 00:33:32,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:32,833 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 138 transitions. [2020-11-12 00:33:32,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:32,834 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:32,834 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:32,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-12 00:33:32,834 INFO L429 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]=== [2020-11-12 00:33:32,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:32,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1916216918, now seen corresponding path program 8 times [2020-11-12 00:33:32,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:32,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267939931] [2020-11-12 00:33:32,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:33,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:33,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267939931] [2020-11-12 00:33:33,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:33,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:33,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047978638] [2020-11-12 00:33:33,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:33,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:33,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:33,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:33,133 INFO L87 Difference]: Start difference. First operand 85 states and 138 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:33,578 INFO L93 Difference]: Finished difference Result 91 states and 144 transitions. [2020-11-12 00:33:33,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:33:33,579 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:33,580 INFO L225 Difference]: With dead ends: 91 [2020-11-12 00:33:33,580 INFO L226 Difference]: Without dead ends: 83 [2020-11-12 00:33:33,581 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-11-12 00:33:33,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2020-11-12 00:33:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 1.675) internal successors, (134), 81 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:33,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 134 transitions. [2020-11-12 00:33:33,585 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 134 transitions. Word has length 16 [2020-11-12 00:33:33,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:33,585 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 134 transitions. [2020-11-12 00:33:33,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:33,585 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 134 transitions. [2020-11-12 00:33:33,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:33,586 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:33,586 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:33,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-12 00:33:33,586 INFO L429 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]=== [2020-11-12 00:33:33,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:33,587 INFO L82 PathProgramCache]: Analyzing trace with hash 532672124, now seen corresponding path program 9 times [2020-11-12 00:33:33,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:33,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418028166] [2020-11-12 00:33:33,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:33,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418028166] [2020-11-12 00:33:33,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:33,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:33,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552634275] [2020-11-12 00:33:33,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:33,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:33,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:33,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:33,914 INFO L87 Difference]: Start difference. First operand 82 states and 134 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:34,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:34,345 INFO L93 Difference]: Finished difference Result 108 states and 169 transitions. [2020-11-12 00:33:34,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 00:33:34,346 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:34,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:34,347 INFO L225 Difference]: With dead ends: 108 [2020-11-12 00:33:34,347 INFO L226 Difference]: Without dead ends: 95 [2020-11-12 00:33:34,347 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:34,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-12 00:33:34,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 78. [2020-11-12 00:33:34,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 76 states have (on average 1.6578947368421053) internal successors, (126), 77 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:34,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 126 transitions. [2020-11-12 00:33:34,354 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 126 transitions. Word has length 16 [2020-11-12 00:33:34,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:34,354 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 126 transitions. [2020-11-12 00:33:34,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:34,354 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 126 transitions. [2020-11-12 00:33:34,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:34,355 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:34,355 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:34,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-12 00:33:34,355 INFO L429 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]=== [2020-11-12 00:33:34,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:34,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1784949674, now seen corresponding path program 10 times [2020-11-12 00:33:34,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:34,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139775873] [2020-11-12 00:33:34,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:34,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:34,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139775873] [2020-11-12 00:33:34,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:34,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:34,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47745749] [2020-11-12 00:33:34,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:34,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:34,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:34,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:34,666 INFO L87 Difference]: Start difference. First operand 78 states and 126 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:35,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:35,091 INFO L93 Difference]: Finished difference Result 99 states and 154 transitions. [2020-11-12 00:33:35,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:33:35,092 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:35,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:35,093 INFO L225 Difference]: With dead ends: 99 [2020-11-12 00:33:35,093 INFO L226 Difference]: Without dead ends: 86 [2020-11-12 00:33:35,094 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:35,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-11-12 00:33:35,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2020-11-12 00:33:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.635135135135135) internal successors, (121), 75 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 121 transitions. [2020-11-12 00:33:35,098 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 121 transitions. Word has length 16 [2020-11-12 00:33:35,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:35,098 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 121 transitions. [2020-11-12 00:33:35,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 121 transitions. [2020-11-12 00:33:35,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:35,101 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:35,102 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:35,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-12 00:33:35,102 INFO L429 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]=== [2020-11-12 00:33:35,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:35,102 INFO L82 PathProgramCache]: Analyzing trace with hash 955150624, now seen corresponding path program 2 times [2020-11-12 00:33:35,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:35,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953383384] [2020-11-12 00:33:35,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:35,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:35,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953383384] [2020-11-12 00:33:35,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:35,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:33:35,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861371004] [2020-11-12 00:33:35,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-12 00:33:35,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:35,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-12 00:33:35,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-12 00:33:35,272 INFO L87 Difference]: Start difference. First operand 76 states and 121 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:35,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:35,561 INFO L93 Difference]: Finished difference Result 75 states and 113 transitions. [2020-11-12 00:33:35,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:33:35,562 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:35,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:35,563 INFO L225 Difference]: With dead ends: 75 [2020-11-12 00:33:35,563 INFO L226 Difference]: Without dead ends: 75 [2020-11-12 00:33:35,563 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:33:35,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-11-12 00:33:35,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2020-11-12 00:33:35,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 64 states have (on average 1.59375) internal successors, (102), 65 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:35,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2020-11-12 00:33:35,567 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 16 [2020-11-12 00:33:35,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:35,568 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2020-11-12 00:33:35,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:35,568 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2020-11-12 00:33:35,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:35,568 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:35,569 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:35,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-12 00:33:35,569 INFO L429 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]=== [2020-11-12 00:33:35,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:35,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1326649610, now seen corresponding path program 11 times [2020-11-12 00:33:35,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:35,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563628982] [2020-11-12 00:33:35,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:35,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:35,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563628982] [2020-11-12 00:33:35,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:35,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:35,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058116923] [2020-11-12 00:33:35,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:35,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:35,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:35,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:35,925 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:36,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:36,368 INFO L93 Difference]: Finished difference Result 87 states and 128 transitions. [2020-11-12 00:33:36,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 00:33:36,369 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:36,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:36,369 INFO L225 Difference]: With dead ends: 87 [2020-11-12 00:33:36,370 INFO L226 Difference]: Without dead ends: 80 [2020-11-12 00:33:36,370 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:36,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-11-12 00:33:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2020-11-12 00:33:36,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 67 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:36,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 105 transitions. [2020-11-12 00:33:36,373 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 105 transitions. Word has length 16 [2020-11-12 00:33:36,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:36,374 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 105 transitions. [2020-11-12 00:33:36,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:36,374 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 105 transitions. [2020-11-12 00:33:36,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:36,374 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:36,374 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:36,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-12 00:33:36,375 INFO L429 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]=== [2020-11-12 00:33:36,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:36,375 INFO L82 PathProgramCache]: Analyzing trace with hash 674117242, now seen corresponding path program 12 times [2020-11-12 00:33:36,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:36,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091990907] [2020-11-12 00:33:36,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:36,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:36,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091990907] [2020-11-12 00:33:36,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:36,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:36,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533197369] [2020-11-12 00:33:36,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:36,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:36,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:36,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:36,614 INFO L87 Difference]: Start difference. First operand 68 states and 105 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:37,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:37,075 INFO L93 Difference]: Finished difference Result 83 states and 121 transitions. [2020-11-12 00:33:37,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:33:37,076 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:37,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:37,076 INFO L225 Difference]: With dead ends: 83 [2020-11-12 00:33:37,076 INFO L226 Difference]: Without dead ends: 64 [2020-11-12 00:33:37,077 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:37,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-12 00:33:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2020-11-12 00:33:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 59 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:37,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2020-11-12 00:33:37,079 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 16 [2020-11-12 00:33:37,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:37,079 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2020-11-12 00:33:37,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:37,079 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2020-11-12 00:33:37,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:37,080 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:37,085 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:37,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-12 00:33:37,085 INFO L429 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]=== [2020-11-12 00:33:37,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:37,086 INFO L82 PathProgramCache]: Analyzing trace with hash -302397320, now seen corresponding path program 13 times [2020-11-12 00:33:37,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:37,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838453935] [2020-11-12 00:33:37,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:37,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838453935] [2020-11-12 00:33:37,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:37,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:37,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076774241] [2020-11-12 00:33:37,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:37,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:37,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:37,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:37,476 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:37,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:37,939 INFO L93 Difference]: Finished difference Result 76 states and 112 transitions. [2020-11-12 00:33:37,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 00:33:37,940 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:37,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:37,941 INFO L225 Difference]: With dead ends: 76 [2020-11-12 00:33:37,941 INFO L226 Difference]: Without dead ends: 76 [2020-11-12 00:33:37,941 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:37,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-11-12 00:33:37,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2020-11-12 00:33:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 69 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 103 transitions. [2020-11-12 00:33:37,944 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 103 transitions. Word has length 16 [2020-11-12 00:33:37,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:37,944 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 103 transitions. [2020-11-12 00:33:37,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:37,944 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 103 transitions. [2020-11-12 00:33:37,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:37,945 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:37,945 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:37,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-12 00:33:37,945 INFO L429 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]=== [2020-11-12 00:33:37,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:37,946 INFO L82 PathProgramCache]: Analyzing trace with hash -302397341, now seen corresponding path program 4 times [2020-11-12 00:33:37,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:37,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513993997] [2020-11-12 00:33:37,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:38,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:38,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513993997] [2020-11-12 00:33:38,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:38,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:33:38,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230740714] [2020-11-12 00:33:38,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:33:38,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:38,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:33:38,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:33:38,083 INFO L87 Difference]: Start difference. First operand 70 states and 103 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:38,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:38,377 INFO L93 Difference]: Finished difference Result 75 states and 109 transitions. [2020-11-12 00:33:38,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-12 00:33:38,378 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:38,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:38,379 INFO L225 Difference]: With dead ends: 75 [2020-11-12 00:33:38,379 INFO L226 Difference]: Without dead ends: 61 [2020-11-12 00:33:38,379 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:33:38,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-11-12 00:33:38,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2020-11-12 00:33:38,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 55 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:38,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2020-11-12 00:33:38,382 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 16 [2020-11-12 00:33:38,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:38,382 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2020-11-12 00:33:38,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:38,382 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2020-11-12 00:33:38,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:38,383 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:38,383 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:38,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-12 00:33:38,383 INFO L429 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]=== [2020-11-12 00:33:38,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:38,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1736428082, now seen corresponding path program 14 times [2020-11-12 00:33:38,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:38,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952173013] [2020-11-12 00:33:38,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:38,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:38,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952173013] [2020-11-12 00:33:38,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:38,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:38,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922753980] [2020-11-12 00:33:38,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:38,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:38,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:38,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:38,694 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:39,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:39,129 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2020-11-12 00:33:39,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 00:33:39,130 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:39,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:39,130 INFO L225 Difference]: With dead ends: 70 [2020-11-12 00:33:39,131 INFO L226 Difference]: Without dead ends: 70 [2020-11-12 00:33:39,131 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-12 00:33:39,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2020-11-12 00:33:39,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 66 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 97 transitions. [2020-11-12 00:33:39,134 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 97 transitions. Word has length 16 [2020-11-12 00:33:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:39,134 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 97 transitions. [2020-11-12 00:33:39,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 97 transitions. [2020-11-12 00:33:39,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:39,135 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:39,135 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:39,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-12 00:33:39,136 INFO L429 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]=== [2020-11-12 00:33:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:39,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1736428103, now seen corresponding path program 5 times [2020-11-12 00:33:39,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:39,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330243286] [2020-11-12 00:33:39,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:39,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330243286] [2020-11-12 00:33:39,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:39,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:33:39,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397574390] [2020-11-12 00:33:39,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:33:39,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:39,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:33:39,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:33:39,373 INFO L87 Difference]: Start difference. First operand 67 states and 97 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:39,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:39,866 INFO L93 Difference]: Finished difference Result 100 states and 139 transitions. [2020-11-12 00:33:39,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-12 00:33:39,867 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:39,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:39,868 INFO L225 Difference]: With dead ends: 100 [2020-11-12 00:33:39,868 INFO L226 Difference]: Without dead ends: 90 [2020-11-12 00:33:39,869 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-11-12 00:33:39,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-11-12 00:33:39,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2020-11-12 00:33:39,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 61 states have (on average 1.540983606557377) internal successors, (94), 62 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:39,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 94 transitions. [2020-11-12 00:33:39,873 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 94 transitions. Word has length 16 [2020-11-12 00:33:39,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:39,873 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 94 transitions. [2020-11-12 00:33:39,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:39,873 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 94 transitions. [2020-11-12 00:33:39,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:39,874 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:39,874 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:39,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-12 00:33:39,874 INFO L429 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]=== [2020-11-12 00:33:39,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:39,875 INFO L82 PathProgramCache]: Analyzing trace with hash 893449784, now seen corresponding path program 15 times [2020-11-12 00:33:39,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:39,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985340925] [2020-11-12 00:33:39,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:40,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:40,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985340925] [2020-11-12 00:33:40,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:40,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:40,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826739368] [2020-11-12 00:33:40,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:40,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:40,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:40,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:40,132 INFO L87 Difference]: Start difference. First operand 63 states and 94 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:40,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:40,549 INFO L93 Difference]: Finished difference Result 75 states and 109 transitions. [2020-11-12 00:33:40,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:33:40,550 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:40,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:40,551 INFO L225 Difference]: With dead ends: 75 [2020-11-12 00:33:40,551 INFO L226 Difference]: Without dead ends: 66 [2020-11-12 00:33:40,551 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-12 00:33:40,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2020-11-12 00:33:40,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 60 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:40,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 91 transitions. [2020-11-12 00:33:40,554 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 91 transitions. Word has length 16 [2020-11-12 00:33:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:40,554 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 91 transitions. [2020-11-12 00:33:40,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 91 transitions. [2020-11-12 00:33:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:40,555 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:40,555 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:40,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-12 00:33:40,555 INFO L429 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]=== [2020-11-12 00:33:40,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:40,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1474950730, now seen corresponding path program 16 times [2020-11-12 00:33:40,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:40,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440477800] [2020-11-12 00:33:40,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:40,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440477800] [2020-11-12 00:33:40,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:40,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:40,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693030324] [2020-11-12 00:33:40,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:40,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:40,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:40,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:40,826 INFO L87 Difference]: Start difference. First operand 61 states and 91 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:41,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:41,220 INFO L93 Difference]: Finished difference Result 69 states and 98 transitions. [2020-11-12 00:33:41,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:33:41,221 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:41,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:41,222 INFO L225 Difference]: With dead ends: 69 [2020-11-12 00:33:41,222 INFO L226 Difference]: Without dead ends: 59 [2020-11-12 00:33:41,222 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:41,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-12 00:33:41,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2020-11-12 00:33:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.509090909090909) internal successors, (83), 56 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2020-11-12 00:33:41,225 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 16 [2020-11-12 00:33:41,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:41,225 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2020-11-12 00:33:41,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2020-11-12 00:33:41,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:41,226 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:41,226 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:41,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-12 00:33:41,226 INFO L429 AbstractCegarLoop]: === Iteration 28 === [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]=== [2020-11-12 00:33:41,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:41,227 INFO L82 PathProgramCache]: Analyzing trace with hash -190138700, now seen corresponding path program 17 times [2020-11-12 00:33:41,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:41,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606089695] [2020-11-12 00:33:41,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:41,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606089695] [2020-11-12 00:33:41,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:41,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:41,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357308924] [2020-11-12 00:33:41,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:41,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:41,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:41,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:41,520 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:41,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:41,929 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2020-11-12 00:33:41,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:33:41,930 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:41,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:41,930 INFO L225 Difference]: With dead ends: 64 [2020-11-12 00:33:41,930 INFO L226 Difference]: Without dead ends: 56 [2020-11-12 00:33:41,931 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-11-12 00:33:41,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-11-12 00:33:41,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.5) internal successors, (81), 55 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:41,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2020-11-12 00:33:41,933 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 16 [2020-11-12 00:33:41,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:41,933 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2020-11-12 00:33:41,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:41,934 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2020-11-12 00:33:41,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:41,934 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:41,934 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:41,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-12 00:33:41,934 INFO L429 AbstractCegarLoop]: === Iteration 29 === [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]=== [2020-11-12 00:33:41,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:41,935 INFO L82 PathProgramCache]: Analyzing trace with hash 657987258, now seen corresponding path program 18 times [2020-11-12 00:33:41,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:41,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948969457] [2020-11-12 00:33:41,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:42,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:42,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948969457] [2020-11-12 00:33:42,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:42,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:42,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161999984] [2020-11-12 00:33:42,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:42,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:42,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:42,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:42,203 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:42,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:42,587 INFO L93 Difference]: Finished difference Result 64 states and 88 transitions. [2020-11-12 00:33:42,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:33:42,588 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:42,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:42,589 INFO L225 Difference]: With dead ends: 64 [2020-11-12 00:33:42,589 INFO L226 Difference]: Without dead ends: 54 [2020-11-12 00:33:42,589 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-12 00:33:42,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-11-12 00:33:42,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2020-11-12 00:33:42,592 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 16 [2020-11-12 00:33:42,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:42,592 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2020-11-12 00:33:42,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:42,592 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2020-11-12 00:33:42,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:42,593 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:42,593 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:42,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-12 00:33:42,593 INFO L429 AbstractCegarLoop]: === Iteration 30 === [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]=== [2020-11-12 00:33:42,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:42,594 INFO L82 PathProgramCache]: Analyzing trace with hash -695280516, now seen corresponding path program 19 times [2020-11-12 00:33:42,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:42,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383333567] [2020-11-12 00:33:42,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:42,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383333567] [2020-11-12 00:33:42,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:42,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:42,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953187696] [2020-11-12 00:33:42,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:42,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:42,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:42,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:42,880 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:43,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:43,326 INFO L93 Difference]: Finished difference Result 69 states and 96 transitions. [2020-11-12 00:33:43,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 00:33:43,327 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:43,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:43,328 INFO L225 Difference]: With dead ends: 69 [2020-11-12 00:33:43,328 INFO L226 Difference]: Without dead ends: 69 [2020-11-12 00:33:43,328 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:43,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-12 00:33:43,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2020-11-12 00:33:43,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 64 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2020-11-12 00:33:43,332 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 16 [2020-11-12 00:33:43,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:43,332 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2020-11-12 00:33:43,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:43,332 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2020-11-12 00:33:43,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:43,333 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:43,333 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:43,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-12 00:33:43,334 INFO L429 AbstractCegarLoop]: === Iteration 31 === [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]=== [2020-11-12 00:33:43,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:43,334 INFO L82 PathProgramCache]: Analyzing trace with hash -695280537, now seen corresponding path program 6 times [2020-11-12 00:33:43,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:43,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580303491] [2020-11-12 00:33:43,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:43,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580303491] [2020-11-12 00:33:43,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:43,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:43,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569587486] [2020-11-12 00:33:43,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:43,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:43,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:43,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:43,632 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:43,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:43,957 INFO L93 Difference]: Finished difference Result 79 states and 106 transitions. [2020-11-12 00:33:43,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:33:43,958 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:43,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:43,959 INFO L225 Difference]: With dead ends: 79 [2020-11-12 00:33:43,960 INFO L226 Difference]: Without dead ends: 69 [2020-11-12 00:33:43,960 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-11-12 00:33:43,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-12 00:33:43,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2020-11-12 00:33:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.490566037735849) internal successors, (79), 54 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2020-11-12 00:33:43,963 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 16 [2020-11-12 00:33:43,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:43,963 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2020-11-12 00:33:43,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:43,963 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2020-11-12 00:33:43,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:43,964 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:43,964 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:43,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-12 00:33:43,964 INFO L429 AbstractCegarLoop]: === Iteration 32 === [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]=== [2020-11-12 00:33:43,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:43,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1934597350, now seen corresponding path program 20 times [2020-11-12 00:33:43,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:43,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062157532] [2020-11-12 00:33:43,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:44,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062157532] [2020-11-12 00:33:44,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:44,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:44,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500208909] [2020-11-12 00:33:44,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:44,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:44,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:44,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:44,278 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:44,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:44,766 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2020-11-12 00:33:44,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:33:44,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:44,767 INFO L225 Difference]: With dead ends: 62 [2020-11-12 00:33:44,768 INFO L226 Difference]: Without dead ends: 54 [2020-11-12 00:33:44,768 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:44,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-12 00:33:44,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-11-12 00:33:44,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:44,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2020-11-12 00:33:44,770 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 16 [2020-11-12 00:33:44,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:44,771 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2020-11-12 00:33:44,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:44,771 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2020-11-12 00:33:44,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:44,771 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:44,772 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:44,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-12 00:33:44,772 INFO L429 AbstractCegarLoop]: === Iteration 33 === [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]=== [2020-11-12 00:33:44,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:44,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1512243988, now seen corresponding path program 21 times [2020-11-12 00:33:44,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:44,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053962594] [2020-11-12 00:33:44,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:45,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:45,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053962594] [2020-11-12 00:33:45,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:45,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:45,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455961574] [2020-11-12 00:33:45,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:45,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:45,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:45,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:45,116 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:45,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:45,539 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2020-11-12 00:33:45,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:33:45,540 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:45,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:45,541 INFO L225 Difference]: With dead ends: 63 [2020-11-12 00:33:45,541 INFO L226 Difference]: Without dead ends: 54 [2020-11-12 00:33:45,541 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:45,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-12 00:33:45,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2020-11-12 00:33:45,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:45,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2020-11-12 00:33:45,545 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 16 [2020-11-12 00:33:45,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:45,545 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2020-11-12 00:33:45,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:45,545 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2020-11-12 00:33:45,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:45,545 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:45,545 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:45,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-12 00:33:45,546 INFO L429 AbstractCegarLoop]: === Iteration 34 === [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]=== [2020-11-12 00:33:45,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:45,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1980868494, now seen corresponding path program 22 times [2020-11-12 00:33:45,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:45,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894181481] [2020-11-12 00:33:45,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:45,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894181481] [2020-11-12 00:33:45,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:45,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:45,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969069107] [2020-11-12 00:33:45,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:45,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:45,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:45,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:45,822 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:46,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:46,323 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2020-11-12 00:33:46,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 00:33:46,324 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:46,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:46,324 INFO L225 Difference]: With dead ends: 64 [2020-11-12 00:33:46,325 INFO L226 Difference]: Without dead ends: 64 [2020-11-12 00:33:46,325 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:46,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-12 00:33:46,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2020-11-12 00:33:46,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:46,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2020-11-12 00:33:46,328 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 16 [2020-11-12 00:33:46,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:46,329 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2020-11-12 00:33:46,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2020-11-12 00:33:46,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:46,330 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:46,331 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:46,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-12 00:33:46,331 INFO L429 AbstractCegarLoop]: === Iteration 35 === [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]=== [2020-11-12 00:33:46,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:46,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1980868473, now seen corresponding path program 7 times [2020-11-12 00:33:46,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:46,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308710898] [2020-11-12 00:33:46,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:46,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308710898] [2020-11-12 00:33:46,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:46,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:46,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497168911] [2020-11-12 00:33:46,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:46,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:46,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:46,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:46,661 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:47,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:47,096 INFO L93 Difference]: Finished difference Result 61 states and 84 transitions. [2020-11-12 00:33:47,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-12 00:33:47,096 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:47,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:47,097 INFO L225 Difference]: With dead ends: 61 [2020-11-12 00:33:47,097 INFO L226 Difference]: Without dead ends: 51 [2020-11-12 00:33:47,097 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-12 00:33:47,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-11-12 00:33:47,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2020-11-12 00:33:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2020-11-12 00:33:47,099 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 16 [2020-11-12 00:33:47,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:47,099 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2020-11-12 00:33:47,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2020-11-12 00:33:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:47,099 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:47,100 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:47,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-12 00:33:47,100 INFO L429 AbstractCegarLoop]: === Iteration 36 === [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]=== [2020-11-12 00:33:47,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:47,101 INFO L82 PathProgramCache]: Analyzing trace with hash 315779064, now seen corresponding path program 23 times [2020-11-12 00:33:47,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:47,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412499202] [2020-11-12 00:33:47,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:47,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412499202] [2020-11-12 00:33:47,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:47,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:47,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369303504] [2020-11-12 00:33:47,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:47,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:47,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:47,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:47,381 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:47,807 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2020-11-12 00:33:47,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:33:47,808 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:47,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:47,808 INFO L225 Difference]: With dead ends: 43 [2020-11-12 00:33:47,808 INFO L226 Difference]: Without dead ends: 35 [2020-11-12 00:33:47,809 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:47,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-11-12 00:33:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-11-12 00:33:47,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:47,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 51 transitions. [2020-11-12 00:33:47,811 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 51 transitions. Word has length 16 [2020-11-12 00:33:47,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:47,811 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 51 transitions. [2020-11-12 00:33:47,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:47,811 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 51 transitions. [2020-11-12 00:33:47,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:47,812 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:47,812 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:47,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-12 00:33:47,812 INFO L429 AbstractCegarLoop]: === Iteration 37 === [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]=== [2020-11-12 00:33:47,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:47,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1067765730, now seen corresponding path program 24 times [2020-11-12 00:33:47,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:47,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705195611] [2020-11-12 00:33:47,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:48,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:48,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705195611] [2020-11-12 00:33:48,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:48,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:48,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690826550] [2020-11-12 00:33:48,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:48,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:48,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:48,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:48,064 INFO L87 Difference]: Start difference. First operand 35 states and 51 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:48,484 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2020-11-12 00:33:48,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 00:33:48,485 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:48,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:48,485 INFO L225 Difference]: With dead ends: 49 [2020-11-12 00:33:48,485 INFO L226 Difference]: Without dead ends: 36 [2020-11-12 00:33:48,486 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:48,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-11-12 00:33:48,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2020-11-12 00:33:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2020-11-12 00:33:48,487 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2020-11-12 00:33:48,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:48,487 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2020-11-12 00:33:48,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:48,487 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2020-11-12 00:33:48,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:48,487 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:48,488 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:48,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-12 00:33:48,488 INFO L429 AbstractCegarLoop]: === Iteration 38 === [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]=== [2020-11-12 00:33:48,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:48,488 INFO L82 PathProgramCache]: Analyzing trace with hash 909579768, now seen corresponding path program 25 times [2020-11-12 00:33:48,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:48,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703291428] [2020-11-12 00:33:48,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:48,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703291428] [2020-11-12 00:33:48,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:48,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:48,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008240214] [2020-11-12 00:33:48,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:48,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:48,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:48,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:48,751 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:49,162 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2020-11-12 00:33:49,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:33:49,163 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:49,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:49,164 INFO L225 Difference]: With dead ends: 42 [2020-11-12 00:33:49,164 INFO L226 Difference]: Without dead ends: 29 [2020-11-12 00:33:49,164 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:49,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-11-12 00:33:49,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-11-12 00:33:49,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:49,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2020-11-12 00:33:49,165 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 16 [2020-11-12 00:33:49,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:49,166 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2020-11-12 00:33:49,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:49,166 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2020-11-12 00:33:49,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:49,166 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:49,166 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:49,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-11-12 00:33:49,167 INFO L429 AbstractCegarLoop]: === Iteration 39 === [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]=== [2020-11-12 00:33:49,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:49,167 INFO L82 PathProgramCache]: Analyzing trace with hash -273788244, now seen corresponding path program 26 times [2020-11-12 00:33:49,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:49,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53483512] [2020-11-12 00:33:49,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:49,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53483512] [2020-11-12 00:33:49,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:49,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:49,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595818100] [2020-11-12 00:33:49,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:49,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:49,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:49,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:49,495 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:49,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:49,872 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2020-11-12 00:33:49,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 00:33:49,872 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:49,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:49,873 INFO L225 Difference]: With dead ends: 43 [2020-11-12 00:33:49,873 INFO L226 Difference]: Without dead ends: 36 [2020-11-12 00:33:49,874 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:49,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-11-12 00:33:49,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2020-11-12 00:33:49,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:49,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2020-11-12 00:33:49,876 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 16 [2020-11-12 00:33:49,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:49,876 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2020-11-12 00:33:49,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:49,877 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2020-11-12 00:33:49,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:49,877 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:49,877 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:49,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-12 00:33:49,877 INFO L429 AbstractCegarLoop]: === Iteration 40 === [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]=== [2020-11-12 00:33:49,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:49,878 INFO L82 PathProgramCache]: Analyzing trace with hash -926320612, now seen corresponding path program 27 times [2020-11-12 00:33:49,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:49,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159416738] [2020-11-12 00:33:49,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:50,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159416738] [2020-11-12 00:33:50,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:50,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:50,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762963343] [2020-11-12 00:33:50,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:50,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:50,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:50,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:50,156 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:50,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:50,499 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2020-11-12 00:33:50,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:33:50,500 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:50,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:50,500 INFO L225 Difference]: With dead ends: 42 [2020-11-12 00:33:50,500 INFO L226 Difference]: Without dead ends: 27 [2020-11-12 00:33:50,501 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:50,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-11-12 00:33:50,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-11-12 00:33:50,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2020-11-12 00:33:50,502 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 16 [2020-11-12 00:33:50,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:50,502 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-11-12 00:33:50,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:50,503 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2020-11-12 00:33:50,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:50,503 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:50,503 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:50,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-11-12 00:33:50,505 INFO L429 AbstractCegarLoop]: === Iteration 41 === [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]=== [2020-11-12 00:33:50,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:50,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1686005944, now seen corresponding path program 28 times [2020-11-12 00:33:50,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:50,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577534179] [2020-11-12 00:33:50,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:50,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577534179] [2020-11-12 00:33:50,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:50,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:50,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329216533] [2020-11-12 00:33:50,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:50,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:50,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:50,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:50,788 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:51,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:51,120 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-11-12 00:33:51,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:33:51,121 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:51,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:51,121 INFO L225 Difference]: With dead ends: 34 [2020-11-12 00:33:51,121 INFO L226 Difference]: Without dead ends: 26 [2020-11-12 00:33:51,122 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:51,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-11-12 00:33:51,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-11-12 00:33:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2020-11-12 00:33:51,123 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 16 [2020-11-12 00:33:51,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:51,123 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2020-11-12 00:33:51,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2020-11-12 00:33:51,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:51,124 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:51,124 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:51,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-11-12 00:33:51,124 INFO L429 AbstractCegarLoop]: === Iteration 42 === [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]=== [2020-11-12 00:33:51,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:51,124 INFO L82 PathProgramCache]: Analyzing trace with hash 248312678, now seen corresponding path program 29 times [2020-11-12 00:33:51,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:51,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349618951] [2020-11-12 00:33:51,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:51,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:51,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349618951] [2020-11-12 00:33:51,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:51,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:51,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617069647] [2020-11-12 00:33:51,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:51,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:51,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:51,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:51,479 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:51,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:51,828 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-11-12 00:33:51,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 00:33:51,828 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:51,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:51,829 INFO L225 Difference]: With dead ends: 31 [2020-11-12 00:33:51,829 INFO L226 Difference]: Without dead ends: 24 [2020-11-12 00:33:51,829 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:51,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-11-12 00:33:51,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-11-12 00:33:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:51,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-11-12 00:33:51,831 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2020-11-12 00:33:51,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:51,832 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-11-12 00:33:51,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:51,832 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-11-12 00:33:51,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:33:51,832 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:51,832 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:33:51,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-11-12 00:33:51,832 INFO L429 AbstractCegarLoop]: === Iteration 43 === [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]=== [2020-11-12 00:33:51,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:51,833 INFO L82 PathProgramCache]: Analyzing trace with hash -404219690, now seen corresponding path program 30 times [2020-11-12 00:33:51,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:51,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474888512] [2020-11-12 00:33:51,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:52,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474888512] [2020-11-12 00:33:52,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:52,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:33:52,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387577421] [2020-11-12 00:33:52,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:33:52,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:52,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:33:52,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:33:52,108 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:52,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:52,375 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2020-11-12 00:33:52,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:33:52,376 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:33:52,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:52,376 INFO L225 Difference]: With dead ends: 23 [2020-11-12 00:33:52,376 INFO L226 Difference]: Without dead ends: 0 [2020-11-12 00:33:52,377 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:33:52,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-12 00:33:52,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-12 00:33:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-12 00:33:52,377 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2020-11-12 00:33:52,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:52,378 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-12 00:33:52,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:52,378 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-12 00:33:52,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-12 00:33:52,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-11-12 00:33:52,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:33:52 BasicIcfg [2020-11-12 00:33:52,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-12 00:33:52,383 INFO L168 Benchmark]: Toolchain (without parser) took 95423.76 ms. Allocated memory was 302.0 MB in the beginning and 469.8 MB in the end (delta: 167.8 MB). Free memory was 275.3 MB in the beginning and 294.0 MB in the end (delta: -18.7 MB). Peak memory consumption was 150.4 MB. Max. memory is 16.0 GB. [2020-11-12 00:33:52,384 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 302.0 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2020-11-12 00:33:52,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1286.39 ms. Allocated memory is still 302.0 MB. Free memory was 274.7 MB in the beginning and 173.6 MB in the end (delta: 101.1 MB). Peak memory consumption was 104.0 MB. Max. memory is 16.0 GB. [2020-11-12 00:33:52,384 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.12 ms. Allocated memory is still 302.0 MB. Free memory was 173.6 MB in the beginning and 170.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-12 00:33:52,385 INFO L168 Benchmark]: Boogie Preprocessor took 57.16 ms. Allocated memory is still 302.0 MB. Free memory was 170.5 MB in the beginning and 167.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2020-11-12 00:33:52,385 INFO L168 Benchmark]: RCFGBuilder took 1031.99 ms. Allocated memory was 302.0 MB in the beginning and 377.5 MB in the end (delta: 75.5 MB). Free memory was 167.3 MB in the beginning and 327.3 MB in the end (delta: -160.0 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.0 GB. [2020-11-12 00:33:52,385 INFO L168 Benchmark]: TraceAbstraction took 92943.50 ms. Allocated memory was 377.5 MB in the beginning and 469.8 MB in the end (delta: 92.3 MB). Free memory was 326.2 MB in the beginning and 294.0 MB in the end (delta: 32.2 MB). Peak memory consumption was 123.5 MB. Max. memory is 16.0 GB. [2020-11-12 00:33:52,387 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 302.0 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 1286.39 ms. Allocated memory is still 302.0 MB. Free memory was 274.7 MB in the beginning and 173.6 MB in the end (delta: 101.1 MB). Peak memory consumption was 104.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 90.12 ms. Allocated memory is still 302.0 MB. Free memory was 173.6 MB in the beginning and 170.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 57.16 ms. Allocated memory is still 302.0 MB. Free memory was 170.5 MB in the beginning and 167.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1031.99 ms. Allocated memory was 302.0 MB in the beginning and 377.5 MB in the end (delta: 75.5 MB). Free memory was 167.3 MB in the beginning and 327.3 MB in the end (delta: -160.0 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 92943.50 ms. Allocated memory was 377.5 MB in the beginning and 469.8 MB in the end (delta: 92.3 MB). Free memory was 326.2 MB in the beginning and 294.0 MB in the end (delta: 32.2 MB). Peak memory consumption was 123.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1270 VarBasedMoverChecksPositive, 39 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 20 SemBasedMoverChecksNegative, 15 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 34.0s, 33 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 63.1s, 168 PlacesBefore, 35 PlacesAfterwards, 178 TransitionsBefore, 34 TransitionsAfterwards, 1872 CoEnabledTransitionPairs, 9 FixpointIterations, 109 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 27 ConcurrentYvCompositions, 11 ChoiceCompositions, 228 TotalNumberOfCompositions, 3542 MoverChecksTotal - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: 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, 153 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 92.8s, OverallIterations: 43, TraceHistogramMax: 1, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 63.2s, HoareTripleCheckerStatistics: 651 SDtfs, 686 SDslu, 2215 SDs, 0 SdLazy, 5327 SolverSat, 686 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 25 SyntacticMatches, 17 SemanticMatches, 432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred 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, 43 MinimizatonAttempts, 325 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 644 NumberOfCodeBlocks, 644 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 601 ConstructedInterpolants, 0 QuantifiedInterpolants, 184469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...