/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 22:33:02,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 22:33:02,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 22:33:02,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 22:33:02,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 22:33:02,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 22:33:02,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 22:33:02,777 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 22:33:02,780 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 22:33:02,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 22:33:02,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 22:33:02,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 22:33:02,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 22:33:02,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 22:33:02,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 22:33:02,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 22:33:02,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 22:33:02,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 22:33:02,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 22:33:02,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 22:33:02,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 22:33:02,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 22:33:02,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 22:33:02,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 22:33:02,821 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 22:33:02,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 22:33:02,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 22:33:02,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 22:33:02,825 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 22:33:02,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 22:33:02,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 22:33:02,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 22:33:02,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 22:33:02,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 22:33:02,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 22:33:02,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 22:33:02,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 22:33:02,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 22:33:02,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 22:33:02,840 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 22:33:02,841 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 22:33:02,841 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-10-15 22:33:02,876 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 22:33:02,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 22:33:02,878 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 22:33:02,878 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 22:33:02,878 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 22:33:02,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 22:33:02,879 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 22:33:02,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 22:33:02,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 22:33:02,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 22:33:02,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 22:33:02,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 22:33:02,880 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 22:33:02,880 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 22:33:02,880 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 22:33:02,880 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 22:33:02,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 22:33:02,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 22:33:02,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 22:33:02,881 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 22:33:02,881 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 22:33:02,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 22:33:02,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 22:33:02,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 22:33:02,882 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 22:33:02,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 22:33:02,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 22:33:02,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 22:33:02,883 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 22:33:03,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 22:33:03,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 22:33:03,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 22:33:03,213 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 22:33:03,213 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 22:33:03,214 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-10-15 22:33:03,296 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51b5e3d0c/e632813db5624c18bd039ca2f50f3abb/FLAGfe2c00c9a [2020-10-15 22:33:03,886 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 22:33:03,886 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-10-15 22:33:03,910 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51b5e3d0c/e632813db5624c18bd039ca2f50f3abb/FLAGfe2c00c9a [2020-10-15 22:33:04,122 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51b5e3d0c/e632813db5624c18bd039ca2f50f3abb [2020-10-15 22:33:04,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 22:33:04,132 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 22:33:04,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 22:33:04,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 22:33:04,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 22:33:04,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:33:04" (1/1) ... [2020-10-15 22:33:04,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b5cf630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:04, skipping insertion in model container [2020-10-15 22:33:04,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:33:04" (1/1) ... [2020-10-15 22:33:04,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 22:33:04,220 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 22:33:05,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:33:05,038 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 22:33:05,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:33:05,493 INFO L208 MainTranslator]: Completed translation [2020-10-15 22:33:05,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:05 WrapperNode [2020-10-15 22:33:05,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 22:33:05,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 22:33:05,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 22:33:05,495 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 22:33:05,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:05" (1/1) ... [2020-10-15 22:33:05,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:05" (1/1) ... [2020-10-15 22:33:05,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 22:33:05,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 22:33:05,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 22:33:05,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 22:33:05,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:05" (1/1) ... [2020-10-15 22:33:05,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:05" (1/1) ... [2020-10-15 22:33:05,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:05" (1/1) ... [2020-10-15 22:33:05,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:05" (1/1) ... [2020-10-15 22:33:05,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:05" (1/1) ... [2020-10-15 22:33:05,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:05" (1/1) ... [2020-10-15 22:33:05,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:05" (1/1) ... [2020-10-15 22:33:05,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 22:33:05,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 22:33:05,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 22:33:05,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 22:33:05,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:05" (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-10-15 22:33:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 22:33:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-15 22:33:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-15 22:33:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-15 22:33:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 22:33:05,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 22:33:05,708 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-15 22:33:05,708 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-15 22:33:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 22:33:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 22:33:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-15 22:33:05,716 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 22:33:06,333 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 22:33:06,333 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-15 22:33:06,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:33:06 BoogieIcfgContainer [2020-10-15 22:33:06,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 22:33:06,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 22:33:06,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 22:33:06,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 22:33:06,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 10:33:04" (1/3) ... [2020-10-15 22:33:06,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26155f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:33:06, skipping insertion in model container [2020-10-15 22:33:06,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:05" (2/3) ... [2020-10-15 22:33:06,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26155f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:33:06, skipping insertion in model container [2020-10-15 22:33:06,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:33:06" (3/3) ... [2020-10-15 22:33:06,344 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2020-10-15 22:33:06,356 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 22:33:06,356 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 22:33:06,364 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-15 22:33:06,365 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 22:33:06,396 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,397 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,397 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,397 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,397 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,398 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,398 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,398 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,398 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,398 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,398 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,399 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,399 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,399 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,399 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,400 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,400 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,400 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,400 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,400 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,401 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,401 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,401 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,401 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,402 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,402 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,402 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,402 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,402 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,403 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,403 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,403 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,403 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,404 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,404 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,404 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,404 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,404 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,404 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,405 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,405 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,405 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,406 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,406 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,406 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,406 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,406 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,407 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,407 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,407 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,407 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,407 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,408 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,408 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,408 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,408 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,409 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,409 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,412 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,413 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,413 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,413 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,413 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,414 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,414 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,414 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,414 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,414 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,420 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,420 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,420 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,421 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,421 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,421 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,421 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,421 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,422 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,422 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:06,448 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-15 22:33:06,470 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 22:33:06,470 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 22:33:06,470 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 22:33:06,470 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 22:33:06,470 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 22:33:06,470 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 22:33:06,471 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 22:33:06,471 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 22:33:06,488 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 22:33:06,491 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 154 transitions, 330 flow [2020-10-15 22:33:06,494 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 154 transitions, 330 flow [2020-10-15 22:33:06,496 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions, 330 flow [2020-10-15 22:33:06,577 INFO L129 PetriNetUnfolder]: 11/192 cut-off events. [2020-10-15 22:33:06,577 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-15 22:33:06,586 INFO L80 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2020-10-15 22:33:06,594 INFO L117 LiptonReduction]: Number of co-enabled transitions 2652 [2020-10-15 22:33:06,843 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:06,869 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:06,875 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:06,896 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:06,898 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:06,900 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-15 22:33:06,916 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:06,940 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:06,945 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:06,966 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:06,967 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:06,968 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 22:33:09,241 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:09,270 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:09,277 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:09,299 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:09,301 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:09,301 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-15 22:33:09,320 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:09,351 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:09,357 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:09,380 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:09,382 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:09,383 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 22:33:11,446 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:11,477 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:11,482 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:11,504 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:11,506 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:11,507 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-15 22:33:11,531 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:11,557 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:11,562 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:11,583 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:11,585 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:11,585 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-15 22:33:13,644 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:13,682 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:13,687 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:13,706 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:13,708 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:13,708 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 22:33:13,720 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:13,744 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:13,749 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:13,769 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:13,771 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:13,771 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 22:33:15,982 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:16,005 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:16,010 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:16,038 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:16,039 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:16,040 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 22:33:16,052 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:16,076 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:16,080 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:16,101 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:16,102 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:16,103 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-15 22:33:18,428 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:18,448 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:18,452 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:18,468 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:18,470 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:18,471 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 22:33:18,482 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:18,502 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:18,508 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:18,524 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:18,526 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:18,527 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 22:33:20,743 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:20,776 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:20,779 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:20,798 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:20,799 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:20,800 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:78 [2020-10-15 22:33:20,838 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:20,866 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:20,871 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:20,890 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:20,891 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:20,892 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 22:33:20,915 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:20,943 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:20,947 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:20,971 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:20,973 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:20,973 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-15 22:33:23,053 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:23,082 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:23,086 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:23,104 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:23,105 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:23,105 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-15 22:33:23,119 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:23,142 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:23,145 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:23,163 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:23,164 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:23,165 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 22:33:25,184 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:25,206 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:25,209 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:25,228 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:25,229 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:25,230 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 22:33:25,239 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:25,272 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:25,276 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:25,300 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:25,301 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:25,302 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 22:33:27,391 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:27,422 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:27,427 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:27,452 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:27,453 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:27,453 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 22:33:27,471 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:27,501 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:27,505 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:27,531 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:27,532 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:27,532 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-15 22:33:29,557 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:29,580 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:29,585 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:29,604 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:29,605 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:29,606 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 22:33:29,615 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:29,650 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:29,654 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:29,680 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:29,681 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:29,683 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 22:33:32,027 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:32,047 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:32,050 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:32,066 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:32,067 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:32,068 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-15 22:33:32,080 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:32,101 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:32,104 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:32,118 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:32,119 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:32,119 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-10-15 22:33:34,135 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:34,161 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:34,164 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:34,194 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:34,195 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:34,195 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 22:33:34,210 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:34,238 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:34,242 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:34,264 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:34,265 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:34,265 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 22:33:36,516 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:36,548 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:36,551 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:36,572 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:36,573 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:36,574 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 22:33:36,598 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:36,619 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:36,624 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:36,647 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:36,649 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:36,649 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 22:33:38,984 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:39,003 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:39,007 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:39,021 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:39,023 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:39,023 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 22:33:39,039 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:39,062 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:39,066 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:39,090 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:39,091 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:39,092 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 22:33:41,229 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:41,267 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:41,276 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:41,293 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:41,294 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:41,295 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-10-15 22:33:41,317 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:41,337 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:41,341 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:41,355 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:41,356 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:41,356 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-15 22:33:43,377 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:43,402 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:43,406 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:43,424 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:43,425 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:43,425 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 22:33:43,442 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:43,471 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:43,475 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:43,493 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:43,494 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:43,494 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 22:33:45,630 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:45,658 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:45,663 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:45,680 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:45,681 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:45,681 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 22:33:45,694 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:45,715 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:45,718 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:45,739 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:45,740 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:45,740 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-15 22:33:47,805 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:47,830 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:47,833 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:47,852 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:47,853 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:47,853 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-15 22:33:47,860 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:47,889 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:47,892 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:47,908 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:47,909 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:47,909 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 22:33:49,988 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:50,008 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:50,011 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:50,028 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:50,028 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:50,029 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-15 22:33:50,037 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:50,058 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:50,061 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:50,078 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:50,079 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:50,079 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-15 22:33:52,273 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:52,296 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:52,300 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:52,321 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:52,321 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:52,322 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-15 22:33:52,333 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:52,359 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:52,364 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:52,379 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:52,380 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:52,380 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-15 22:33:54,537 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:54,561 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:54,564 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:54,582 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:54,583 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:54,583 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2020-10-15 22:33:54,608 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:54,639 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:54,643 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:54,667 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:54,668 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:54,669 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 22:33:54,679 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:54,711 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:54,715 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:54,743 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:54,744 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:54,744 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-15 22:33:56,761 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:56,784 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:56,787 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:56,813 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:56,814 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:56,814 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 22:33:56,822 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:56,846 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:56,851 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:56,869 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:56,869 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:56,870 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-15 22:33:58,882 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:58,903 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:58,909 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:58,934 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:58,935 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:58,936 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-15 22:33:58,956 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:58,977 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:58,980 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:58,995 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:58,996 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 22:33:58,996 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 22:34:02,503 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2020-10-15 22:34:02,611 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-15 22:34:03,004 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2020-10-15 22:34:03,017 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:34:03,155 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-15 22:34:03,156 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:34:03,161 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 22:34:03,312 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-15 22:34:03,312 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:34:03,313 INFO L545 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-10-15 22:34:03,313 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:187, output treesize:199 [2020-10-15 22:34:03,492 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-15 22:34:04,710 WARN L193 SmtUtils]: Spent 990.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-10-15 22:34:05,136 WARN L193 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-15 22:34:05,649 WARN L193 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-10-15 22:34:05,873 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-15 22:34:05,888 INFO L132 LiptonReduction]: Checked pairs total: 6338 [2020-10-15 22:34:05,888 INFO L134 LiptonReduction]: Total number of compositions: 174 [2020-10-15 22:34:05,895 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 38 transitions, 98 flow [2020-10-15 22:34:05,925 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 388 states. [2020-10-15 22:34:05,927 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states. [2020-10-15 22:34:05,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-15 22:34:05,933 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:05,934 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-10-15 22:34:05,934 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-10-15 22:34:05,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:05,940 INFO L82 PathProgramCache]: Analyzing trace with hash 560, now seen corresponding path program 1 times [2020-10-15 22:34:05,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:05,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674118426] [2020-10-15 22:34:05,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:06,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:06,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674118426] [2020-10-15 22:34:06,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:06,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-15 22:34:06,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472193572] [2020-10-15 22:34:06,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-15 22:34:06,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:06,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-15 22:34:06,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-15 22:34:06,211 INFO L87 Difference]: Start difference. First operand 388 states. Second operand 2 states. [2020-10-15 22:34:06,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:06,244 INFO L93 Difference]: Finished difference Result 386 states and 932 transitions. [2020-10-15 22:34:06,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-15 22:34:06,245 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-15 22:34:06,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:06,261 INFO L225 Difference]: With dead ends: 386 [2020-10-15 22:34:06,261 INFO L226 Difference]: Without dead ends: 348 [2020-10-15 22:34:06,263 INFO L677 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-10-15 22:34:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2020-10-15 22:34:06,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2020-10-15 22:34:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-10-15 22:34:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 834 transitions. [2020-10-15 22:34:06,335 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 834 transitions. Word has length 1 [2020-10-15 22:34:06,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:06,336 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 834 transitions. [2020-10-15 22:34:06,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-15 22:34:06,336 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 834 transitions. [2020-10-15 22:34:06,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-15 22:34:06,337 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:06,337 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-15 22:34:06,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 22:34:06,338 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-10-15 22:34:06,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:06,338 INFO L82 PathProgramCache]: Analyzing trace with hash 17264254, now seen corresponding path program 1 times [2020-10-15 22:34:06,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:06,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17588067] [2020-10-15 22:34:06,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:06,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17588067] [2020-10-15 22:34:06,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:06,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 22:34:06,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621214879] [2020-10-15 22:34:06,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:34:06,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:06,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:34:06,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:34:06,537 INFO L87 Difference]: Start difference. First operand 348 states and 834 transitions. Second operand 3 states. [2020-10-15 22:34:06,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:06,659 INFO L93 Difference]: Finished difference Result 471 states and 1125 transitions. [2020-10-15 22:34:06,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:34:06,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-15 22:34:06,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:06,667 INFO L225 Difference]: With dead ends: 471 [2020-10-15 22:34:06,667 INFO L226 Difference]: Without dead ends: 471 [2020-10-15 22:34:06,668 INFO L677 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-10-15 22:34:06,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2020-10-15 22:34:06,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 407. [2020-10-15 22:34:06,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-10-15 22:34:06,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 989 transitions. [2020-10-15 22:34:06,702 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 989 transitions. Word has length 4 [2020-10-15 22:34:06,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:06,702 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 989 transitions. [2020-10-15 22:34:06,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:34:06,702 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 989 transitions. [2020-10-15 22:34:06,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-15 22:34:06,703 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:06,703 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-15 22:34:06,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 22:34:06,703 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-10-15 22:34:06,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:06,704 INFO L82 PathProgramCache]: Analyzing trace with hash 535191473, now seen corresponding path program 1 times [2020-10-15 22:34:06,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:06,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153518926] [2020-10-15 22:34:06,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:06,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:06,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153518926] [2020-10-15 22:34:06,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:06,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 22:34:06,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573097056] [2020-10-15 22:34:06,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:34:06,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:06,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:34:06,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:34:06,806 INFO L87 Difference]: Start difference. First operand 407 states and 989 transitions. Second operand 3 states. [2020-10-15 22:34:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:06,897 INFO L93 Difference]: Finished difference Result 498 states and 1196 transitions. [2020-10-15 22:34:06,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:34:06,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-15 22:34:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:06,901 INFO L225 Difference]: With dead ends: 498 [2020-10-15 22:34:06,901 INFO L226 Difference]: Without dead ends: 482 [2020-10-15 22:34:06,902 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:34:06,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-10-15 22:34:06,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 450. [2020-10-15 22:34:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-15 22:34:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1111 transitions. [2020-10-15 22:34:06,925 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1111 transitions. Word has length 5 [2020-10-15 22:34:06,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:06,925 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1111 transitions. [2020-10-15 22:34:06,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:34:06,925 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1111 transitions. [2020-10-15 22:34:06,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-15 22:34:06,927 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:06,927 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:06,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 22:34:06,927 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-10-15 22:34:06,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:06,928 INFO L82 PathProgramCache]: Analyzing trace with hash -40110202, now seen corresponding path program 1 times [2020-10-15 22:34:06,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:06,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411818396] [2020-10-15 22:34:06,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:07,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411818396] [2020-10-15 22:34:07,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:07,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:34:07,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697232327] [2020-10-15 22:34:07,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:34:07,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:07,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:34:07,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:34:07,034 INFO L87 Difference]: Start difference. First operand 450 states and 1111 transitions. Second operand 3 states. [2020-10-15 22:34:07,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:07,051 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-10-15 22:34:07,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:34:07,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-15 22:34:07,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:07,053 INFO L225 Difference]: With dead ends: 162 [2020-10-15 22:34:07,053 INFO L226 Difference]: Without dead ends: 162 [2020-10-15 22:34:07,054 INFO L677 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-10-15 22:34:07,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-15 22:34:07,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-10-15 22:34:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-15 22:34:07,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-10-15 22:34:07,059 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-10-15 22:34:07,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:07,059 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-10-15 22:34:07,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:34:07,060 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-10-15 22:34:07,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:07,062 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:07,062 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:07,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 22:34:07,062 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-10-15 22:34:07,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:07,063 INFO L82 PathProgramCache]: Analyzing trace with hash 52394444, now seen corresponding path program 1 times [2020-10-15 22:34:07,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:07,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247008615] [2020-10-15 22:34:07,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:07,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247008615] [2020-10-15 22:34:07,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:07,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:34:07,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994405058] [2020-10-15 22:34:07,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:34:07,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:07,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:34:07,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:34:07,237 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 6 states. [2020-10-15 22:34:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:07,415 INFO L93 Difference]: Finished difference Result 206 states and 427 transitions. [2020-10-15 22:34:07,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:34:07,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-15 22:34:07,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:07,417 INFO L225 Difference]: With dead ends: 206 [2020-10-15 22:34:07,417 INFO L226 Difference]: Without dead ends: 206 [2020-10-15 22:34:07,417 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:34:07,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-10-15 22:34:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2020-10-15 22:34:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-10-15 22:34:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 405 transitions. [2020-10-15 22:34:07,423 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 405 transitions. Word has length 22 [2020-10-15 22:34:07,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:07,424 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 405 transitions. [2020-10-15 22:34:07,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:34:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 405 transitions. [2020-10-15 22:34:07,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:07,430 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:07,430 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:07,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 22:34:07,433 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-10-15 22:34:07,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:07,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1309120554, now seen corresponding path program 1 times [2020-10-15 22:34:07,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:07,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792808353] [2020-10-15 22:34:07,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:08,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792808353] [2020-10-15 22:34:08,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:08,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 22:34:08,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728934102] [2020-10-15 22:34:08,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 22:34:08,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:08,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 22:34:08,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:34:08,394 INFO L87 Difference]: Start difference. First operand 194 states and 405 transitions. Second operand 12 states. [2020-10-15 22:34:09,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:09,701 INFO L93 Difference]: Finished difference Result 314 states and 604 transitions. [2020-10-15 22:34:09,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-15 22:34:09,701 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 22:34:09,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:09,703 INFO L225 Difference]: With dead ends: 314 [2020-10-15 22:34:09,704 INFO L226 Difference]: Without dead ends: 314 [2020-10-15 22:34:09,704 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2020-10-15 22:34:09,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-10-15 22:34:09,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 248. [2020-10-15 22:34:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-10-15 22:34:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 493 transitions. [2020-10-15 22:34:09,713 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 493 transitions. Word has length 22 [2020-10-15 22:34:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:09,713 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 493 transitions. [2020-10-15 22:34:09,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 22:34:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 493 transitions. [2020-10-15 22:34:09,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:09,714 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:09,714 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:09,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 22:34:09,715 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-10-15 22:34:09,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:09,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1309120544, now seen corresponding path program 1 times [2020-10-15 22:34:09,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:09,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496312976] [2020-10-15 22:34:09,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:09,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496312976] [2020-10-15 22:34:09,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:09,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 22:34:09,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71441470] [2020-10-15 22:34:09,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 22:34:09,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:09,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 22:34:09,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:34:09,901 INFO L87 Difference]: Start difference. First operand 248 states and 493 transitions. Second operand 8 states. [2020-10-15 22:34:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:10,245 INFO L93 Difference]: Finished difference Result 369 states and 697 transitions. [2020-10-15 22:34:10,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:34:10,246 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-15 22:34:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:10,248 INFO L225 Difference]: With dead ends: 369 [2020-10-15 22:34:10,248 INFO L226 Difference]: Without dead ends: 319 [2020-10-15 22:34:10,249 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:34:10,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-10-15 22:34:10,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 247. [2020-10-15 22:34:10,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-10-15 22:34:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 491 transitions. [2020-10-15 22:34:10,257 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 491 transitions. Word has length 22 [2020-10-15 22:34:10,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:10,257 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 491 transitions. [2020-10-15 22:34:10,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 22:34:10,257 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 491 transitions. [2020-10-15 22:34:10,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:10,258 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:10,259 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:10,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 22:34:10,259 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-10-15 22:34:10,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:10,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1413732572, now seen corresponding path program 2 times [2020-10-15 22:34:10,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:10,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153542348] [2020-10-15 22:34:10,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:10,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153542348] [2020-10-15 22:34:10,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:10,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:34:10,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925975525] [2020-10-15 22:34:10,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:34:10,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:10,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:34:10,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:34:10,357 INFO L87 Difference]: Start difference. First operand 247 states and 491 transitions. Second operand 4 states. [2020-10-15 22:34:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:10,380 INFO L93 Difference]: Finished difference Result 162 states and 259 transitions. [2020-10-15 22:34:10,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 22:34:10,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-15 22:34:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:10,382 INFO L225 Difference]: With dead ends: 162 [2020-10-15 22:34:10,382 INFO L226 Difference]: Without dead ends: 157 [2020-10-15 22:34:10,383 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:34:10,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-10-15 22:34:10,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2020-10-15 22:34:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-10-15 22:34:10,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 253 transitions. [2020-10-15 22:34:10,387 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 253 transitions. Word has length 22 [2020-10-15 22:34:10,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:10,388 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 253 transitions. [2020-10-15 22:34:10,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:34:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 253 transitions. [2020-10-15 22:34:10,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:10,388 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:10,389 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:10,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 22:34:10,389 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-10-15 22:34:10,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:10,389 INFO L82 PathProgramCache]: Analyzing trace with hash 472795278, now seen corresponding path program 2 times [2020-10-15 22:34:10,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:10,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507924085] [2020-10-15 22:34:10,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:10,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:10,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507924085] [2020-10-15 22:34:10,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:10,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 22:34:10,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858459915] [2020-10-15 22:34:10,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 22:34:10,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:10,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 22:34:10,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:34:10,499 INFO L87 Difference]: Start difference. First operand 156 states and 253 transitions. Second operand 8 states. [2020-10-15 22:34:10,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:10,845 INFO L93 Difference]: Finished difference Result 151 states and 239 transitions. [2020-10-15 22:34:10,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 22:34:10,845 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-15 22:34:10,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:10,848 INFO L225 Difference]: With dead ends: 151 [2020-10-15 22:34:10,848 INFO L226 Difference]: Without dead ends: 151 [2020-10-15 22:34:10,848 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:34:10,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-10-15 22:34:10,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 130. [2020-10-15 22:34:10,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-15 22:34:10,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 208 transitions. [2020-10-15 22:34:10,860 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 208 transitions. Word has length 22 [2020-10-15 22:34:10,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:10,860 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 208 transitions. [2020-10-15 22:34:10,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 22:34:10,861 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 208 transitions. [2020-10-15 22:34:10,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:10,861 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:10,861 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:10,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 22:34:10,862 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-10-15 22:34:10,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:10,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1729521388, now seen corresponding path program 3 times [2020-10-15 22:34:10,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:10,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375726643] [2020-10-15 22:34:10,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:11,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375726643] [2020-10-15 22:34:11,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:11,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 22:34:11,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033387438] [2020-10-15 22:34:11,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 22:34:11,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:11,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 22:34:11,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:34:11,533 INFO L87 Difference]: Start difference. First operand 130 states and 208 transitions. Second operand 12 states. [2020-10-15 22:34:12,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:12,242 INFO L93 Difference]: Finished difference Result 144 states and 221 transitions. [2020-10-15 22:34:12,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 22:34:12,242 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 22:34:12,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:12,244 INFO L225 Difference]: With dead ends: 144 [2020-10-15 22:34:12,244 INFO L226 Difference]: Without dead ends: 131 [2020-10-15 22:34:12,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2020-10-15 22:34:12,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-15 22:34:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2020-10-15 22:34:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-15 22:34:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 207 transitions. [2020-10-15 22:34:12,249 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 207 transitions. Word has length 22 [2020-10-15 22:34:12,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:12,250 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 207 transitions. [2020-10-15 22:34:12,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 22:34:12,250 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 207 transitions. [2020-10-15 22:34:12,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:12,251 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:12,251 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:12,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 22:34:12,251 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-10-15 22:34:12,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:12,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1321376162, now seen corresponding path program 4 times [2020-10-15 22:34:12,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:12,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859160340] [2020-10-15 22:34:12,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:12,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859160340] [2020-10-15 22:34:12,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:12,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 22:34:12,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798980912] [2020-10-15 22:34:12,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 22:34:12,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:12,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 22:34:12,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:34:12,732 INFO L87 Difference]: Start difference. First operand 130 states and 207 transitions. Second operand 12 states. [2020-10-15 22:34:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:13,460 INFO L93 Difference]: Finished difference Result 142 states and 218 transitions. [2020-10-15 22:34:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 22:34:13,461 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 22:34:13,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:13,462 INFO L225 Difference]: With dead ends: 142 [2020-10-15 22:34:13,462 INFO L226 Difference]: Without dead ends: 130 [2020-10-15 22:34:13,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-10-15 22:34:13,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-10-15 22:34:13,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2020-10-15 22:34:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-15 22:34:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 205 transitions. [2020-10-15 22:34:13,466 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 205 transitions. Word has length 22 [2020-10-15 22:34:13,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:13,466 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 205 transitions. [2020-10-15 22:34:13,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 22:34:13,467 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 205 transitions. [2020-10-15 22:34:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:13,467 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:13,467 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:13,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 22:34:13,468 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-10-15 22:34:13,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:13,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1455400266, now seen corresponding path program 5 times [2020-10-15 22:34:13,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:13,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113481131] [2020-10-15 22:34:13,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:14,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113481131] [2020-10-15 22:34:14,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:14,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 22:34:14,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937620003] [2020-10-15 22:34:14,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 22:34:14,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:14,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 22:34:14,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:34:14,017 INFO L87 Difference]: Start difference. First operand 130 states and 205 transitions. Second operand 12 states. [2020-10-15 22:34:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:14,720 INFO L93 Difference]: Finished difference Result 149 states and 230 transitions. [2020-10-15 22:34:14,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 22:34:14,721 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 22:34:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:14,722 INFO L225 Difference]: With dead ends: 149 [2020-10-15 22:34:14,722 INFO L226 Difference]: Without dead ends: 149 [2020-10-15 22:34:14,723 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-10-15 22:34:14,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-10-15 22:34:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2020-10-15 22:34:14,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-10-15 22:34:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 230 transitions. [2020-10-15 22:34:14,728 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 230 transitions. Word has length 22 [2020-10-15 22:34:14,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:14,728 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 230 transitions. [2020-10-15 22:34:14,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 22:34:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 230 transitions. [2020-10-15 22:34:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:14,729 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:14,729 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:14,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 22:34:14,730 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-10-15 22:34:14,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:14,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1455400276, now seen corresponding path program 2 times [2020-10-15 22:34:14,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:14,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175321144] [2020-10-15 22:34:14,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:14,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175321144] [2020-10-15 22:34:14,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:14,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 22:34:14,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308089230] [2020-10-15 22:34:14,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 22:34:14,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:14,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 22:34:14,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:34:14,888 INFO L87 Difference]: Start difference. First operand 148 states and 230 transitions. Second operand 8 states. [2020-10-15 22:34:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:15,141 INFO L93 Difference]: Finished difference Result 191 states and 287 transitions. [2020-10-15 22:34:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 22:34:15,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-15 22:34:15,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:15,142 INFO L225 Difference]: With dead ends: 191 [2020-10-15 22:34:15,143 INFO L226 Difference]: Without dead ends: 165 [2020-10-15 22:34:15,143 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:34:15,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-10-15 22:34:15,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 128. [2020-10-15 22:34:15,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-10-15 22:34:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 199 transitions. [2020-10-15 22:34:15,147 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 199 transitions. Word has length 22 [2020-10-15 22:34:15,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:15,148 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 199 transitions. [2020-10-15 22:34:15,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 22:34:15,148 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 199 transitions. [2020-10-15 22:34:15,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:15,149 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:15,149 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:15,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 22:34:15,149 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-10-15 22:34:15,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:15,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2057875200, now seen corresponding path program 3 times [2020-10-15 22:34:15,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:15,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492320911] [2020-10-15 22:34:15,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:15,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492320911] [2020-10-15 22:34:15,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:15,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 22:34:15,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953957493] [2020-10-15 22:34:15,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 22:34:15,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:15,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 22:34:15,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-15 22:34:15,367 INFO L87 Difference]: Start difference. First operand 128 states and 199 transitions. Second operand 11 states. [2020-10-15 22:34:16,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:16,002 INFO L93 Difference]: Finished difference Result 245 states and 383 transitions. [2020-10-15 22:34:16,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-15 22:34:16,002 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-15 22:34:16,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:16,004 INFO L225 Difference]: With dead ends: 245 [2020-10-15 22:34:16,004 INFO L226 Difference]: Without dead ends: 230 [2020-10-15 22:34:16,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=325, Unknown=0, NotChecked=0, Total=506 [2020-10-15 22:34:16,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-15 22:34:16,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 141. [2020-10-15 22:34:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-15 22:34:16,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 227 transitions. [2020-10-15 22:34:16,013 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 227 transitions. Word has length 22 [2020-10-15 22:34:16,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:16,014 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 227 transitions. [2020-10-15 22:34:16,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 22:34:16,014 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 227 transitions. [2020-10-15 22:34:16,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:16,014 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:16,015 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:16,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 22:34:16,015 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-10-15 22:34:16,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:16,015 INFO L82 PathProgramCache]: Analyzing trace with hash -761551564, now seen corresponding path program 6 times [2020-10-15 22:34:16,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:16,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490914793] [2020-10-15 22:34:16,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:16,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490914793] [2020-10-15 22:34:16,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:16,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 22:34:16,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572764503] [2020-10-15 22:34:16,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 22:34:16,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:16,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 22:34:16,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:34:16,515 INFO L87 Difference]: Start difference. First operand 141 states and 227 transitions. Second operand 12 states. [2020-10-15 22:34:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:17,103 INFO L93 Difference]: Finished difference Result 148 states and 233 transitions. [2020-10-15 22:34:17,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 22:34:17,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 22:34:17,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:17,105 INFO L225 Difference]: With dead ends: 148 [2020-10-15 22:34:17,105 INFO L226 Difference]: Without dead ends: 137 [2020-10-15 22:34:17,105 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2020-10-15 22:34:17,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-15 22:34:17,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-10-15 22:34:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-15 22:34:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 219 transitions. [2020-10-15 22:34:17,110 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 219 transitions. Word has length 22 [2020-10-15 22:34:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:17,110 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 219 transitions. [2020-10-15 22:34:17,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 22:34:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 219 transitions. [2020-10-15 22:34:17,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:17,111 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:17,111 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:17,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 22:34:17,111 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-10-15 22:34:17,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:17,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1314893868, now seen corresponding path program 7 times [2020-10-15 22:34:17,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:17,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100803620] [2020-10-15 22:34:17,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:17,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100803620] [2020-10-15 22:34:17,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:17,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 22:34:17,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649224214] [2020-10-15 22:34:17,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 22:34:17,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:17,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 22:34:17,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:34:17,611 INFO L87 Difference]: Start difference. First operand 137 states and 219 transitions. Second operand 12 states. [2020-10-15 22:34:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:18,260 INFO L93 Difference]: Finished difference Result 145 states and 226 transitions. [2020-10-15 22:34:18,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 22:34:18,261 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 22:34:18,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:18,262 INFO L225 Difference]: With dead ends: 145 [2020-10-15 22:34:18,262 INFO L226 Difference]: Without dead ends: 121 [2020-10-15 22:34:18,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-10-15 22:34:18,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-10-15 22:34:18,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-10-15 22:34:18,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-15 22:34:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 194 transitions. [2020-10-15 22:34:18,266 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 194 transitions. Word has length 22 [2020-10-15 22:34:18,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:18,266 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 194 transitions. [2020-10-15 22:34:18,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 22:34:18,266 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 194 transitions. [2020-10-15 22:34:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:18,267 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:18,267 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:18,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 22:34:18,267 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-10-15 22:34:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:18,268 INFO L82 PathProgramCache]: Analyzing trace with hash -149449002, now seen corresponding path program 8 times [2020-10-15 22:34:18,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:18,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966011646] [2020-10-15 22:34:18,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:18,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966011646] [2020-10-15 22:34:18,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:18,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 22:34:18,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893152524] [2020-10-15 22:34:18,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 22:34:18,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:18,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 22:34:18,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:34:18,750 INFO L87 Difference]: Start difference. First operand 121 states and 194 transitions. Second operand 12 states. [2020-10-15 22:34:19,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:19,358 INFO L93 Difference]: Finished difference Result 121 states and 193 transitions. [2020-10-15 22:34:19,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 22:34:19,361 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 22:34:19,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:19,362 INFO L225 Difference]: With dead ends: 121 [2020-10-15 22:34:19,362 INFO L226 Difference]: Without dead ends: 106 [2020-10-15 22:34:19,363 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-15 22:34:19,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-15 22:34:19,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-10-15 22:34:19,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-15 22:34:19,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 178 transitions. [2020-10-15 22:34:19,366 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 178 transitions. Word has length 22 [2020-10-15 22:34:19,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:19,366 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 178 transitions. [2020-10-15 22:34:19,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 22:34:19,366 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 178 transitions. [2020-10-15 22:34:19,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:19,367 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:19,367 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:19,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 22:34:19,367 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-10-15 22:34:19,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:19,368 INFO L82 PathProgramCache]: Analyzing trace with hash -552633476, now seen corresponding path program 9 times [2020-10-15 22:34:19,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:19,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62406869] [2020-10-15 22:34:19,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:19,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62406869] [2020-10-15 22:34:19,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:19,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 22:34:19,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034063517] [2020-10-15 22:34:19,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 22:34:19,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:19,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 22:34:19,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:34:19,943 INFO L87 Difference]: Start difference. First operand 106 states and 178 transitions. Second operand 12 states. [2020-10-15 22:34:20,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:20,572 INFO L93 Difference]: Finished difference Result 137 states and 223 transitions. [2020-10-15 22:34:20,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 22:34:20,573 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 22:34:20,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:20,574 INFO L225 Difference]: With dead ends: 137 [2020-10-15 22:34:20,575 INFO L226 Difference]: Without dead ends: 137 [2020-10-15 22:34:20,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-15 22:34:20,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-15 22:34:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2020-10-15 22:34:20,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-10-15 22:34:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 223 transitions. [2020-10-15 22:34:20,579 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 223 transitions. Word has length 22 [2020-10-15 22:34:20,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:20,580 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 223 transitions. [2020-10-15 22:34:20,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 22:34:20,580 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 223 transitions. [2020-10-15 22:34:20,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:20,580 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:20,581 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:20,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 22:34:20,581 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-10-15 22:34:20,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:20,581 INFO L82 PathProgramCache]: Analyzing trace with hash -552633486, now seen corresponding path program 3 times [2020-10-15 22:34:20,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:20,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142573896] [2020-10-15 22:34:20,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:20,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142573896] [2020-10-15 22:34:20,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:20,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 22:34:20,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440279118] [2020-10-15 22:34:20,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 22:34:20,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:20,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 22:34:20,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:34:20,802 INFO L87 Difference]: Start difference. First operand 136 states and 223 transitions. Second operand 8 states. [2020-10-15 22:34:21,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:21,087 INFO L93 Difference]: Finished difference Result 166 states and 269 transitions. [2020-10-15 22:34:21,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:34:21,088 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-15 22:34:21,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:21,089 INFO L225 Difference]: With dead ends: 166 [2020-10-15 22:34:21,089 INFO L226 Difference]: Without dead ends: 135 [2020-10-15 22:34:21,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:34:21,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-10-15 22:34:21,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2020-10-15 22:34:21,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-15 22:34:21,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 223 transitions. [2020-10-15 22:34:21,093 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 223 transitions. Word has length 22 [2020-10-15 22:34:21,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:21,093 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 223 transitions. [2020-10-15 22:34:21,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 22:34:21,093 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 223 transitions. [2020-10-15 22:34:21,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:21,094 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:21,094 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:21,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-15 22:34:21,094 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-10-15 22:34:21,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:21,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1930461660, now seen corresponding path program 10 times [2020-10-15 22:34:21,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:21,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798631800] [2020-10-15 22:34:21,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:21,532 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2020-10-15 22:34:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:21,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798631800] [2020-10-15 22:34:21,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:21,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 22:34:21,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734753539] [2020-10-15 22:34:21,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 22:34:21,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:21,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 22:34:21,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:34:21,892 INFO L87 Difference]: Start difference. First operand 135 states and 223 transitions. Second operand 12 states. [2020-10-15 22:34:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:22,631 INFO L93 Difference]: Finished difference Result 174 states and 282 transitions. [2020-10-15 22:34:22,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 22:34:22,632 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 22:34:22,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:22,633 INFO L225 Difference]: With dead ends: 174 [2020-10-15 22:34:22,633 INFO L226 Difference]: Without dead ends: 132 [2020-10-15 22:34:22,634 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-15 22:34:22,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-15 22:34:22,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-10-15 22:34:22,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-15 22:34:22,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 216 transitions. [2020-10-15 22:34:22,637 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 216 transitions. Word has length 22 [2020-10-15 22:34:22,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:22,637 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 216 transitions. [2020-10-15 22:34:22,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 22:34:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 216 transitions. [2020-10-15 22:34:22,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:22,638 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:22,638 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:22,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-15 22:34:22,639 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-10-15 22:34:22,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:22,639 INFO L82 PathProgramCache]: Analyzing trace with hash 571806310, now seen corresponding path program 11 times [2020-10-15 22:34:22,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:22,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593614952] [2020-10-15 22:34:22,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:23,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593614952] [2020-10-15 22:34:23,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:23,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 22:34:23,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527030543] [2020-10-15 22:34:23,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 22:34:23,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:23,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 22:34:23,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:34:23,218 INFO L87 Difference]: Start difference. First operand 132 states and 216 transitions. Second operand 12 states. [2020-10-15 22:34:24,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:24,024 INFO L93 Difference]: Finished difference Result 169 states and 273 transitions. [2020-10-15 22:34:24,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 22:34:24,025 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 22:34:24,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:24,026 INFO L225 Difference]: With dead ends: 169 [2020-10-15 22:34:24,026 INFO L226 Difference]: Without dead ends: 132 [2020-10-15 22:34:24,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-15 22:34:24,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-15 22:34:24,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-10-15 22:34:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-15 22:34:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 212 transitions. [2020-10-15 22:34:24,030 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 212 transitions. Word has length 22 [2020-10-15 22:34:24,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:24,031 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 212 transitions. [2020-10-15 22:34:24,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 22:34:24,031 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 212 transitions. [2020-10-15 22:34:24,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:24,031 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:24,032 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:24,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-15 22:34:24,032 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-10-15 22:34:24,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:24,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1853019498, now seen corresponding path program 12 times [2020-10-15 22:34:24,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:24,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810345503] [2020-10-15 22:34:24,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:24,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:24,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810345503] [2020-10-15 22:34:24,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:24,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 22:34:24,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496037692] [2020-10-15 22:34:24,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 22:34:24,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:24,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 22:34:24,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:34:24,649 INFO L87 Difference]: Start difference. First operand 132 states and 212 transitions. Second operand 12 states. [2020-10-15 22:34:25,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:25,362 INFO L93 Difference]: Finished difference Result 153 states and 241 transitions. [2020-10-15 22:34:25,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 22:34:25,363 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 22:34:25,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:25,364 INFO L225 Difference]: With dead ends: 153 [2020-10-15 22:34:25,364 INFO L226 Difference]: Without dead ends: 153 [2020-10-15 22:34:25,364 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-15 22:34:25,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-10-15 22:34:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2020-10-15 22:34:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-15 22:34:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 241 transitions. [2020-10-15 22:34:25,368 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 241 transitions. Word has length 22 [2020-10-15 22:34:25,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:25,368 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 241 transitions. [2020-10-15 22:34:25,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 22:34:25,368 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 241 transitions. [2020-10-15 22:34:25,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:25,369 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:25,369 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:25,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-15 22:34:25,369 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-10-15 22:34:25,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:25,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1853019508, now seen corresponding path program 4 times [2020-10-15 22:34:25,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:25,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182301476] [2020-10-15 22:34:25,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:25,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182301476] [2020-10-15 22:34:25,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:25,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 22:34:25,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231065206] [2020-10-15 22:34:25,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 22:34:25,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:25,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 22:34:25,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:34:25,514 INFO L87 Difference]: Start difference. First operand 152 states and 241 transitions. Second operand 8 states. [2020-10-15 22:34:25,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:25,800 INFO L93 Difference]: Finished difference Result 161 states and 251 transitions. [2020-10-15 22:34:25,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 22:34:25,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-15 22:34:25,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:25,802 INFO L225 Difference]: With dead ends: 161 [2020-10-15 22:34:25,803 INFO L226 Difference]: Without dead ends: 131 [2020-10-15 22:34:25,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:34:25,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-15 22:34:25,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 101. [2020-10-15 22:34:25,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-15 22:34:25,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 160 transitions. [2020-10-15 22:34:25,807 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 160 transitions. Word has length 22 [2020-10-15 22:34:25,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:25,808 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 160 transitions. [2020-10-15 22:34:25,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 22:34:25,808 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 160 transitions. [2020-10-15 22:34:25,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:25,809 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:25,809 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:25,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-15 22:34:25,809 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-10-15 22:34:25,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:25,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1877323498, now seen corresponding path program 13 times [2020-10-15 22:34:25,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:25,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448081991] [2020-10-15 22:34:25,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:26,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448081991] [2020-10-15 22:34:26,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:26,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 22:34:26,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658464829] [2020-10-15 22:34:26,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 22:34:26,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:26,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 22:34:26,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:34:26,429 INFO L87 Difference]: Start difference. First operand 101 states and 160 transitions. Second operand 12 states. [2020-10-15 22:34:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:27,224 INFO L93 Difference]: Finished difference Result 130 states and 200 transitions. [2020-10-15 22:34:27,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-15 22:34:27,225 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 22:34:27,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:27,226 INFO L225 Difference]: With dead ends: 130 [2020-10-15 22:34:27,226 INFO L226 Difference]: Without dead ends: 110 [2020-10-15 22:34:27,227 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-10-15 22:34:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-15 22:34:27,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2020-10-15 22:34:27,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-15 22:34:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 156 transitions. [2020-10-15 22:34:27,230 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 156 transitions. Word has length 22 [2020-10-15 22:34:27,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:27,230 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 156 transitions. [2020-10-15 22:34:27,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 22:34:27,230 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions. [2020-10-15 22:34:27,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:27,231 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:27,231 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:27,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-15 22:34:27,231 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-10-15 22:34:27,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:27,231 INFO L82 PathProgramCache]: Analyzing trace with hash 280732566, now seen corresponding path program 14 times [2020-10-15 22:34:27,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:27,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382678559] [2020-10-15 22:34:27,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:27,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:27,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382678559] [2020-10-15 22:34:27,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:27,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 22:34:27,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988228111] [2020-10-15 22:34:27,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 22:34:27,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:27,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 22:34:27,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:34:27,743 INFO L87 Difference]: Start difference. First operand 101 states and 156 transitions. Second operand 12 states. [2020-10-15 22:34:28,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:28,404 INFO L93 Difference]: Finished difference Result 120 states and 178 transitions. [2020-10-15 22:34:28,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 22:34:28,405 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 22:34:28,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:28,406 INFO L225 Difference]: With dead ends: 120 [2020-10-15 22:34:28,406 INFO L226 Difference]: Without dead ends: 76 [2020-10-15 22:34:28,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2020-10-15 22:34:28,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-15 22:34:28,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2020-10-15 22:34:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-15 22:34:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2020-10-15 22:34:28,409 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 22 [2020-10-15 22:34:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:28,409 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2020-10-15 22:34:28,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 22:34:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2020-10-15 22:34:28,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:34:28,410 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:34:28,410 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:34:28,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-15 22:34:28,410 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-10-15 22:34:28,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:34:28,411 INFO L82 PathProgramCache]: Analyzing trace with hash 779226054, now seen corresponding path program 15 times [2020-10-15 22:34:28,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:34:28,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225426273] [2020-10-15 22:34:28,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:34:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:34:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:34:29,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225426273] [2020-10-15 22:34:29,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:34:29,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 22:34:29,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533782555] [2020-10-15 22:34:29,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 22:34:29,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:34:29,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 22:34:29,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:34:29,075 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand 12 states. [2020-10-15 22:34:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:34:29,677 INFO L93 Difference]: Finished difference Result 66 states and 99 transitions. [2020-10-15 22:34:29,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 22:34:29,678 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 22:34:29,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:34:29,678 INFO L225 Difference]: With dead ends: 66 [2020-10-15 22:34:29,678 INFO L226 Difference]: Without dead ends: 0 [2020-10-15 22:34:29,678 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-15 22:34:29,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-15 22:34:29,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-15 22:34:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-15 22:34:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-15 22:34:29,679 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-10-15 22:34:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:34:29,679 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-15 22:34:29,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 22:34:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-15 22:34:29,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-15 22:34:29,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-15 22:34:29,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 10:34:29 BasicIcfg [2020-10-15 22:34:29,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 22:34:29,685 INFO L168 Benchmark]: Toolchain (without parser) took 85554.40 ms. Allocated memory was 252.7 MB in the beginning and 624.4 MB in the end (delta: 371.7 MB). Free memory was 205.5 MB in the beginning and 493.9 MB in the end (delta: -288.3 MB). Peak memory consumption was 83.4 MB. Max. memory is 14.2 GB. [2020-10-15 22:34:29,686 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 22:34:29,686 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1361.90 ms. Allocated memory was 252.7 MB in the beginning and 358.1 MB in the end (delta: 105.4 MB). Free memory was 205.5 MB in the beginning and 317.9 MB in the end (delta: -112.4 MB). Peak memory consumption was 109.6 MB. Max. memory is 14.2 GB. [2020-10-15 22:34:29,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.73 ms. Allocated memory is still 358.1 MB. Free memory was 317.9 MB in the beginning and 314.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.2 GB. [2020-10-15 22:34:29,687 INFO L168 Benchmark]: Boogie Preprocessor took 51.15 ms. Allocated memory is still 358.1 MB. Free memory was 314.6 MB in the beginning and 311.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.2 GB. [2020-10-15 22:34:29,687 INFO L168 Benchmark]: RCFGBuilder took 718.07 ms. Allocated memory is still 358.1 MB. Free memory was 311.3 MB in the beginning and 265.5 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 14.2 GB. [2020-10-15 22:34:29,687 INFO L168 Benchmark]: TraceAbstraction took 83347.28 ms. Allocated memory was 358.1 MB in the beginning and 624.4 MB in the end (delta: 266.3 MB). Free memory was 265.5 MB in the beginning and 493.9 MB in the end (delta: -228.3 MB). Peak memory consumption was 38.0 MB. Max. memory is 14.2 GB. [2020-10-15 22:34:29,689 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 1361.90 ms. Allocated memory was 252.7 MB in the beginning and 358.1 MB in the end (delta: 105.4 MB). Free memory was 205.5 MB in the beginning and 317.9 MB in the end (delta: -112.4 MB). Peak memory consumption was 109.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 70.73 ms. Allocated memory is still 358.1 MB. Free memory was 317.9 MB in the beginning and 314.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 51.15 ms. Allocated memory is still 358.1 MB. Free memory was 314.6 MB in the beginning and 311.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.2 GB. * RCFGBuilder took 718.07 ms. Allocated memory is still 358.1 MB. Free memory was 311.3 MB in the beginning and 265.5 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 14.2 GB. * TraceAbstraction took 83347.28 ms. Allocated memory was 358.1 MB in the beginning and 624.4 MB in the end (delta: 266.3 MB). Free memory was 265.5 MB in the beginning and 493.9 MB in the end (delta: -228.3 MB). Peak memory consumption was 38.0 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1759 VarBasedMoverChecksPositive, 69 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 39 SemBasedMoverChecksNegative, 24 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 52.0s, 140 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 59.3s, 150 PlacesBefore, 40 PlacesAfterwards, 154 TransitionsBefore, 38 TransitionsAfterwards, 2652 CoEnabledTransitionPairs, 7 FixpointIterations, 90 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 16 ConcurrentYvCompositions, 6 ChoiceCompositions, 174 TotalNumberOfCompositions, 6338 MoverChecksTotal - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 83.2s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 59.4s, HoareTripleCheckerStatistics: 626 SDtfs, 908 SDslu, 2076 SDs, 0 SdLazy, 4679 SolverSat, 441 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 22 SyntacticMatches, 33 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 446 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 478 ConstructedInterpolants, 0 QuantifiedInterpolants, 198300 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...