./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9cbc04ade216e1ac2b3c2134b3bae89ae591143b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 03:10:10,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 03:10:10,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 03:10:10,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 03:10:10,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 03:10:10,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 03:10:10,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 03:10:10,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 03:10:10,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 03:10:10,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 03:10:10,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 03:10:10,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 03:10:10,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 03:10:10,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 03:10:10,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 03:10:10,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 03:10:10,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 03:10:10,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 03:10:10,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 03:10:10,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 03:10:10,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 03:10:10,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 03:10:10,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 03:10:10,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 03:10:10,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 03:10:10,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 03:10:10,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 03:10:10,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 03:10:10,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 03:10:10,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 03:10:10,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 03:10:10,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 03:10:10,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 03:10:10,816 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 03:10:10,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 03:10:10,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 03:10:10,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 03:10:10,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 03:10:10,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 03:10:10,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 03:10:10,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 03:10:10,821 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 03:10:10,853 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 03:10:10,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 03:10:10,857 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 03:10:10,858 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 03:10:10,858 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 03:10:10,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 03:10:10,859 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 03:10:10,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 03:10:10,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 03:10:10,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 03:10:10,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 03:10:10,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 03:10:10,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 03:10:10,860 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 03:10:10,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 03:10:10,861 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 03:10:10,861 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 03:10:10,861 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 03:10:10,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 03:10:10,862 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 03:10:10,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 03:10:10,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 03:10:10,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 03:10:10,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 03:10:10,863 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 03:10:10,863 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 03:10:10,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 03:10:10,864 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 03:10:10,864 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 03:10:10,864 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9cbc04ade216e1ac2b3c2134b3bae89ae591143b [2020-10-20 03:10:11,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 03:10:11,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 03:10:11,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 03:10:11,086 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 03:10:11,086 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 03:10:11,087 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2020-10-20 03:10:11,156 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf929b13a/1fd3a8552a394b869253d5f79ebf76ec/FLAG8e7509534 [2020-10-20 03:10:11,731 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 03:10:11,735 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2020-10-20 03:10:11,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf929b13a/1fd3a8552a394b869253d5f79ebf76ec/FLAG8e7509534 [2020-10-20 03:10:12,002 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf929b13a/1fd3a8552a394b869253d5f79ebf76ec [2020-10-20 03:10:12,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 03:10:12,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 03:10:12,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 03:10:12,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 03:10:12,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 03:10:12,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:10:12" (1/1) ... [2020-10-20 03:10:12,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37901350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:10:12, skipping insertion in model container [2020-10-20 03:10:12,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:10:12" (1/1) ... [2020-10-20 03:10:12,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 03:10:12,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 03:10:12,444 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-10-20 03:10:12,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:10:12,943 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 03:10:12,956 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-10-20 03:10:13,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:10:13,695 INFO L208 MainTranslator]: Completed translation [2020-10-20 03:10:13,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:10:13 WrapperNode [2020-10-20 03:10:13,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 03:10:13,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 03:10:13,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 03:10:13,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 03:10:13,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:10:13" (1/1) ... [2020-10-20 03:10:13,771 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:10:13" (1/1) ... [2020-10-20 03:10:13,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 03:10:13,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 03:10:13,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 03:10:13,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 03:10:13,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:10:13" (1/1) ... [2020-10-20 03:10:13,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:10:13" (1/1) ... [2020-10-20 03:10:13,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:10:13" (1/1) ... [2020-10-20 03:10:13,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:10:13" (1/1) ... [2020-10-20 03:10:13,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:10:13" (1/1) ... [2020-10-20 03:10:13,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:10:13" (1/1) ... [2020-10-20 03:10:13,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:10:13" (1/1) ... [2020-10-20 03:10:13,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 03:10:13,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 03:10:13,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 03:10:13,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 03:10:13,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:10:13" (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-20 03:10:13,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-20 03:10:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 03:10:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-20 03:10:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 03:10:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 03:10:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 03:10:13,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 03:10:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-20 03:10:13,994 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-20 03:10:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 03:10:13,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 03:10:13,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 03:10:13,997 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-20 03:10:14,724 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 03:10:14,725 INFO L298 CfgBuilder]: Removed 36 assume(true) statements. [2020-10-20 03:10:14,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:10:14 BoogieIcfgContainer [2020-10-20 03:10:14,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 03:10:14,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 03:10:14,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 03:10:14,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 03:10:14,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 03:10:12" (1/3) ... [2020-10-20 03:10:14,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5d6ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:10:14, skipping insertion in model container [2020-10-20 03:10:14,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:10:13" (2/3) ... [2020-10-20 03:10:14,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5d6ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:10:14, skipping insertion in model container [2020-10-20 03:10:14,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:10:14" (3/3) ... [2020-10-20 03:10:14,736 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2020-10-20 03:10:14,748 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-20 03:10:14,749 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 03:10:14,755 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-20 03:10:14,756 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-20 03:10:14,787 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,787 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,787 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,787 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,787 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,788 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,788 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,788 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,788 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,788 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,788 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,789 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,789 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,789 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,789 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,789 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,790 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,790 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,790 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,790 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,791 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,791 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,791 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,791 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,791 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,791 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,792 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,792 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,792 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,792 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,792 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,793 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,793 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,793 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,793 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,793 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,794 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,794 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,797 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,798 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,798 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,798 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,798 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,798 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,798 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,799 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,799 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,802 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,802 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,802 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,802 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,803 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,803 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,803 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,803 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,803 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:10:14,817 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-10-20 03:10:14,831 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-20 03:10:14,852 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 03:10:14,852 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 03:10:14,853 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 03:10:14,853 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 03:10:14,853 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 03:10:14,853 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 03:10:14,853 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 03:10:14,853 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 03:10:14,871 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-20 03:10:14,873 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 178 transitions, 378 flow [2020-10-20 03:10:14,876 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 178 transitions, 378 flow [2020-10-20 03:10:14,878 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 168 places, 178 transitions, 378 flow [2020-10-20 03:10:14,971 INFO L129 PetriNetUnfolder]: 19/226 cut-off events. [2020-10-20 03:10:14,972 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-20 03:10:14,977 INFO L80 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 226 events. 19/226 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 444 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 126. Up to 4 conditions per place. [2020-10-20 03:10:14,982 INFO L117 LiptonReduction]: Number of co-enabled transitions 1872 [2020-10-20 03:10:16,151 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-20 03:10:16,182 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:16,187 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-20 03:10:16,207 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:16,210 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-20 03:10:16,211 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-20 03:10:16,228 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-20 03:10:16,257 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:16,263 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-20 03:10:16,283 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:16,285 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-20 03:10:16,286 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-20 03:10:18,528 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-20 03:10:18,573 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:18,578 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-20 03:10:18,622 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:18,623 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-20 03:10:18,624 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-10-20 03:10:18,640 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-20 03:10:18,679 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:18,684 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-20 03:10:18,718 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:18,719 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-20 03:10:18,720 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-10-20 03:10:20,757 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-20 03:10:20,811 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:20,819 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-20 03:10:20,864 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:20,866 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-20 03:10:20,866 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:164, output treesize:166 [2020-10-20 03:10:20,883 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-20 03:10:20,934 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:20,941 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-20 03:10:20,997 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:20,998 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-20 03:10:20,998 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:164, output treesize:166 [2020-10-20 03:10:21,046 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-20 03:10:21,085 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:21,090 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-20 03:10:21,120 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:21,121 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-20 03:10:21,122 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-10-20 03:10:21,134 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-20 03:10:21,184 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:21,190 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-20 03:10:21,226 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:21,228 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-20 03:10:21,228 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-10-20 03:10:23,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-20 03:10:23,566 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:23,570 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-20 03:10:23,598 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:23,599 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-20 03:10:23,600 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-20 03:10:23,612 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-20 03:10:23,647 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:23,651 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-20 03:10:23,681 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:23,683 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-20 03:10:23,683 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-20 03:10:25,710 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-20 03:10:25,752 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:25,758 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-20 03:10:25,790 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:25,791 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-20 03:10:25,791 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-10-20 03:10:25,815 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-20 03:10:25,851 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:25,855 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-20 03:10:25,883 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:25,884 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-20 03:10:25,885 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-10-20 03:10:27,960 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-20 03:10:28,010 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:28,016 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-20 03:10:28,046 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:28,047 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-20 03:10:28,048 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:124 [2020-10-20 03:10:28,060 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-20 03:10:28,098 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:28,101 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-20 03:10:28,131 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:28,132 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-20 03:10:28,132 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:124 [2020-10-20 03:10:30,172 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-20 03:10:30,187 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:30,191 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-20 03:10:30,205 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:30,206 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-20 03:10:30,207 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-10-20 03:10:30,279 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-20 03:10:30,357 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:30,362 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-20 03:10:30,415 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:30,416 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-20 03:10:30,417 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:164, output treesize:166 [2020-10-20 03:10:30,429 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-20 03:10:30,489 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:30,496 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-20 03:10:30,552 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:30,553 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-20 03:10:30,553 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:164, output treesize:166 [2020-10-20 03:10:30,592 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-20 03:10:30,626 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:30,631 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-20 03:10:30,664 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:30,665 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-20 03:10:30,665 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-10-20 03:10:30,678 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-20 03:10:30,719 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:30,723 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-20 03:10:30,761 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:30,762 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-20 03:10:30,762 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-10-20 03:10:33,040 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-20 03:10:33,074 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:33,079 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-20 03:10:33,106 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:33,107 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-20 03:10:33,108 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-10-20 03:10:33,125 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-20 03:10:33,155 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:33,159 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-20 03:10:33,192 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:33,193 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-20 03:10:33,194 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-10-20 03:10:35,453 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-20 03:10:35,492 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:35,496 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-20 03:10:35,523 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:35,524 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-20 03:10:35,525 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:108 [2020-10-20 03:10:35,536 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-20 03:10:35,573 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:35,576 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-20 03:10:35,598 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:35,599 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-20 03:10:35,599 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:108, output treesize:110 [2020-10-20 03:10:35,617 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-20 03:10:35,644 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:35,649 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-20 03:10:35,674 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:35,675 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-20 03:10:35,675 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-10-20 03:10:35,690 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-20 03:10:35,717 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:35,723 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-20 03:10:35,749 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:35,751 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-20 03:10:35,751 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:124 [2020-10-20 03:10:38,031 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-10-20 03:10:38,095 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-20 03:10:38,135 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:38,139 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-20 03:10:38,170 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:38,171 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-20 03:10:38,171 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-20 03:10:38,183 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-20 03:10:38,216 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:38,225 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-20 03:10:38,252 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:38,253 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-20 03:10:38,253 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-20 03:10:40,418 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-20 03:10:40,451 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:40,454 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-20 03:10:40,483 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:40,484 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-20 03:10:40,485 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-10-20 03:10:40,495 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-20 03:10:40,525 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:40,528 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-20 03:10:40,559 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:40,560 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-20 03:10:40,560 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-10-20 03:10:42,776 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-20 03:10:42,812 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:42,817 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-20 03:10:42,856 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:42,858 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-20 03:10:42,858 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:127 [2020-10-20 03:10:42,878 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-20 03:10:42,914 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:42,918 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-20 03:10:42,964 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:42,965 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-20 03:10:42,966 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:127 [2020-10-20 03:10:45,188 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-20 03:10:45,223 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:45,228 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-20 03:10:45,255 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:45,256 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-20 03:10:45,256 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-10-20 03:10:45,268 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-20 03:10:45,300 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:45,305 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-20 03:10:45,334 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:45,335 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-20 03:10:45,335 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-10-20 03:10:47,394 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-20 03:10:47,431 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:47,435 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-20 03:10:47,461 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:47,462 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-20 03:10:47,462 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-10-20 03:10:47,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-20 03:10:47,504 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:47,507 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-20 03:10:47,540 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:47,541 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-20 03:10:47,541 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:124 [2020-10-20 03:10:49,684 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-20 03:10:49,719 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:49,723 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-20 03:10:49,749 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:49,750 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-20 03:10:49,750 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-10-20 03:10:49,760 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-20 03:10:49,794 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:49,798 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-20 03:10:49,826 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:49,827 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-20 03:10:49,827 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-10-20 03:10:51,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-20 03:10:52,094 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-10-20 03:10:52,094 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:52,100 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-20 03:10:52,183 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:52,184 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-20 03:10:52,185 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:150, output treesize:152 [2020-10-20 03:10:52,197 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-20 03:10:52,275 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:52,279 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-20 03:10:52,344 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:52,345 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-20 03:10:52,346 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:150, output treesize:152 [2020-10-20 03:10:52,380 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-20 03:10:52,414 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:52,425 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-20 03:10:52,452 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:52,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-20 03:10:52,453 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-10-20 03:10:52,463 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-20 03:10:52,492 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:52,499 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-20 03:10:52,533 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:52,534 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-20 03:10:52,534 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-10-20 03:10:54,569 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-20 03:10:54,612 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:54,617 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-20 03:10:54,660 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:54,661 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-20 03:10:54,662 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:141, output treesize:143 [2020-10-20 03:10:54,681 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-20 03:10:54,724 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:54,729 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-20 03:10:54,768 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:54,769 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-20 03:10:54,769 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:139, output treesize:141 [2020-10-20 03:10:57,135 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2020-10-20 03:10:57,808 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2020-10-20 03:10:57,820 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-20 03:10:57,918 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:57,921 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-20 03:10:58,000 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:58,001 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-20 03:10:58,002 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:163, output treesize:135 [2020-10-20 03:10:58,385 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2020-10-20 03:10:58,393 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-20 03:10:58,504 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-20 03:10:58,505 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:58,512 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-20 03:10:58,604 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:58,604 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-20 03:10:58,605 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:172, output treesize:144 [2020-10-20 03:10:58,946 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-10-20 03:11:00,064 WARN L193 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 144 [2020-10-20 03:11:00,406 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-10-20 03:11:00,571 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2020-10-20 03:11:02,323 WARN L193 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 173 DAG size of output: 171 [2020-10-20 03:11:02,347 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-20 03:11:03,186 WARN L193 SmtUtils]: Spent 838.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-10-20 03:11:03,187 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:11:03,197 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-20 03:11:03,915 WARN L193 SmtUtils]: Spent 717.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-10-20 03:11:03,915 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:11:03,916 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-20 03:11:03,917 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:350, output treesize:362 [2020-10-20 03:11:04,659 WARN L193 SmtUtils]: Spent 741.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-10-20 03:11:05,515 WARN L193 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 159 [2020-10-20 03:11:05,975 WARN L193 SmtUtils]: Spent 452.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-10-20 03:11:05,983 INFO L132 LiptonReduction]: Checked pairs total: 3600 [2020-10-20 03:11:05,983 INFO L134 LiptonReduction]: Total number of compositions: 222 [2020-10-20 03:11:05,989 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 32 transitions, 86 flow [2020-10-20 03:11:06,004 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 121 states. [2020-10-20 03:11:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2020-10-20 03:11:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-20 03:11:06,013 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:06,014 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-10-20 03:11:06,015 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-20 03:11:06,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:06,021 INFO L82 PathProgramCache]: Analyzing trace with hash 688, now seen corresponding path program 1 times [2020-10-20 03:11:06,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:06,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074943684] [2020-10-20 03:11:06,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:06,259 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-20 03:11:06,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074943684] [2020-10-20 03:11:06,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:06,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-20 03:11:06,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840392165] [2020-10-20 03:11:06,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-20 03:11:06,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:06,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 03:11:06,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 03:11:06,295 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 2 states. [2020-10-20 03:11:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:06,316 INFO L93 Difference]: Finished difference Result 119 states and 236 transitions. [2020-10-20 03:11:06,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 03:11:06,317 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-20 03:11:06,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:06,328 INFO L225 Difference]: With dead ends: 119 [2020-10-20 03:11:06,328 INFO L226 Difference]: Without dead ends: 108 [2020-10-20 03:11:06,330 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-20 03:11:06,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-10-20 03:11:06,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-10-20 03:11:06,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-10-20 03:11:06,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 213 transitions. [2020-10-20 03:11:06,372 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 213 transitions. Word has length 1 [2020-10-20 03:11:06,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:06,372 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 213 transitions. [2020-10-20 03:11:06,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-20 03:11:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 213 transitions. [2020-10-20 03:11:06,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-20 03:11:06,373 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:06,373 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-20 03:11:06,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 03:11:06,373 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-20 03:11:06,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:06,373 INFO L82 PathProgramCache]: Analyzing trace with hash 654434250, now seen corresponding path program 1 times [2020-10-20 03:11:06,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:06,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678459008] [2020-10-20 03:11:06,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:06,604 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-20 03:11:06,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678459008] [2020-10-20 03:11:06,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:06,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:11:06,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584503326] [2020-10-20 03:11:06,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:11:06,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:06,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:11:06,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:11:06,608 INFO L87 Difference]: Start difference. First operand 108 states and 213 transitions. Second operand 4 states. [2020-10-20 03:11:06,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:06,751 INFO L93 Difference]: Finished difference Result 146 states and 291 transitions. [2020-10-20 03:11:06,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:11:06,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-10-20 03:11:06,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:06,755 INFO L225 Difference]: With dead ends: 146 [2020-10-20 03:11:06,755 INFO L226 Difference]: Without dead ends: 146 [2020-10-20 03:11:06,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:11:06,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-10-20 03:11:06,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2020-10-20 03:11:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-20 03:11:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 263 transitions. [2020-10-20 03:11:06,782 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 263 transitions. Word has length 5 [2020-10-20 03:11:06,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:06,782 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 263 transitions. [2020-10-20 03:11:06,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:11:06,783 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 263 transitions. [2020-10-20 03:11:06,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-20 03:11:06,783 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:06,783 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-20 03:11:06,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 03:11:06,784 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-20 03:11:06,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:06,784 INFO L82 PathProgramCache]: Analyzing trace with hash 654434302, now seen corresponding path program 1 times [2020-10-20 03:11:06,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:06,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146279524] [2020-10-20 03:11:06,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:06,872 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-20 03:11:06,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146279524] [2020-10-20 03:11:06,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:06,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:11:06,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339721606] [2020-10-20 03:11:06,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:11:06,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:06,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:11:06,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:11:06,874 INFO L87 Difference]: Start difference. First operand 130 states and 263 transitions. Second operand 3 states. [2020-10-20 03:11:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:06,975 INFO L93 Difference]: Finished difference Result 160 states and 315 transitions. [2020-10-20 03:11:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:11:06,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-20 03:11:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:06,977 INFO L225 Difference]: With dead ends: 160 [2020-10-20 03:11:06,978 INFO L226 Difference]: Without dead ends: 153 [2020-10-20 03:11:06,978 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-20 03:11:06,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-10-20 03:11:06,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2020-10-20 03:11:06,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-10-20 03:11:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 297 transitions. [2020-10-20 03:11:06,995 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 297 transitions. Word has length 5 [2020-10-20 03:11:06,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:06,996 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 297 transitions. [2020-10-20 03:11:06,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:11:06,996 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 297 transitions. [2020-10-20 03:11:06,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 03:11:06,998 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:06,999 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:06,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 03:11:06,999 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-20 03:11:07,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:07,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1212118520, now seen corresponding path program 1 times [2020-10-20 03:11:07,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:07,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038495147] [2020-10-20 03:11:07,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:07,105 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-20 03:11:07,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038495147] [2020-10-20 03:11:07,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:07,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:11:07,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495261560] [2020-10-20 03:11:07,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:11:07,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:07,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:11:07,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:11:07,110 INFO L87 Difference]: Start difference. First operand 145 states and 297 transitions. Second operand 3 states. [2020-10-20 03:11:07,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:07,132 INFO L93 Difference]: Finished difference Result 57 states and 101 transitions. [2020-10-20 03:11:07,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:11:07,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-20 03:11:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:07,135 INFO L225 Difference]: With dead ends: 57 [2020-10-20 03:11:07,135 INFO L226 Difference]: Without dead ends: 57 [2020-10-20 03:11:07,135 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-20 03:11:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-20 03:11:07,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-10-20 03:11:07,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-20 03:11:07,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 101 transitions. [2020-10-20 03:11:07,141 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 101 transitions. Word has length 10 [2020-10-20 03:11:07,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:07,141 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 101 transitions. [2020-10-20 03:11:07,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:11:07,141 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 101 transitions. [2020-10-20 03:11:07,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:07,142 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:07,142 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:07,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 03:11:07,142 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-20 03:11:07,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:07,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1197590593, now seen corresponding path program 1 times [2020-10-20 03:11:07,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:07,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046665854] [2020-10-20 03:11:07,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:11:07,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046665854] [2020-10-20 03:11:07,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:07,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:11:07,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712893647] [2020-10-20 03:11:07,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 03:11:07,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:07,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 03:11:07,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:11:07,373 INFO L87 Difference]: Start difference. First operand 57 states and 101 transitions. Second operand 7 states. [2020-10-20 03:11:07,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:07,741 INFO L93 Difference]: Finished difference Result 98 states and 161 transitions. [2020-10-20 03:11:07,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:07,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-20 03:11:07,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:07,742 INFO L225 Difference]: With dead ends: 98 [2020-10-20 03:11:07,742 INFO L226 Difference]: Without dead ends: 98 [2020-10-20 03:11:07,743 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2020-10-20 03:11:07,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-10-20 03:11:07,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 74. [2020-10-20 03:11:07,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-20 03:11:07,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 124 transitions. [2020-10-20 03:11:07,748 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 124 transitions. Word has length 16 [2020-10-20 03:11:07,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:07,748 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 124 transitions. [2020-10-20 03:11:07,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 03:11:07,748 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 124 transitions. [2020-10-20 03:11:07,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:07,749 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:07,749 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:07,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 03:11:07,750 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-20 03:11:07,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:07,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1197590631, now seen corresponding path program 1 times [2020-10-20 03:11:07,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:07,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325889021] [2020-10-20 03:11:07,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:08,244 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-20 03:11:08,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325889021] [2020-10-20 03:11:08,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:08,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:08,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138559058] [2020-10-20 03:11:08,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:08,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:08,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:08,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:08,246 INFO L87 Difference]: Start difference. First operand 74 states and 124 transitions. Second operand 10 states. [2020-10-20 03:11:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:08,636 INFO L93 Difference]: Finished difference Result 88 states and 141 transitions. [2020-10-20 03:11:08,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:08,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:08,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:08,638 INFO L225 Difference]: With dead ends: 88 [2020-10-20 03:11:08,638 INFO L226 Difference]: Without dead ends: 77 [2020-10-20 03:11:08,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:11:08,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-20 03:11:08,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2020-10-20 03:11:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-20 03:11:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2020-10-20 03:11:08,642 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 16 [2020-10-20 03:11:08,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:08,643 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2020-10-20 03:11:08,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:08,643 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2020-10-20 03:11:08,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:08,644 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:08,644 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:08,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 03:11:08,644 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-20 03:11:08,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:08,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1365975115, now seen corresponding path program 2 times [2020-10-20 03:11:08,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:08,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951974482] [2020-10-20 03:11:08,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:09,102 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-20 03:11:09,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951974482] [2020-10-20 03:11:09,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:09,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:09,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006887374] [2020-10-20 03:11:09,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:09,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:09,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:09,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:09,104 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 10 states. [2020-10-20 03:11:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:09,528 INFO L93 Difference]: Finished difference Result 77 states and 127 transitions. [2020-10-20 03:11:09,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 03:11:09,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:09,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:09,529 INFO L225 Difference]: With dead ends: 77 [2020-10-20 03:11:09,529 INFO L226 Difference]: Without dead ends: 62 [2020-10-20 03:11:09,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:11:09,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-20 03:11:09,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2020-10-20 03:11:09,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-20 03:11:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 99 transitions. [2020-10-20 03:11:09,535 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 99 transitions. Word has length 16 [2020-10-20 03:11:09,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:09,536 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 99 transitions. [2020-10-20 03:11:09,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:09,536 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 99 transitions. [2020-10-20 03:11:09,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:09,542 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:09,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:09,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 03:11:09,543 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-20 03:11:09,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:09,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1825504767, now seen corresponding path program 2 times [2020-10-20 03:11:09,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:09,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094455955] [2020-10-20 03:11:09,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:09,707 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-20 03:11:09,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094455955] [2020-10-20 03:11:09,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:09,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:11:09,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024650116] [2020-10-20 03:11:09,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 03:11:09,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:09,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 03:11:09,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:11:09,709 INFO L87 Difference]: Start difference. First operand 57 states and 99 transitions. Second operand 7 states. [2020-10-20 03:11:10,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:10,049 INFO L93 Difference]: Finished difference Result 86 states and 145 transitions. [2020-10-20 03:11:10,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:11:10,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-20 03:11:10,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:10,051 INFO L225 Difference]: With dead ends: 86 [2020-10-20 03:11:10,051 INFO L226 Difference]: Without dead ends: 86 [2020-10-20 03:11:10,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-20 03:11:10,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-20 03:11:10,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2020-10-20 03:11:10,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-20 03:11:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 116 transitions. [2020-10-20 03:11:10,055 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 116 transitions. Word has length 16 [2020-10-20 03:11:10,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:10,055 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 116 transitions. [2020-10-20 03:11:10,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 03:11:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 116 transitions. [2020-10-20 03:11:10,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:10,059 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:10,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:10,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 03:11:10,060 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-20 03:11:10,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:10,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1825504729, now seen corresponding path program 3 times [2020-10-20 03:11:10,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:10,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183568535] [2020-10-20 03:11:10,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:10,483 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-20 03:11:10,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183568535] [2020-10-20 03:11:10,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:10,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:10,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291891603] [2020-10-20 03:11:10,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:10,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:10,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:10,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:10,485 INFO L87 Difference]: Start difference. First operand 70 states and 116 transitions. Second operand 10 states. [2020-10-20 03:11:10,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:10,906 INFO L93 Difference]: Finished difference Result 91 states and 146 transitions. [2020-10-20 03:11:10,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:10,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:10,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:10,908 INFO L225 Difference]: With dead ends: 91 [2020-10-20 03:11:10,909 INFO L226 Difference]: Without dead ends: 70 [2020-10-20 03:11:10,909 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:11:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-20 03:11:10,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2020-10-20 03:11:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-20 03:11:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 108 transitions. [2020-10-20 03:11:10,912 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 108 transitions. Word has length 16 [2020-10-20 03:11:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:10,913 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 108 transitions. [2020-10-20 03:11:10,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 108 transitions. [2020-10-20 03:11:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:10,914 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:10,914 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:10,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 03:11:10,914 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-20 03:11:10,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:10,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1400756409, now seen corresponding path program 3 times [2020-10-20 03:11:10,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:10,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648040511] [2020-10-20 03:11:10,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:11,118 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-20 03:11:11,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648040511] [2020-10-20 03:11:11,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:11,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 03:11:11,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124221613] [2020-10-20 03:11:11,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 03:11:11,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:11,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 03:11:11,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-20 03:11:11,121 INFO L87 Difference]: Start difference. First operand 66 states and 108 transitions. Second operand 9 states. [2020-10-20 03:11:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:11,588 INFO L93 Difference]: Finished difference Result 118 states and 181 transitions. [2020-10-20 03:11:11,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 03:11:11,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-20 03:11:11,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:11,591 INFO L225 Difference]: With dead ends: 118 [2020-10-20 03:11:11,591 INFO L226 Difference]: Without dead ends: 118 [2020-10-20 03:11:11,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2020-10-20 03:11:11,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-20 03:11:11,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 77. [2020-10-20 03:11:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-20 03:11:11,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 128 transitions. [2020-10-20 03:11:11,595 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 128 transitions. Word has length 16 [2020-10-20 03:11:11,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:11,595 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 128 transitions. [2020-10-20 03:11:11,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 03:11:11,595 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 128 transitions. [2020-10-20 03:11:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:11,596 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:11,596 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:11,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 03:11:11,596 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-20 03:11:11,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:11,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1400756371, now seen corresponding path program 4 times [2020-10-20 03:11:11,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:11,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190261699] [2020-10-20 03:11:11,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:11,914 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-20 03:11:11,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190261699] [2020-10-20 03:11:11,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:11,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:11,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858482837] [2020-10-20 03:11:11,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:11,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:11,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:11,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:11,916 INFO L87 Difference]: Start difference. First operand 77 states and 128 transitions. Second operand 10 states. [2020-10-20 03:11:12,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:12,264 INFO L93 Difference]: Finished difference Result 110 states and 181 transitions. [2020-10-20 03:11:12,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:12,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:12,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:12,266 INFO L225 Difference]: With dead ends: 110 [2020-10-20 03:11:12,266 INFO L226 Difference]: Without dead ends: 99 [2020-10-20 03:11:12,267 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:11:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-10-20 03:11:12,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2020-10-20 03:11:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-20 03:11:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 136 transitions. [2020-10-20 03:11:12,270 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 136 transitions. Word has length 16 [2020-10-20 03:11:12,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:12,270 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 136 transitions. [2020-10-20 03:11:12,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 136 transitions. [2020-10-20 03:11:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:12,271 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:12,272 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:12,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 03:11:12,272 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:11:12,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:12,272 INFO L82 PathProgramCache]: Analyzing trace with hash 330645179, now seen corresponding path program 5 times [2020-10-20 03:11:12,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:12,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661689468] [2020-10-20 03:11:12,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:11:12,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661689468] [2020-10-20 03:11:12,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:12,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:12,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136460362] [2020-10-20 03:11:12,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:12,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:12,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:12,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:12,614 INFO L87 Difference]: Start difference. First operand 81 states and 136 transitions. Second operand 10 states. [2020-10-20 03:11:12,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:12,993 INFO L93 Difference]: Finished difference Result 116 states and 191 transitions. [2020-10-20 03:11:12,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 03:11:12,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:12,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:12,995 INFO L225 Difference]: With dead ends: 116 [2020-10-20 03:11:12,995 INFO L226 Difference]: Without dead ends: 101 [2020-10-20 03:11:12,996 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:11:12,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-20 03:11:12,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 79. [2020-10-20 03:11:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-20 03:11:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 132 transitions. [2020-10-20 03:11:12,999 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 132 transitions. Word has length 16 [2020-10-20 03:11:12,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:12,999 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 132 transitions. [2020-10-20 03:11:12,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:12,999 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 132 transitions. [2020-10-20 03:11:13,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:13,000 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:13,000 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:13,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 03:11:13,000 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-20 03:11:13,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:13,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1002549257, now seen corresponding path program 6 times [2020-10-20 03:11:13,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:13,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505086059] [2020-10-20 03:11:13,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:13,322 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-20 03:11:13,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505086059] [2020-10-20 03:11:13,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:13,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:13,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500729504] [2020-10-20 03:11:13,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:13,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:13,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:13,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:13,324 INFO L87 Difference]: Start difference. First operand 79 states and 132 transitions. Second operand 10 states. [2020-10-20 03:11:13,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:13,697 INFO L93 Difference]: Finished difference Result 104 states and 167 transitions. [2020-10-20 03:11:13,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:13,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:13,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:13,698 INFO L225 Difference]: With dead ends: 104 [2020-10-20 03:11:13,698 INFO L226 Difference]: Without dead ends: 93 [2020-10-20 03:11:13,699 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:11:13,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-10-20 03:11:13,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2020-10-20 03:11:13,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-20 03:11:13,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 134 transitions. [2020-10-20 03:11:13,702 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 134 transitions. Word has length 16 [2020-10-20 03:11:13,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:13,702 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 134 transitions. [2020-10-20 03:11:13,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:13,702 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 134 transitions. [2020-10-20 03:11:13,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:13,703 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:13,703 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:13,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 03:11:13,703 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-20 03:11:13,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:13,703 INFO L82 PathProgramCache]: Analyzing trace with hash 615893921, now seen corresponding path program 7 times [2020-10-20 03:11:13,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:13,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709753471] [2020-10-20 03:11:13,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:14,025 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-20 03:11:14,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709753471] [2020-10-20 03:11:14,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:14,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:14,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690234183] [2020-10-20 03:11:14,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:14,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:14,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:14,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:14,027 INFO L87 Difference]: Start difference. First operand 81 states and 134 transitions. Second operand 10 states. [2020-10-20 03:11:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:14,430 INFO L93 Difference]: Finished difference Result 110 states and 177 transitions. [2020-10-20 03:11:14,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 03:11:14,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:14,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:14,431 INFO L225 Difference]: With dead ends: 110 [2020-10-20 03:11:14,432 INFO L226 Difference]: Without dead ends: 95 [2020-10-20 03:11:14,432 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:11:14,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-20 03:11:14,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 79. [2020-10-20 03:11:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-20 03:11:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 130 transitions. [2020-10-20 03:11:14,436 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 130 transitions. Word has length 16 [2020-10-20 03:11:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:14,436 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 130 transitions. [2020-10-20 03:11:14,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:14,437 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 130 transitions. [2020-10-20 03:11:14,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:14,437 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:14,437 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:14,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 03:11:14,437 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-20 03:11:14,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:14,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1037223855, now seen corresponding path program 8 times [2020-10-20 03:11:14,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:14,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504886962] [2020-10-20 03:11:14,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:14,867 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-20 03:11:14,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504886962] [2020-10-20 03:11:14,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:14,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:14,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579580326] [2020-10-20 03:11:14,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:14,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:14,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:14,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:14,870 INFO L87 Difference]: Start difference. First operand 79 states and 130 transitions. Second operand 10 states. [2020-10-20 03:11:15,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:15,504 INFO L93 Difference]: Finished difference Result 99 states and 159 transitions. [2020-10-20 03:11:15,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:15,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:15,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:15,506 INFO L225 Difference]: With dead ends: 99 [2020-10-20 03:11:15,506 INFO L226 Difference]: Without dead ends: 86 [2020-10-20 03:11:15,507 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:11:15,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-20 03:11:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2020-10-20 03:11:15,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-20 03:11:15,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 131 transitions. [2020-10-20 03:11:15,514 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 131 transitions. Word has length 16 [2020-10-20 03:11:15,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:15,515 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 131 transitions. [2020-10-20 03:11:15,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:15,519 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 131 transitions. [2020-10-20 03:11:15,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:15,519 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:15,520 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:15,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 03:11:15,520 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-20 03:11:15,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:15,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1150182227, now seen corresponding path program 9 times [2020-10-20 03:11:15,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:15,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883553714] [2020-10-20 03:11:15,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:16,012 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-20 03:11:16,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883553714] [2020-10-20 03:11:16,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:16,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:16,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344039113] [2020-10-20 03:11:16,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:16,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:16,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:16,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:16,018 INFO L87 Difference]: Start difference. First operand 80 states and 131 transitions. Second operand 10 states. [2020-10-20 03:11:16,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:16,562 INFO L93 Difference]: Finished difference Result 95 states and 151 transitions. [2020-10-20 03:11:16,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:16,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:16,563 INFO L225 Difference]: With dead ends: 95 [2020-10-20 03:11:16,563 INFO L226 Difference]: Without dead ends: 79 [2020-10-20 03:11:16,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:11:16,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-20 03:11:16,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2020-10-20 03:11:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-20 03:11:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 126 transitions. [2020-10-20 03:11:16,568 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 126 transitions. Word has length 16 [2020-10-20 03:11:16,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:16,568 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 126 transitions. [2020-10-20 03:11:16,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:16,568 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 126 transitions. [2020-10-20 03:11:16,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:16,569 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:16,569 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:16,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 03:11:16,570 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-20 03:11:16,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:16,570 INFO L82 PathProgramCache]: Analyzing trace with hash -123632883, now seen corresponding path program 10 times [2020-10-20 03:11:16,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:16,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996916420] [2020-10-20 03:11:16,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:16,951 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-20 03:11:16,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996916420] [2020-10-20 03:11:16,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:16,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:16,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243019356] [2020-10-20 03:11:16,952 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:16,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:16,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:16,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:16,953 INFO L87 Difference]: Start difference. First operand 77 states and 126 transitions. Second operand 10 states. [2020-10-20 03:11:17,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:17,371 INFO L93 Difference]: Finished difference Result 99 states and 158 transitions. [2020-10-20 03:11:17,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:17,372 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:17,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:17,373 INFO L225 Difference]: With dead ends: 99 [2020-10-20 03:11:17,374 INFO L226 Difference]: Without dead ends: 82 [2020-10-20 03:11:17,374 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:11:17,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-20 03:11:17,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2020-10-20 03:11:17,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-20 03:11:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 125 transitions. [2020-10-20 03:11:17,380 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 125 transitions. Word has length 16 [2020-10-20 03:11:17,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:17,381 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 125 transitions. [2020-10-20 03:11:17,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:17,381 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 125 transitions. [2020-10-20 03:11:17,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:17,382 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:17,383 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:17,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 03:11:17,383 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-20 03:11:17,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:17,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1031972303, now seen corresponding path program 11 times [2020-10-20 03:11:17,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:17,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656753354] [2020-10-20 03:11:17,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:17,729 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-20 03:11:17,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656753354] [2020-10-20 03:11:17,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:17,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:17,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623839720] [2020-10-20 03:11:17,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:17,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:17,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:17,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:17,731 INFO L87 Difference]: Start difference. First operand 77 states and 125 transitions. Second operand 10 states. [2020-10-20 03:11:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:18,130 INFO L93 Difference]: Finished difference Result 96 states and 152 transitions. [2020-10-20 03:11:18,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:18,131 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:18,133 INFO L225 Difference]: With dead ends: 96 [2020-10-20 03:11:18,133 INFO L226 Difference]: Without dead ends: 83 [2020-10-20 03:11:18,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:11:18,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-20 03:11:18,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2020-10-20 03:11:18,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-20 03:11:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 126 transitions. [2020-10-20 03:11:18,136 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 126 transitions. Word has length 16 [2020-10-20 03:11:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:18,136 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 126 transitions. [2020-10-20 03:11:18,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 126 transitions. [2020-10-20 03:11:18,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:18,137 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:18,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:18,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 03:11:18,138 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-20 03:11:18,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:18,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1144930675, now seen corresponding path program 12 times [2020-10-20 03:11:18,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:18,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965941718] [2020-10-20 03:11:18,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:18,435 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-20 03:11:18,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965941718] [2020-10-20 03:11:18,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:18,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:18,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821224551] [2020-10-20 03:11:18,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:18,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:18,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:18,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:18,439 INFO L87 Difference]: Start difference. First operand 78 states and 126 transitions. Second operand 10 states. [2020-10-20 03:11:18,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:18,833 INFO L93 Difference]: Finished difference Result 96 states and 151 transitions. [2020-10-20 03:11:18,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:18,834 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:18,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:18,835 INFO L225 Difference]: With dead ends: 96 [2020-10-20 03:11:18,835 INFO L226 Difference]: Without dead ends: 77 [2020-10-20 03:11:18,836 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:11:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-20 03:11:18,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2020-10-20 03:11:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-20 03:11:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 116 transitions. [2020-10-20 03:11:18,839 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 116 transitions. Word has length 16 [2020-10-20 03:11:18,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:18,839 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 116 transitions. [2020-10-20 03:11:18,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:18,839 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 116 transitions. [2020-10-20 03:11:18,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:18,840 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:18,840 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:18,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 03:11:18,840 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-20 03:11:18,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:18,841 INFO L82 PathProgramCache]: Analyzing trace with hash 23037531, now seen corresponding path program 13 times [2020-10-20 03:11:18,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:18,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730782922] [2020-10-20 03:11:18,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:19,113 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-20 03:11:19,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730782922] [2020-10-20 03:11:19,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:19,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:19,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436669359] [2020-10-20 03:11:19,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:19,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:19,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:19,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:19,117 INFO L87 Difference]: Start difference. First operand 72 states and 116 transitions. Second operand 10 states. [2020-10-20 03:11:19,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:19,525 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2020-10-20 03:11:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:19,526 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:19,527 INFO L225 Difference]: With dead ends: 95 [2020-10-20 03:11:19,527 INFO L226 Difference]: Without dead ends: 84 [2020-10-20 03:11:19,528 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-20 03:11:19,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-20 03:11:19,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2020-10-20 03:11:19,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-20 03:11:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 118 transitions. [2020-10-20 03:11:19,533 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 118 transitions. Word has length 16 [2020-10-20 03:11:19,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:19,533 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 118 transitions. [2020-10-20 03:11:19,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 118 transitions. [2020-10-20 03:11:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:19,534 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:19,535 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:19,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-20 03:11:19,535 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-20 03:11:19,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:19,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1641480709, now seen corresponding path program 14 times [2020-10-20 03:11:19,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:19,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911507145] [2020-10-20 03:11:19,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:19,822 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-20 03:11:19,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911507145] [2020-10-20 03:11:19,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:19,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:19,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506807402] [2020-10-20 03:11:19,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:19,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:19,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:19,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:19,824 INFO L87 Difference]: Start difference. First operand 74 states and 118 transitions. Second operand 10 states. [2020-10-20 03:11:20,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:20,275 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-10-20 03:11:20,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 03:11:20,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:20,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:20,277 INFO L225 Difference]: With dead ends: 97 [2020-10-20 03:11:20,277 INFO L226 Difference]: Without dead ends: 82 [2020-10-20 03:11:20,278 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-20 03:11:20,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-20 03:11:20,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2020-10-20 03:11:20,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-20 03:11:20,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 114 transitions. [2020-10-20 03:11:20,280 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 114 transitions. Word has length 16 [2020-10-20 03:11:20,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:20,280 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 114 transitions. [2020-10-20 03:11:20,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:20,281 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 114 transitions. [2020-10-20 03:11:20,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:20,281 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:20,281 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:20,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-20 03:11:20,282 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-20 03:11:20,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:20,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1892099271, now seen corresponding path program 1 times [2020-10-20 03:11:20,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:20,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860753201] [2020-10-20 03:11:20,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:20,400 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-20 03:11:20,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860753201] [2020-10-20 03:11:20,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:20,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 03:11:20,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784549582] [2020-10-20 03:11:20,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 03:11:20,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:20,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 03:11:20,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:11:20,402 INFO L87 Difference]: Start difference. First operand 72 states and 114 transitions. Second operand 8 states. [2020-10-20 03:11:20,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:20,676 INFO L93 Difference]: Finished difference Result 63 states and 95 transitions. [2020-10-20 03:11:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:20,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-20 03:11:20,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:20,677 INFO L225 Difference]: With dead ends: 63 [2020-10-20 03:11:20,677 INFO L226 Difference]: Without dead ends: 63 [2020-10-20 03:11:20,678 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:11:20,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-20 03:11:20,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2020-10-20 03:11:20,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-20 03:11:20,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2020-10-20 03:11:20,682 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 16 [2020-10-20 03:11:20,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:20,683 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2020-10-20 03:11:20,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 03:11:20,683 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2020-10-20 03:11:20,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:20,683 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:20,683 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:20,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-20 03:11:20,684 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-20 03:11:20,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:20,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1908784089, now seen corresponding path program 15 times [2020-10-20 03:11:20,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:20,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034552903] [2020-10-20 03:11:20,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:20,948 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-20 03:11:20,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034552903] [2020-10-20 03:11:20,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:20,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:20,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984157083] [2020-10-20 03:11:20,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:20,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:20,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:20,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:20,951 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand 10 states. [2020-10-20 03:11:21,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:21,351 INFO L93 Difference]: Finished difference Result 68 states and 97 transitions. [2020-10-20 03:11:21,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:21,352 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:21,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:21,353 INFO L225 Difference]: With dead ends: 68 [2020-10-20 03:11:21,353 INFO L226 Difference]: Without dead ends: 58 [2020-10-20 03:11:21,353 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-20 03:11:21,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-10-20 03:11:21,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2020-10-20 03:11:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-20 03:11:21,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2020-10-20 03:11:21,357 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 16 [2020-10-20 03:11:21,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:21,357 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2020-10-20 03:11:21,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:21,358 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2020-10-20 03:11:21,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:21,358 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:21,358 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:21,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-20 03:11:21,358 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-20 03:11:21,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:21,359 INFO L82 PathProgramCache]: Analyzing trace with hash -899896281, now seen corresponding path program 16 times [2020-10-20 03:11:21,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:21,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929688220] [2020-10-20 03:11:21,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:21,602 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-20 03:11:21,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929688220] [2020-10-20 03:11:21,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:21,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:21,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724554269] [2020-10-20 03:11:21,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:21,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:21,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:21,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:21,604 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. Second operand 10 states. [2020-10-20 03:11:21,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:21,961 INFO L93 Difference]: Finished difference Result 79 states and 113 transitions. [2020-10-20 03:11:21,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:21,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:21,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:21,962 INFO L225 Difference]: With dead ends: 79 [2020-10-20 03:11:21,963 INFO L226 Difference]: Without dead ends: 68 [2020-10-20 03:11:21,963 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-20 03:11:21,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-20 03:11:21,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2020-10-20 03:11:21,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-20 03:11:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2020-10-20 03:11:21,966 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 16 [2020-10-20 03:11:21,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:21,966 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2020-10-20 03:11:21,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2020-10-20 03:11:21,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:21,967 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:21,967 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:21,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-20 03:11:21,967 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-20 03:11:21,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:21,971 INFO L82 PathProgramCache]: Analyzing trace with hash 831505269, now seen corresponding path program 17 times [2020-10-20 03:11:21,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:21,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986984107] [2020-10-20 03:11:21,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:22,231 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-20 03:11:22,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986984107] [2020-10-20 03:11:22,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:22,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:22,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226032047] [2020-10-20 03:11:22,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:22,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:22,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:22,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:22,232 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand 10 states. [2020-10-20 03:11:22,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:22,616 INFO L93 Difference]: Finished difference Result 79 states and 112 transitions. [2020-10-20 03:11:22,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 03:11:22,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:22,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:22,618 INFO L225 Difference]: With dead ends: 79 [2020-10-20 03:11:22,618 INFO L226 Difference]: Without dead ends: 64 [2020-10-20 03:11:22,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-10-20 03:11:22,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-20 03:11:22,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2020-10-20 03:11:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-20 03:11:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2020-10-20 03:11:22,621 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 16 [2020-10-20 03:11:22,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:22,621 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2020-10-20 03:11:22,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:22,621 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2020-10-20 03:11:22,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:22,622 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:22,622 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:22,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-20 03:11:22,623 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-20 03:11:22,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:22,623 INFO L82 PathProgramCache]: Analyzing trace with hash -501689167, now seen corresponding path program 18 times [2020-10-20 03:11:22,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:22,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771274090] [2020-10-20 03:11:22,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:22,869 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-20 03:11:22,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771274090] [2020-10-20 03:11:22,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:22,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:22,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471100073] [2020-10-20 03:11:22,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:22,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:22,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:22,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:22,870 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand 10 states. [2020-10-20 03:11:23,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:23,219 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2020-10-20 03:11:23,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:23,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:23,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:23,220 INFO L225 Difference]: With dead ends: 70 [2020-10-20 03:11:23,220 INFO L226 Difference]: Without dead ends: 59 [2020-10-20 03:11:23,221 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-20 03:11:23,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-20 03:11:23,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2020-10-20 03:11:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-20 03:11:23,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2020-10-20 03:11:23,223 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 16 [2020-10-20 03:11:23,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:23,223 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2020-10-20 03:11:23,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:23,224 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2020-10-20 03:11:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:23,224 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:23,224 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:23,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-20 03:11:23,224 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:11:23,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:23,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1116754011, now seen corresponding path program 19 times [2020-10-20 03:11:23,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:23,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820139692] [2020-10-20 03:11:23,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:23,522 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-20 03:11:23,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820139692] [2020-10-20 03:11:23,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:23,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:23,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688127538] [2020-10-20 03:11:23,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:23,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:23,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:23,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:23,525 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 10 states. [2020-10-20 03:11:23,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:23,927 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2020-10-20 03:11:23,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 03:11:23,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:23,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:23,929 INFO L225 Difference]: With dead ends: 66 [2020-10-20 03:11:23,929 INFO L226 Difference]: Without dead ends: 57 [2020-10-20 03:11:23,929 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-10-20 03:11:23,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-20 03:11:23,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2020-10-20 03:11:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-10-20 03:11:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2020-10-20 03:11:23,931 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 16 [2020-10-20 03:11:23,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:23,932 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2020-10-20 03:11:23,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2020-10-20 03:11:23,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:23,933 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:23,933 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:23,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-20 03:11:23,933 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:11:23,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:23,933 INFO L82 PathProgramCache]: Analyzing trace with hash -536363765, now seen corresponding path program 20 times [2020-10-20 03:11:23,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:23,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025110155] [2020-10-20 03:11:23,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:24,192 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-20 03:11:24,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025110155] [2020-10-20 03:11:24,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:24,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:24,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379352662] [2020-10-20 03:11:24,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:24,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:24,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:24,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:24,194 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand 10 states. [2020-10-20 03:11:24,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:24,621 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2020-10-20 03:11:24,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:24,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:24,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:24,623 INFO L225 Difference]: With dead ends: 59 [2020-10-20 03:11:24,623 INFO L226 Difference]: Without dead ends: 49 [2020-10-20 03:11:24,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-20 03:11:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-10-20 03:11:24,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2020-10-20 03:11:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-20 03:11:24,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2020-10-20 03:11:24,626 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 16 [2020-10-20 03:11:24,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:24,626 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2020-10-20 03:11:24,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2020-10-20 03:11:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:24,626 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:24,626 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:24,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-20 03:11:24,627 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:11:24,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:24,627 INFO L82 PathProgramCache]: Analyzing trace with hash -649322137, now seen corresponding path program 21 times [2020-10-20 03:11:24,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:24,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481784364] [2020-10-20 03:11:24,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:24,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:11:24,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481784364] [2020-10-20 03:11:24,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:24,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:24,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340409802] [2020-10-20 03:11:24,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:24,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:24,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:24,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:24,883 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand 10 states. [2020-10-20 03:11:25,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:25,291 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2020-10-20 03:11:25,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:25,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:25,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:25,292 INFO L225 Difference]: With dead ends: 55 [2020-10-20 03:11:25,293 INFO L226 Difference]: Without dead ends: 45 [2020-10-20 03:11:25,296 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-20 03:11:25,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-10-20 03:11:25,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2020-10-20 03:11:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-20 03:11:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2020-10-20 03:11:25,298 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 16 [2020-10-20 03:11:25,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:25,298 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2020-10-20 03:11:25,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2020-10-20 03:11:25,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:25,298 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:25,299 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:25,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-20 03:11:25,299 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:11:25,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:25,299 INFO L82 PathProgramCache]: Analyzing trace with hash -822569829, now seen corresponding path program 22 times [2020-10-20 03:11:25,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:25,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902307484] [2020-10-20 03:11:25,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:25,548 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-20 03:11:25,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902307484] [2020-10-20 03:11:25,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:25,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:25,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729762215] [2020-10-20 03:11:25,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:25,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:25,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:25,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:25,550 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 10 states. [2020-10-20 03:11:25,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:25,902 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2020-10-20 03:11:25,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:25,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:25,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:25,903 INFO L225 Difference]: With dead ends: 51 [2020-10-20 03:11:25,903 INFO L226 Difference]: Without dead ends: 43 [2020-10-20 03:11:25,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-10-20 03:11:25,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-20 03:11:25,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-10-20 03:11:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-20 03:11:25,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2020-10-20 03:11:25,905 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2020-10-20 03:11:25,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:25,905 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-10-20 03:11:25,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:25,906 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2020-10-20 03:11:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:25,906 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:25,907 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:25,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-20 03:11:25,907 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:11:25,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:25,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1074577193, now seen corresponding path program 23 times [2020-10-20 03:11:25,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:25,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974407054] [2020-10-20 03:11:25,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:26,134 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-20 03:11:26,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974407054] [2020-10-20 03:11:26,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:26,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:26,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342890612] [2020-10-20 03:11:26,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:26,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:26,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:26,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:26,136 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 10 states. [2020-10-20 03:11:26,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:26,525 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2020-10-20 03:11:26,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:26,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:26,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:26,526 INFO L225 Difference]: With dead ends: 53 [2020-10-20 03:11:26,526 INFO L226 Difference]: Without dead ends: 43 [2020-10-20 03:11:26,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-20 03:11:26,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-20 03:11:26,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-10-20 03:11:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-20 03:11:26,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2020-10-20 03:11:26,528 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 16 [2020-10-20 03:11:26,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:26,528 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2020-10-20 03:11:26,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2020-10-20 03:11:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:26,529 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:26,529 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:26,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-20 03:11:26,529 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:11:26,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:26,529 INFO L82 PathProgramCache]: Analyzing trace with hash 961618821, now seen corresponding path program 24 times [2020-10-20 03:11:26,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:26,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563271561] [2020-10-20 03:11:26,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:26,787 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-20 03:11:26,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563271561] [2020-10-20 03:11:26,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:26,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:26,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550025041] [2020-10-20 03:11:26,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:26,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:26,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:26,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:26,789 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand 10 states. [2020-10-20 03:11:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:27,175 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2020-10-20 03:11:27,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:27,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:27,177 INFO L225 Difference]: With dead ends: 49 [2020-10-20 03:11:27,178 INFO L226 Difference]: Without dead ends: 38 [2020-10-20 03:11:27,178 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-20 03:11:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-10-20 03:11:27,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-10-20 03:11:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-10-20 03:11:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2020-10-20 03:11:27,180 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 16 [2020-10-20 03:11:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:27,180 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2020-10-20 03:11:27,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:27,180 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2020-10-20 03:11:27,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:27,181 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:27,181 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:27,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-20 03:11:27,181 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:11:27,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:27,182 INFO L82 PathProgramCache]: Analyzing trace with hash 540025319, now seen corresponding path program 25 times [2020-10-20 03:11:27,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:27,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340775242] [2020-10-20 03:11:27,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:27,460 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-20 03:11:27,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340775242] [2020-10-20 03:11:27,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:27,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:27,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808037944] [2020-10-20 03:11:27,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:27,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:27,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:27,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:27,462 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand 10 states. [2020-10-20 03:11:27,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:27,847 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-10-20 03:11:27,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:27,848 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:27,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:27,849 INFO L225 Difference]: With dead ends: 38 [2020-10-20 03:11:27,849 INFO L226 Difference]: Without dead ends: 24 [2020-10-20 03:11:27,849 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-10-20 03:11:27,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-10-20 03:11:27,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-20 03:11:27,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-20 03:11:27,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-10-20 03:11:27,851 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2020-10-20 03:11:27,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:27,852 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-10-20 03:11:27,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-10-20 03:11:27,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:27,853 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:27,853 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:27,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-20 03:11:27,853 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:11:27,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:27,853 INFO L82 PathProgramCache]: Analyzing trace with hash -368314139, now seen corresponding path program 4 times [2020-10-20 03:11:27,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:27,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131425444] [2020-10-20 03:11:27,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:28,112 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-20 03:11:28,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131425444] [2020-10-20 03:11:28,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:28,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 03:11:28,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091913222] [2020-10-20 03:11:28,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 03:11:28,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:28,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 03:11:28,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-20 03:11:28,113 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 9 states. [2020-10-20 03:11:28,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:28,392 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2020-10-20 03:11:28,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:28,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-20 03:11:28,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:28,393 INFO L225 Difference]: With dead ends: 23 [2020-10-20 03:11:28,393 INFO L226 Difference]: Without dead ends: 23 [2020-10-20 03:11:28,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:11:28,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-10-20 03:11:28,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-10-20 03:11:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-20 03:11:28,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2020-10-20 03:11:28,394 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 16 [2020-10-20 03:11:28,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:28,395 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-10-20 03:11:28,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 03:11:28,395 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2020-10-20 03:11:28,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:28,395 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:28,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:28,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-20 03:11:28,396 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:11:28,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:28,396 INFO L82 PathProgramCache]: Analyzing trace with hash -368314101, now seen corresponding path program 26 times [2020-10-20 03:11:28,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:28,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928797162] [2020-10-20 03:11:28,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:28,668 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-20 03:11:28,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928797162] [2020-10-20 03:11:28,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:28,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:28,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376478228] [2020-10-20 03:11:28,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:28,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:28,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:28,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:28,670 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 10 states. [2020-10-20 03:11:28,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:28,984 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2020-10-20 03:11:28,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:28,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:28,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:28,985 INFO L225 Difference]: With dead ends: 35 [2020-10-20 03:11:28,985 INFO L226 Difference]: Without dead ends: 25 [2020-10-20 03:11:28,986 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-20 03:11:28,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-20 03:11:28,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-10-20 03:11:28,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-20 03:11:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-10-20 03:11:28,987 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2020-10-20 03:11:28,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:28,988 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-10-20 03:11:28,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:28,988 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-10-20 03:11:28,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:28,988 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:28,988 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:28,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-20 03:11:28,988 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:11:28,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:28,989 INFO L82 PathProgramCache]: Analyzing trace with hash -481272473, now seen corresponding path program 27 times [2020-10-20 03:11:28,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:28,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614421347] [2020-10-20 03:11:28,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:29,243 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-20 03:11:29,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614421347] [2020-10-20 03:11:29,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:29,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:29,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395442716] [2020-10-20 03:11:29,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:29,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:29,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:29,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:29,245 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 10 states. [2020-10-20 03:11:29,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:29,701 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-10-20 03:11:29,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:29,702 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:29,702 INFO L225 Difference]: With dead ends: 31 [2020-10-20 03:11:29,703 INFO L226 Difference]: Without dead ends: 22 [2020-10-20 03:11:29,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-20 03:11:29,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-10-20 03:11:29,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-10-20 03:11:29,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-20 03:11:29,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-10-20 03:11:29,706 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2020-10-20 03:11:29,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:29,707 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-10-20 03:11:29,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:29,707 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-10-20 03:11:29,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:29,708 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:29,708 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:29,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-20 03:11:29,708 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:11:29,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:29,711 INFO L82 PathProgramCache]: Analyzing trace with hash -659771717, now seen corresponding path program 28 times [2020-10-20 03:11:29,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:29,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483323006] [2020-10-20 03:11:29,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:29,950 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-20 03:11:29,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483323006] [2020-10-20 03:11:29,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:29,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:29,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297434745] [2020-10-20 03:11:29,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:29,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:29,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:29,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:29,951 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 10 states. [2020-10-20 03:11:30,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:30,203 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2020-10-20 03:11:30,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:30,203 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:30,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:30,204 INFO L225 Difference]: With dead ends: 29 [2020-10-20 03:11:30,204 INFO L226 Difference]: Without dead ends: 21 [2020-10-20 03:11:30,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-10-20 03:11:30,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-10-20 03:11:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-10-20 03:11:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-20 03:11:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-10-20 03:11:30,206 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2020-10-20 03:11:30,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:30,206 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-10-20 03:11:30,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-10-20 03:11:30,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:30,207 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:30,207 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:30,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-20 03:11:30,207 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:11:30,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:30,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1237375305, now seen corresponding path program 29 times [2020-10-20 03:11:30,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:30,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137794549] [2020-10-20 03:11:30,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:30,432 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-20 03:11:30,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137794549] [2020-10-20 03:11:30,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:30,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:30,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520952485] [2020-10-20 03:11:30,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:30,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:30,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:30,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:30,434 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 10 states. [2020-10-20 03:11:30,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:30,845 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-10-20 03:11:30,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:30,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:30,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:30,846 INFO L225 Difference]: With dead ends: 27 [2020-10-20 03:11:30,846 INFO L226 Difference]: Without dead ends: 17 [2020-10-20 03:11:30,847 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-20 03:11:30,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-10-20 03:11:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-10-20 03:11:30,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-20 03:11:30,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2020-10-20 03:11:30,849 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 16 [2020-10-20 03:11:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:30,849 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2020-10-20 03:11:30,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2020-10-20 03:11:30,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:11:30,850 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:11:30,850 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:11:30,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-20 03:11:30,851 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:11:30,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:11:30,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1124416933, now seen corresponding path program 30 times [2020-10-20 03:11:30,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:11:30,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118930428] [2020-10-20 03:11:30,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:11:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:11:31,194 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-20 03:11:31,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118930428] [2020-10-20 03:11:31,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:11:31,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:11:31,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845150794] [2020-10-20 03:11:31,196 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:11:31,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:11:31,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:11:31,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:11:31,197 INFO L87 Difference]: Start difference. First operand 17 states and 16 transitions. Second operand 10 states. [2020-10-20 03:11:31,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:11:31,513 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-10-20 03:11:31,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:11:31,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-20 03:11:31,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:11:31,514 INFO L225 Difference]: With dead ends: 16 [2020-10-20 03:11:31,514 INFO L226 Difference]: Without dead ends: 0 [2020-10-20 03:11:31,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-20 03:11:31,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-20 03:11:31,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-20 03:11:31,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-20 03:11:31,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-20 03:11:31,515 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2020-10-20 03:11:31,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:11:31,515 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 03:11:31,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:11:31,516 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-20 03:11:31,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-20 03:11:31,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-20 03:11:31,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 03:11:31 BasicIcfg [2020-10-20 03:11:31,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 03:11:31,520 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 03:11:31,521 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 03:11:31,521 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 03:11:31,522 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:10:14" (3/4) ... [2020-10-20 03:11:31,525 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-20 03:11:31,532 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2020-10-20 03:11:31,539 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2020-10-20 03:11:31,540 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-10-20 03:11:31,540 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 03:11:31,541 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 03:11:31,596 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 03:11:31,596 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 03:11:31,598 INFO L168 Benchmark]: Toolchain (without parser) took 79590.37 ms. Allocated memory was 34.6 MB in the beginning and 147.3 MB in the end (delta: 112.7 MB). Free memory was 8.2 MB in the beginning and 37.4 MB in the end (delta: -29.3 MB). Peak memory consumption was 83.4 MB. Max. memory is 14.3 GB. [2020-10-20 03:11:31,599 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 33.6 MB. Free memory was 18.6 MB in the beginning and 18.5 MB in the end (delta: 41.7 kB). Peak memory consumption was 41.7 kB. Max. memory is 14.3 GB. [2020-10-20 03:11:31,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1682.12 ms. Allocated memory was 34.6 MB in the beginning and 64.0 MB in the end (delta: 29.4 MB). Free memory was 7.3 MB in the beginning and 39.7 MB in the end (delta: -32.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 14.3 GB. [2020-10-20 03:11:31,599 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.66 ms. Allocated memory is still 64.0 MB. Free memory was 39.7 MB in the beginning and 36.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.3 GB. [2020-10-20 03:11:31,600 INFO L168 Benchmark]: Boogie Preprocessor took 93.14 ms. Allocated memory is still 64.0 MB. Free memory was 36.3 MB in the beginning and 33.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.3 GB. [2020-10-20 03:11:31,600 INFO L168 Benchmark]: RCFGBuilder took 803.20 ms. Allocated memory was 64.0 MB in the beginning and 67.6 MB in the end (delta: 3.7 MB). Free memory was 33.0 MB in the beginning and 31.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 19.5 MB. Max. memory is 14.3 GB. [2020-10-20 03:11:31,601 INFO L168 Benchmark]: TraceAbstraction took 76791.63 ms. Allocated memory was 67.6 MB in the beginning and 147.3 MB in the end (delta: 79.7 MB). Free memory was 31.2 MB in the beginning and 41.9 MB in the end (delta: -10.7 MB). Peak memory consumption was 69.0 MB. Max. memory is 14.3 GB. [2020-10-20 03:11:31,601 INFO L168 Benchmark]: Witness Printer took 76.03 ms. Allocated memory is still 147.3 MB. Free memory was 41.9 MB in the beginning and 37.4 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 14.3 GB. [2020-10-20 03:11:31,603 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 33.6 MB. Free memory was 18.6 MB in the beginning and 18.5 MB in the end (delta: 41.7 kB). Peak memory consumption was 41.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 1682.12 ms. Allocated memory was 34.6 MB in the beginning and 64.0 MB in the end (delta: 29.4 MB). Free memory was 7.3 MB in the beginning and 39.7 MB in the end (delta: -32.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 132.66 ms. Allocated memory is still 64.0 MB. Free memory was 39.7 MB in the beginning and 36.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 93.14 ms. Allocated memory is still 64.0 MB. Free memory was 36.3 MB in the beginning and 33.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.3 GB. * RCFGBuilder took 803.20 ms. Allocated memory was 64.0 MB in the beginning and 67.6 MB in the end (delta: 3.7 MB). Free memory was 33.0 MB in the beginning and 31.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 19.5 MB. Max. memory is 14.3 GB. * TraceAbstraction took 76791.63 ms. Allocated memory was 67.6 MB in the beginning and 147.3 MB in the end (delta: 79.7 MB). Free memory was 31.2 MB in the beginning and 41.9 MB in the end (delta: -10.7 MB). Peak memory consumption was 69.0 MB. Max. memory is 14.3 GB. * Witness Printer took 76.03 ms. Allocated memory is still 147.3 MB. Free memory was 41.9 MB in the beginning and 37.4 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1252 VarBasedMoverChecksPositive, 51 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 30 SemBasedMoverChecksNegative, 17 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 38.7s, 30 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 51.1s, 168 PlacesBefore, 34 PlacesAfterwards, 178 TransitionsBefore, 32 TransitionsAfterwards, 1872 CoEnabledTransitionPairs, 8 FixpointIterations, 112 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 22 TrivialYvCompositions, 24 ConcurrentYvCompositions, 12 ChoiceCompositions, 222 TotalNumberOfCompositions, 3600 MoverChecksTotal - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 153 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 76.6s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 51.1s, HoareTripleCheckerStatistics: 617 SDtfs, 551 SDslu, 1999 SDs, 0 SdLazy, 5154 SolverSat, 580 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 415 GetRequests, 27 SyntacticMatches, 12 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred 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.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 282 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 581 NumberOfCodeBlocks, 581 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 542 ConstructedInterpolants, 0 QuantifiedInterpolants, 167514 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...