/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:43:40,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:43:40,829 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:43:40,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:43:40,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:43:40,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:43:40,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:43:40,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:43:40,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:43:40,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:43:40,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:43:40,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:43:40,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:43:40,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:43:40,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:43:40,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:43:40,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:43:40,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:43:40,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:43:40,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:43:40,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:43:40,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:43:40,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:43:40,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:43:40,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:43:40,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:43:40,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:43:40,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:43:40,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:43:40,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:43:40,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:43:40,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:43:40,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:43:40,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:43:40,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:43:40,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:43:40,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:43:40,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:43:40,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:43:40,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:43:40,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:43:40,939 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:43:40,980 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:43:40,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:43:40,981 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:43:40,982 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:43:40,982 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:43:40,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:43:40,982 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:43:40,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:43:40,983 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:43:40,983 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:43:40,983 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:43:40,988 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:43:40,989 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:43:40,989 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:43:40,989 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:43:40,989 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:43:40,989 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:43:40,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:43:40,990 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:43:40,990 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:43:40,990 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:43:40,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:43:40,991 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:43:40,991 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:43:40,991 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:43:40,991 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:43:40,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:43:40,992 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:43:40,992 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:43:41,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:43:41,282 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:43:41,285 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:43:41,287 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:43:41,287 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:43:41,288 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-10-05 23:43:41,350 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a66f4784/d455ae7c23c1433285895035c7420c42/FLAG28ca86dda [2020-10-05 23:43:42,000 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:43:42,001 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-10-05 23:43:42,030 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a66f4784/d455ae7c23c1433285895035c7420c42/FLAG28ca86dda [2020-10-05 23:43:42,201 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a66f4784/d455ae7c23c1433285895035c7420c42 [2020-10-05 23:43:42,212 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:43:42,214 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:43:42,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:43:42,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:43:42,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:43:42,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:43:42" (1/1) ... [2020-10-05 23:43:42,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@604ba911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:42, skipping insertion in model container [2020-10-05 23:43:42,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:43:42" (1/1) ... [2020-10-05 23:43:42,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:43:42,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:43:43,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:43:43,134 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:43:43,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:43:43,651 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:43:43,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:43 WrapperNode [2020-10-05 23:43:43,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:43:43,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:43:43,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:43:43,655 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:43:43,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:43" (1/1) ... [2020-10-05 23:43:43,699 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:43" (1/1) ... [2020-10-05 23:43:43,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:43:43,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:43:43,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:43:43,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:43:43,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:43" (1/1) ... [2020-10-05 23:43:43,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:43" (1/1) ... [2020-10-05 23:43:43,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:43" (1/1) ... [2020-10-05 23:43:43,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:43" (1/1) ... [2020-10-05 23:43:43,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:43" (1/1) ... [2020-10-05 23:43:43,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:43" (1/1) ... [2020-10-05 23:43:43,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:43" (1/1) ... [2020-10-05 23:43:43,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:43:43,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:43:43,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:43:43,790 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:43:43,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:43:43,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:43:43,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-05 23:43:43,881 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-05 23:43:43,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-05 23:43:43,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:43:43,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:43:43,883 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-05 23:43:43,883 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-05 23:43:43,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:43:43,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:43:43,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-05 23:43:43,888 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:43:44,492 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:43:44,493 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-05 23:43:44,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:43:44 BoogieIcfgContainer [2020-10-05 23:43:44,498 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:43:44,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:43:44,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:43:44,504 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:43:44,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:43:42" (1/3) ... [2020-10-05 23:43:44,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5f35c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:43:44, skipping insertion in model container [2020-10-05 23:43:44,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:43" (2/3) ... [2020-10-05 23:43:44,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5f35c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:43:44, skipping insertion in model container [2020-10-05 23:43:44,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:43:44" (3/3) ... [2020-10-05 23:43:44,508 INFO L109 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2020-10-05 23:43:44,519 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:43:44,519 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:43:44,527 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-05 23:43:44,528 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:43:44,565 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,565 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,565 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,566 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,566 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,566 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,567 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,567 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,567 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,567 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,568 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,568 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,568 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,568 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,569 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,569 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,569 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,569 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,570 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,570 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,570 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,571 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,571 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,571 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,571 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,572 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,572 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,572 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,572 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,573 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,573 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,573 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,573 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,574 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,574 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,574 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,574 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,575 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,575 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,575 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,575 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,576 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,576 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,576 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,577 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,577 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,577 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,577 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,578 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,578 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,578 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,578 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,579 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,579 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,579 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,580 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,580 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,580 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,584 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,585 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,585 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,585 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,585 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,586 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,586 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,586 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,586 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,587 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,594 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,594 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,595 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,595 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,595 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,595 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,595 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,596 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,596 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,596 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:44,621 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-05 23:43:44,645 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:43:44,646 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:43:44,646 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:43:44,646 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:43:44,646 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:43:44,647 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:43:44,647 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:43:44,647 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:43:44,668 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 154 transitions, 330 flow [2020-10-05 23:43:44,671 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions, 330 flow [2020-10-05 23:43:44,768 INFO L129 PetriNetUnfolder]: 11/192 cut-off events. [2020-10-05 23:43:44,769 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-05 23:43:44,775 INFO L80 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2020-10-05 23:43:44,781 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions, 330 flow [2020-10-05 23:43:44,817 INFO L129 PetriNetUnfolder]: 11/192 cut-off events. [2020-10-05 23:43:44,817 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-05 23:43:44,818 INFO L80 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2020-10-05 23:43:44,821 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2652 [2020-10-05 23:43:44,822 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:43:45,823 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-05 23:43:45,861 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 23:43:45,866 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-05 23:43:45,893 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 23:43:45,894 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-05 23:43:45,895 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:78 [2020-10-05 23:43:46,725 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-10-05 23:43:47,354 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-05 23:43:47,378 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 23:43:47,384 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-05 23:43:47,397 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 23:43:47,399 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-05 23:43:47,400 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2020-10-05 23:43:47,925 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2020-10-05 23:43:48,892 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2020-10-05 23:43:49,024 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-05 23:43:49,412 WARN L193 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2020-10-05 23:43:49,436 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-05 23:43:49,565 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-05 23:43:49,567 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 23:43:49,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-05 23:43:49,779 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-05 23:43:49,780 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 23:43:49,781 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-05 23:43:49,782 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:187, output treesize:199 [2020-10-05 23:43:49,954 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-05 23:43:51,140 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-10-05 23:43:51,579 WARN L193 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-05 23:43:52,125 WARN L193 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-10-05 23:43:52,395 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-05 23:43:52,410 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5194 [2020-10-05 23:43:52,411 INFO L214 etLargeBlockEncoding]: Total number of compositions: 168 [2020-10-05 23:43:52,414 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 38 transitions, 98 flow [2020-10-05 23:43:52,441 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 388 states. [2020-10-05 23:43:52,443 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states. [2020-10-05 23:43:52,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-05 23:43:52,450 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:52,450 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-10-05 23:43:52,451 INFO L427 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-05 23:43:52,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:52,456 INFO L82 PathProgramCache]: Analyzing trace with hash 560, now seen corresponding path program 1 times [2020-10-05 23:43:52,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:52,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323857741] [2020-10-05 23:43:52,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:52,740 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-05 23:43:52,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323857741] [2020-10-05 23:43:52,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:52,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-05 23:43:52,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640103290] [2020-10-05 23:43:52,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-05 23:43:52,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:52,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-05 23:43:52,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-05 23:43:52,762 INFO L87 Difference]: Start difference. First operand 388 states. Second operand 2 states. [2020-10-05 23:43:52,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:52,793 INFO L93 Difference]: Finished difference Result 386 states and 932 transitions. [2020-10-05 23:43:52,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-05 23:43:52,795 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-05 23:43:52,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:52,811 INFO L225 Difference]: With dead ends: 386 [2020-10-05 23:43:52,811 INFO L226 Difference]: Without dead ends: 348 [2020-10-05 23:43:52,813 INFO L675 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-05 23:43:52,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2020-10-05 23:43:52,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2020-10-05 23:43:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-10-05 23:43:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 834 transitions. [2020-10-05 23:43:52,903 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 834 transitions. Word has length 1 [2020-10-05 23:43:52,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:52,904 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 834 transitions. [2020-10-05 23:43:52,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-05 23:43:52,904 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 834 transitions. [2020-10-05 23:43:52,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-05 23:43:52,904 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:52,904 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-05 23:43:52,905 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:43:52,905 INFO L427 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-05 23:43:52,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:52,906 INFO L82 PathProgramCache]: Analyzing trace with hash 17264254, now seen corresponding path program 1 times [2020-10-05 23:43:52,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:52,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35549785] [2020-10-05 23:43:52,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:53,141 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-05 23:43:53,142 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35549785] [2020-10-05 23:43:53,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:53,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:43:53,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088329850] [2020-10-05 23:43:53,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:43:53,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:53,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:43:53,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:43:53,144 INFO L87 Difference]: Start difference. First operand 348 states and 834 transitions. Second operand 3 states. [2020-10-05 23:43:53,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:53,250 INFO L93 Difference]: Finished difference Result 471 states and 1125 transitions. [2020-10-05 23:43:53,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:43:53,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-05 23:43:53,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:53,257 INFO L225 Difference]: With dead ends: 471 [2020-10-05 23:43:53,257 INFO L226 Difference]: Without dead ends: 471 [2020-10-05 23:43:53,259 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:43:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2020-10-05 23:43:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 407. [2020-10-05 23:43:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-10-05 23:43:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 989 transitions. [2020-10-05 23:43:53,296 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 989 transitions. Word has length 4 [2020-10-05 23:43:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:53,297 INFO L479 AbstractCegarLoop]: Abstraction has 407 states and 989 transitions. [2020-10-05 23:43:53,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:43:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 989 transitions. [2020-10-05 23:43:53,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 23:43:53,298 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:53,298 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 23:43:53,298 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:43:53,298 INFO L427 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-05 23:43:53,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:53,299 INFO L82 PathProgramCache]: Analyzing trace with hash 535191473, now seen corresponding path program 1 times [2020-10-05 23:43:53,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:53,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753457183] [2020-10-05 23:43:53,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:53,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:43:53,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753457183] [2020-10-05 23:43:53,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:53,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:43:53,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429318452] [2020-10-05 23:43:53,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:43:53,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:53,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:43:53,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:43:53,382 INFO L87 Difference]: Start difference. First operand 407 states and 989 transitions. Second operand 3 states. [2020-10-05 23:43:53,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:53,472 INFO L93 Difference]: Finished difference Result 498 states and 1196 transitions. [2020-10-05 23:43:53,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:43:53,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 23:43:53,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:53,477 INFO L225 Difference]: With dead ends: 498 [2020-10-05 23:43:53,478 INFO L226 Difference]: Without dead ends: 482 [2020-10-05 23:43:53,478 INFO L675 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-05 23:43:53,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-10-05 23:43:53,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 450. [2020-10-05 23:43:53,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-05 23:43:53,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1111 transitions. [2020-10-05 23:43:53,502 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1111 transitions. Word has length 5 [2020-10-05 23:43:53,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:53,503 INFO L479 AbstractCegarLoop]: Abstraction has 450 states and 1111 transitions. [2020-10-05 23:43:53,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:43:53,503 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1111 transitions. [2020-10-05 23:43:53,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 23:43:53,505 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:53,505 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:53,505 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:43:53,505 INFO L427 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-05 23:43:53,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:53,506 INFO L82 PathProgramCache]: Analyzing trace with hash -40110202, now seen corresponding path program 1 times [2020-10-05 23:43:53,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:53,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382749479] [2020-10-05 23:43:53,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:53,583 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-05 23:43:53,584 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382749479] [2020-10-05 23:43:53,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:53,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:43:53,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227548455] [2020-10-05 23:43:53,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:43:53,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:53,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:43:53,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:43:53,585 INFO L87 Difference]: Start difference. First operand 450 states and 1111 transitions. Second operand 3 states. [2020-10-05 23:43:53,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:53,603 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-10-05 23:43:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:43:53,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-05 23:43:53,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:53,605 INFO L225 Difference]: With dead ends: 162 [2020-10-05 23:43:53,605 INFO L226 Difference]: Without dead ends: 162 [2020-10-05 23:43:53,605 INFO L675 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-05 23:43:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-05 23:43:53,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-10-05 23:43:53,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-05 23:43:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-10-05 23:43:53,610 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-10-05 23:43:53,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:53,611 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-10-05 23:43:53,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:43:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-10-05 23:43:53,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:43:53,613 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:53,613 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:53,613 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:43:53,614 INFO L427 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-05 23:43:53,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:53,614 INFO L82 PathProgramCache]: Analyzing trace with hash 52394444, now seen corresponding path program 1 times [2020-10-05 23:43:53,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:53,615 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209319797] [2020-10-05 23:43:53,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:53,748 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-05 23:43:53,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209319797] [2020-10-05 23:43:53,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:53,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:43:53,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271717470] [2020-10-05 23:43:53,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:43:53,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:53,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:43:53,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:43:53,751 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 6 states. [2020-10-05 23:43:53,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:53,947 INFO L93 Difference]: Finished difference Result 206 states and 427 transitions. [2020-10-05 23:43:53,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:43:53,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-05 23:43:53,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:53,950 INFO L225 Difference]: With dead ends: 206 [2020-10-05 23:43:53,950 INFO L226 Difference]: Without dead ends: 206 [2020-10-05 23:43:53,950 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:43:53,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-10-05 23:43:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2020-10-05 23:43:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-10-05 23:43:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 405 transitions. [2020-10-05 23:43:53,957 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 405 transitions. Word has length 22 [2020-10-05 23:43:53,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:53,957 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 405 transitions. [2020-10-05 23:43:53,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:43:53,957 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 405 transitions. [2020-10-05 23:43:53,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:43:53,959 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:53,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:53,959 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:43:53,960 INFO L427 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-05 23:43:53,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:53,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1309120554, now seen corresponding path program 1 times [2020-10-05 23:43:53,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:53,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490433314] [2020-10-05 23:43:53,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:54,742 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-05 23:43:54,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490433314] [2020-10-05 23:43:54,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:54,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:43:54,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431377428] [2020-10-05 23:43:54,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:43:54,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:54,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:43:54,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:43:54,745 INFO L87 Difference]: Start difference. First operand 194 states and 405 transitions. Second operand 12 states. [2020-10-05 23:43:55,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:55,959 INFO L93 Difference]: Finished difference Result 314 states and 604 transitions. [2020-10-05 23:43:55,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-05 23:43:55,960 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-05 23:43:55,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:55,963 INFO L225 Difference]: With dead ends: 314 [2020-10-05 23:43:55,964 INFO L226 Difference]: Without dead ends: 314 [2020-10-05 23:43:55,964 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2020-10-05 23:43:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-10-05 23:43:55,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 248. [2020-10-05 23:43:55,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-10-05 23:43:55,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 493 transitions. [2020-10-05 23:43:55,973 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 493 transitions. Word has length 22 [2020-10-05 23:43:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:55,973 INFO L479 AbstractCegarLoop]: Abstraction has 248 states and 493 transitions. [2020-10-05 23:43:55,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:43:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 493 transitions. [2020-10-05 23:43:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:43:55,975 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:55,975 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:55,975 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:43:55,975 INFO L427 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-05 23:43:55,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:55,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1309120544, now seen corresponding path program 1 times [2020-10-05 23:43:55,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:55,976 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668833535] [2020-10-05 23:43:55,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:56,245 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-05 23:43:56,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668833535] [2020-10-05 23:43:56,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:56,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:43:56,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511298860] [2020-10-05 23:43:56,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:43:56,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:56,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:43:56,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:43:56,247 INFO L87 Difference]: Start difference. First operand 248 states and 493 transitions. Second operand 8 states. [2020-10-05 23:43:56,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:56,611 INFO L93 Difference]: Finished difference Result 369 states and 697 transitions. [2020-10-05 23:43:56,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:43:56,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-05 23:43:56,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:56,613 INFO L225 Difference]: With dead ends: 369 [2020-10-05 23:43:56,614 INFO L226 Difference]: Without dead ends: 319 [2020-10-05 23:43:56,615 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:43:56,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-10-05 23:43:56,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 247. [2020-10-05 23:43:56,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-10-05 23:43:56,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 491 transitions. [2020-10-05 23:43:56,624 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 491 transitions. Word has length 22 [2020-10-05 23:43:56,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:56,625 INFO L479 AbstractCegarLoop]: Abstraction has 247 states and 491 transitions. [2020-10-05 23:43:56,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:43:56,625 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 491 transitions. [2020-10-05 23:43:56,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:43:56,626 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:56,626 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:56,627 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:43:56,627 INFO L427 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-05 23:43:56,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:56,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1413732572, now seen corresponding path program 2 times [2020-10-05 23:43:56,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:56,628 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57474759] [2020-10-05 23:43:56,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:56,805 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-05 23:43:56,805 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57474759] [2020-10-05 23:43:56,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:56,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:43:56,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582580478] [2020-10-05 23:43:56,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:43:56,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:56,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:43:56,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:43:56,807 INFO L87 Difference]: Start difference. First operand 247 states and 491 transitions. Second operand 4 states. [2020-10-05 23:43:56,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:56,834 INFO L93 Difference]: Finished difference Result 162 states and 259 transitions. [2020-10-05 23:43:56,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:43:56,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-05 23:43:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:56,836 INFO L225 Difference]: With dead ends: 162 [2020-10-05 23:43:56,836 INFO L226 Difference]: Without dead ends: 157 [2020-10-05 23:43:56,837 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:43:56,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-10-05 23:43:56,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2020-10-05 23:43:56,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-10-05 23:43:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 253 transitions. [2020-10-05 23:43:56,842 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 253 transitions. Word has length 22 [2020-10-05 23:43:56,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:56,842 INFO L479 AbstractCegarLoop]: Abstraction has 156 states and 253 transitions. [2020-10-05 23:43:56,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:43:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 253 transitions. [2020-10-05 23:43:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:43:56,843 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:56,843 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:56,843 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:43:56,844 INFO L427 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-05 23:43:56,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:56,844 INFO L82 PathProgramCache]: Analyzing trace with hash 472795278, now seen corresponding path program 2 times [2020-10-05 23:43:56,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:56,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001896139] [2020-10-05 23:43:56,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:57,153 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-05 23:43:57,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001896139] [2020-10-05 23:43:57,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:57,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:43:57,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288234853] [2020-10-05 23:43:57,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:43:57,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:57,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:43:57,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:43:57,156 INFO L87 Difference]: Start difference. First operand 156 states and 253 transitions. Second operand 8 states. [2020-10-05 23:43:57,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:57,589 INFO L93 Difference]: Finished difference Result 177 states and 284 transitions. [2020-10-05 23:43:57,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 23:43:57,590 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-05 23:43:57,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:57,592 INFO L225 Difference]: With dead ends: 177 [2020-10-05 23:43:57,592 INFO L226 Difference]: Without dead ends: 177 [2020-10-05 23:43:57,593 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:43:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-10-05 23:43:57,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 155. [2020-10-05 23:43:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-10-05 23:43:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 252 transitions. [2020-10-05 23:43:57,602 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 252 transitions. Word has length 22 [2020-10-05 23:43:57,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:57,602 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 252 transitions. [2020-10-05 23:43:57,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:43:57,602 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 252 transitions. [2020-10-05 23:43:57,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:43:57,603 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:57,603 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:57,604 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:43:57,604 INFO L427 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-05 23:43:57,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:57,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1729521388, now seen corresponding path program 3 times [2020-10-05 23:43:57,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:57,605 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180878126] [2020-10-05 23:43:57,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:43:58,233 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180878126] [2020-10-05 23:43:58,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:58,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:43:58,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635346441] [2020-10-05 23:43:58,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:43:58,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:58,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:43:58,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:43:58,235 INFO L87 Difference]: Start difference. First operand 155 states and 252 transitions. Second operand 12 states. [2020-10-05 23:43:58,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:58,960 INFO L93 Difference]: Finished difference Result 168 states and 264 transitions. [2020-10-05 23:43:58,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:43:58,965 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-05 23:43:58,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:58,967 INFO L225 Difference]: With dead ends: 168 [2020-10-05 23:43:58,967 INFO L226 Difference]: Without dead ends: 155 [2020-10-05 23:43:58,967 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2020-10-05 23:43:58,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-10-05 23:43:58,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2020-10-05 23:43:58,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-10-05 23:43:58,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 251 transitions. [2020-10-05 23:43:58,972 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 251 transitions. Word has length 22 [2020-10-05 23:43:58,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:58,974 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 251 transitions. [2020-10-05 23:43:58,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:43:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 251 transitions. [2020-10-05 23:43:58,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:43:58,975 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:58,975 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:58,975 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:43:58,975 INFO L427 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-05 23:43:58,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:58,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1716865024, now seen corresponding path program 3 times [2020-10-05 23:43:58,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:58,976 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409972799] [2020-10-05 23:43:58,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:59,284 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-05 23:43:59,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409972799] [2020-10-05 23:43:59,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:59,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:43:59,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755176256] [2020-10-05 23:43:59,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:43:59,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:59,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:43:59,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:43:59,288 INFO L87 Difference]: Start difference. First operand 155 states and 251 transitions. Second operand 8 states. [2020-10-05 23:43:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:59,724 INFO L93 Difference]: Finished difference Result 150 states and 237 transitions. [2020-10-05 23:43:59,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 23:43:59,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-05 23:43:59,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:59,726 INFO L225 Difference]: With dead ends: 150 [2020-10-05 23:43:59,726 INFO L226 Difference]: Without dead ends: 150 [2020-10-05 23:43:59,726 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:43:59,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-10-05 23:43:59,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 130. [2020-10-05 23:43:59,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-05 23:43:59,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 207 transitions. [2020-10-05 23:43:59,731 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 207 transitions. Word has length 22 [2020-10-05 23:43:59,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:59,731 INFO L479 AbstractCegarLoop]: Abstraction has 130 states and 207 transitions. [2020-10-05 23:43:59,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:43:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 207 transitions. [2020-10-05 23:43:59,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:43:59,734 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:59,734 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:59,734 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:43:59,734 INFO L427 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-05 23:43:59,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:59,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1321376162, now seen corresponding path program 4 times [2020-10-05 23:43:59,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:59,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993723444] [2020-10-05 23:43:59,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:00,305 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-05 23:44:00,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993723444] [2020-10-05 23:44:00,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:00,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:44:00,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248406772] [2020-10-05 23:44:00,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:44:00,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:00,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:44:00,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:44:00,312 INFO L87 Difference]: Start difference. First operand 130 states and 207 transitions. Second operand 12 states. [2020-10-05 23:44:01,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:01,042 INFO L93 Difference]: Finished difference Result 142 states and 218 transitions. [2020-10-05 23:44:01,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-05 23:44:01,043 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-05 23:44:01,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:01,044 INFO L225 Difference]: With dead ends: 142 [2020-10-05 23:44:01,045 INFO L226 Difference]: Without dead ends: 130 [2020-10-05 23:44:01,045 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-10-05 23:44:01,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-10-05 23:44:01,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2020-10-05 23:44:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-05 23:44:01,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 205 transitions. [2020-10-05 23:44:01,050 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 205 transitions. Word has length 22 [2020-10-05 23:44:01,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:01,050 INFO L479 AbstractCegarLoop]: Abstraction has 130 states and 205 transitions. [2020-10-05 23:44:01,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:44:01,050 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 205 transitions. [2020-10-05 23:44:01,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:44:01,051 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:01,051 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:01,051 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:44:01,051 INFO L427 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-05 23:44:01,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:01,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1455400266, now seen corresponding path program 5 times [2020-10-05 23:44:01,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:01,052 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353745659] [2020-10-05 23:44:01,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:01,579 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-05 23:44:01,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353745659] [2020-10-05 23:44:01,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:01,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:44:01,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826838733] [2020-10-05 23:44:01,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:44:01,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:01,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:44:01,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:44:01,581 INFO L87 Difference]: Start difference. First operand 130 states and 205 transitions. Second operand 12 states. [2020-10-05 23:44:02,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:02,234 INFO L93 Difference]: Finished difference Result 149 states and 230 transitions. [2020-10-05 23:44:02,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-05 23:44:02,234 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-05 23:44:02,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:02,235 INFO L225 Difference]: With dead ends: 149 [2020-10-05 23:44:02,235 INFO L226 Difference]: Without dead ends: 149 [2020-10-05 23:44:02,236 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-10-05 23:44:02,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-10-05 23:44:02,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2020-10-05 23:44:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-10-05 23:44:02,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 230 transitions. [2020-10-05 23:44:02,240 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 230 transitions. Word has length 22 [2020-10-05 23:44:02,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:02,241 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 230 transitions. [2020-10-05 23:44:02,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:44:02,241 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 230 transitions. [2020-10-05 23:44:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:44:02,242 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:02,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:02,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:44:02,242 INFO L427 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-05 23:44:02,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:02,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1455400276, now seen corresponding path program 2 times [2020-10-05 23:44:02,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:02,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168584724] [2020-10-05 23:44:02,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:02,518 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-05 23:44:02,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168584724] [2020-10-05 23:44:02,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:02,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:44:02,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451159594] [2020-10-05 23:44:02,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:44:02,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:02,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:44:02,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:44:02,520 INFO L87 Difference]: Start difference. First operand 148 states and 230 transitions. Second operand 8 states. [2020-10-05 23:44:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:02,782 INFO L93 Difference]: Finished difference Result 191 states and 287 transitions. [2020-10-05 23:44:02,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 23:44:02,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-05 23:44:02,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:02,785 INFO L225 Difference]: With dead ends: 191 [2020-10-05 23:44:02,785 INFO L226 Difference]: Without dead ends: 165 [2020-10-05 23:44:02,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:44:02,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-10-05 23:44:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 128. [2020-10-05 23:44:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-10-05 23:44:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 199 transitions. [2020-10-05 23:44:02,790 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 199 transitions. Word has length 22 [2020-10-05 23:44:02,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:02,790 INFO L479 AbstractCegarLoop]: Abstraction has 128 states and 199 transitions. [2020-10-05 23:44:02,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:44:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 199 transitions. [2020-10-05 23:44:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:44:02,791 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:02,791 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:02,791 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:44:02,791 INFO L427 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-05 23:44:02,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:02,792 INFO L82 PathProgramCache]: Analyzing trace with hash 2057875200, now seen corresponding path program 4 times [2020-10-05 23:44:02,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:02,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256853282] [2020-10-05 23:44:02,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:03,468 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-05 23:44:03,469 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256853282] [2020-10-05 23:44:03,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:03,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-05 23:44:03,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648940731] [2020-10-05 23:44:03,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-05 23:44:03,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:03,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-05 23:44:03,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:44:03,470 INFO L87 Difference]: Start difference. First operand 128 states and 199 transitions. Second operand 14 states. [2020-10-05 23:44:04,220 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2020-10-05 23:44:04,860 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-10-05 23:44:05,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:05,126 INFO L93 Difference]: Finished difference Result 186 states and 293 transitions. [2020-10-05 23:44:05,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-05 23:44:05,127 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-05 23:44:05,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:05,129 INFO L225 Difference]: With dead ends: 186 [2020-10-05 23:44:05,129 INFO L226 Difference]: Without dead ends: 177 [2020-10-05 23:44:05,130 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2020-10-05 23:44:05,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-10-05 23:44:05,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 127. [2020-10-05 23:44:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-05 23:44:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 197 transitions. [2020-10-05 23:44:05,139 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 197 transitions. Word has length 22 [2020-10-05 23:44:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:05,139 INFO L479 AbstractCegarLoop]: Abstraction has 127 states and 197 transitions. [2020-10-05 23:44:05,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-05 23:44:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 197 transitions. [2020-10-05 23:44:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:44:05,140 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:05,140 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:05,141 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:44:05,141 INFO L427 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-05 23:44:05,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:05,141 INFO L82 PathProgramCache]: Analyzing trace with hash -761551564, now seen corresponding path program 6 times [2020-10-05 23:44:05,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:05,142 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452262412] [2020-10-05 23:44:05,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:05,684 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-05 23:44:05,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452262412] [2020-10-05 23:44:05,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:05,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:44:05,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157490495] [2020-10-05 23:44:05,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:44:05,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:05,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:44:05,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:44:05,687 INFO L87 Difference]: Start difference. First operand 127 states and 197 transitions. Second operand 12 states. [2020-10-05 23:44:06,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:06,332 INFO L93 Difference]: Finished difference Result 139 states and 209 transitions. [2020-10-05 23:44:06,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-05 23:44:06,335 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-05 23:44:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:06,336 INFO L225 Difference]: With dead ends: 139 [2020-10-05 23:44:06,337 INFO L226 Difference]: Without dead ends: 128 [2020-10-05 23:44:06,337 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2020-10-05 23:44:06,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-10-05 23:44:06,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2020-10-05 23:44:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-10-05 23:44:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 189 transitions. [2020-10-05 23:44:06,340 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 189 transitions. Word has length 22 [2020-10-05 23:44:06,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:06,341 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 189 transitions. [2020-10-05 23:44:06,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:44:06,341 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 189 transitions. [2020-10-05 23:44:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:44:06,342 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:06,342 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:06,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:44:06,342 INFO L427 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-05 23:44:06,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:06,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1633571078, now seen corresponding path program 5 times [2020-10-05 23:44:06,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:06,347 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423009014] [2020-10-05 23:44:06,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:06,800 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-05 23:44:06,800 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423009014] [2020-10-05 23:44:06,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:06,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-05 23:44:06,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644018808] [2020-10-05 23:44:06,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-05 23:44:06,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:06,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-05 23:44:06,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:44:06,802 INFO L87 Difference]: Start difference. First operand 123 states and 189 transitions. Second operand 15 states. [2020-10-05 23:44:08,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:08,327 INFO L93 Difference]: Finished difference Result 160 states and 251 transitions. [2020-10-05 23:44:08,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-05 23:44:08,327 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2020-10-05 23:44:08,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:08,329 INFO L225 Difference]: With dead ends: 160 [2020-10-05 23:44:08,329 INFO L226 Difference]: Without dead ends: 152 [2020-10-05 23:44:08,330 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2020-10-05 23:44:08,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-10-05 23:44:08,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 112. [2020-10-05 23:44:08,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-05 23:44:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 172 transitions. [2020-10-05 23:44:08,334 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 172 transitions. Word has length 22 [2020-10-05 23:44:08,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:08,335 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 172 transitions. [2020-10-05 23:44:08,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-05 23:44:08,335 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 172 transitions. [2020-10-05 23:44:08,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:44:08,335 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:08,336 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:08,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 23:44:08,336 INFO L427 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-05 23:44:08,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:08,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1314893868, now seen corresponding path program 7 times [2020-10-05 23:44:08,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:08,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11108100] [2020-10-05 23:44:08,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:08,860 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-05 23:44:08,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11108100] [2020-10-05 23:44:08,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:08,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:44:08,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687163489] [2020-10-05 23:44:08,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:44:08,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:08,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:44:08,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:44:08,862 INFO L87 Difference]: Start difference. First operand 112 states and 172 transitions. Second operand 12 states. [2020-10-05 23:44:09,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:09,479 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. [2020-10-05 23:44:09,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-05 23:44:09,480 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-05 23:44:09,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:09,481 INFO L225 Difference]: With dead ends: 120 [2020-10-05 23:44:09,481 INFO L226 Difference]: Without dead ends: 96 [2020-10-05 23:44:09,482 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-10-05 23:44:09,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-10-05 23:44:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2020-10-05 23:44:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-05 23:44:09,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 147 transitions. [2020-10-05 23:44:09,485 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 147 transitions. Word has length 22 [2020-10-05 23:44:09,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:09,486 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 147 transitions. [2020-10-05 23:44:09,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:44:09,486 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 147 transitions. [2020-10-05 23:44:09,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:44:09,486 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:09,486 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:09,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-05 23:44:09,487 INFO L427 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-05 23:44:09,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:09,487 INFO L82 PathProgramCache]: Analyzing trace with hash -149449002, now seen corresponding path program 8 times [2020-10-05 23:44:09,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:09,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200500240] [2020-10-05 23:44:09,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:09,999 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-05 23:44:09,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200500240] [2020-10-05 23:44:09,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:09,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:44:10,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826570394] [2020-10-05 23:44:10,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:44:10,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:10,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:44:10,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:44:10,001 INFO L87 Difference]: Start difference. First operand 96 states and 147 transitions. Second operand 12 states. [2020-10-05 23:44:10,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:10,616 INFO L93 Difference]: Finished difference Result 96 states and 146 transitions. [2020-10-05 23:44:10,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-05 23:44:10,617 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-05 23:44:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:10,618 INFO L225 Difference]: With dead ends: 96 [2020-10-05 23:44:10,618 INFO L226 Difference]: Without dead ends: 81 [2020-10-05 23:44:10,618 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-05 23:44:10,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-05 23:44:10,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-10-05 23:44:10,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-05 23:44:10,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 131 transitions. [2020-10-05 23:44:10,621 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 131 transitions. Word has length 22 [2020-10-05 23:44:10,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:10,621 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 131 transitions. [2020-10-05 23:44:10,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:44:10,622 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 131 transitions. [2020-10-05 23:44:10,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:44:10,622 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:10,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:10,623 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-05 23:44:10,623 INFO L427 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-05 23:44:10,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:10,624 INFO L82 PathProgramCache]: Analyzing trace with hash -552633476, now seen corresponding path program 9 times [2020-10-05 23:44:10,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:10,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818357487] [2020-10-05 23:44:10,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:11,042 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-10-05 23:44:11,219 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2020-10-05 23:44:11,606 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-05 23:44:11,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818357487] [2020-10-05 23:44:11,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:11,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:44:11,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993032263] [2020-10-05 23:44:11,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:44:11,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:11,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:44:11,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:44:11,610 INFO L87 Difference]: Start difference. First operand 81 states and 131 transitions. Second operand 12 states. [2020-10-05 23:44:12,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:12,547 INFO L93 Difference]: Finished difference Result 112 states and 176 transitions. [2020-10-05 23:44:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-05 23:44:12,547 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-05 23:44:12,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:12,548 INFO L225 Difference]: With dead ends: 112 [2020-10-05 23:44:12,548 INFO L226 Difference]: Without dead ends: 112 [2020-10-05 23:44:12,549 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-05 23:44:12,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-05 23:44:12,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2020-10-05 23:44:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-05 23:44:12,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 176 transitions. [2020-10-05 23:44:12,552 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 176 transitions. Word has length 22 [2020-10-05 23:44:12,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:12,552 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 176 transitions. [2020-10-05 23:44:12,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:44:12,552 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 176 transitions. [2020-10-05 23:44:12,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:44:12,553 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:12,553 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:12,553 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-05 23:44:12,553 INFO L427 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-05 23:44:12,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:12,554 INFO L82 PathProgramCache]: Analyzing trace with hash -552633486, now seen corresponding path program 3 times [2020-10-05 23:44:12,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:12,554 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567993969] [2020-10-05 23:44:12,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:12,840 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-05 23:44:12,841 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567993969] [2020-10-05 23:44:12,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:12,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:44:12,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540675348] [2020-10-05 23:44:12,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:44:12,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:12,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:44:12,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:44:12,846 INFO L87 Difference]: Start difference. First operand 111 states and 176 transitions. Second operand 8 states. [2020-10-05 23:44:13,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:13,142 INFO L93 Difference]: Finished difference Result 136 states and 213 transitions. [2020-10-05 23:44:13,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:44:13,143 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-05 23:44:13,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:13,144 INFO L225 Difference]: With dead ends: 136 [2020-10-05 23:44:13,144 INFO L226 Difference]: Without dead ends: 105 [2020-10-05 23:44:13,145 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:44:13,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-10-05 23:44:13,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-10-05 23:44:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-05 23:44:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 167 transitions. [2020-10-05 23:44:13,148 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 167 transitions. Word has length 22 [2020-10-05 23:44:13,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:13,148 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 167 transitions. [2020-10-05 23:44:13,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:44:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 167 transitions. [2020-10-05 23:44:13,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:44:13,149 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:13,149 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:13,150 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-05 23:44:13,150 INFO L427 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-05 23:44:13,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:13,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1930461660, now seen corresponding path program 10 times [2020-10-05 23:44:13,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:13,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352143521] [2020-10-05 23:44:13,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:13,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-05 23:44:13,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352143521] [2020-10-05 23:44:13,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:13,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:44:13,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336809711] [2020-10-05 23:44:13,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:44:13,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:13,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:44:13,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:44:13,871 INFO L87 Difference]: Start difference. First operand 105 states and 167 transitions. Second operand 12 states. [2020-10-05 23:44:14,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:14,551 INFO L93 Difference]: Finished difference Result 136 states and 213 transitions. [2020-10-05 23:44:14,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-05 23:44:14,551 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-05 23:44:14,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:14,552 INFO L225 Difference]: With dead ends: 136 [2020-10-05 23:44:14,552 INFO L226 Difference]: Without dead ends: 94 [2020-10-05 23:44:14,556 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-05 23:44:14,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-10-05 23:44:14,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-10-05 23:44:14,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-05 23:44:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 149 transitions. [2020-10-05 23:44:14,559 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 149 transitions. Word has length 22 [2020-10-05 23:44:14,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:14,559 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 149 transitions. [2020-10-05 23:44:14,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:44:14,559 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 149 transitions. [2020-10-05 23:44:14,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:44:14,560 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:14,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:14,560 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-05 23:44:14,560 INFO L427 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-05 23:44:14,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:14,561 INFO L82 PathProgramCache]: Analyzing trace with hash 571806310, now seen corresponding path program 11 times [2020-10-05 23:44:14,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:14,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856822957] [2020-10-05 23:44:14,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:15,312 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-05 23:44:15,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856822957] [2020-10-05 23:44:15,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:15,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:44:15,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475742624] [2020-10-05 23:44:15,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:44:15,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:15,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:44:15,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:44:15,315 INFO L87 Difference]: Start difference. First operand 94 states and 149 transitions. Second operand 12 states. [2020-10-05 23:44:15,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:15,975 INFO L93 Difference]: Finished difference Result 124 states and 194 transitions. [2020-10-05 23:44:15,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-05 23:44:15,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-05 23:44:15,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:15,979 INFO L225 Difference]: With dead ends: 124 [2020-10-05 23:44:15,979 INFO L226 Difference]: Without dead ends: 94 [2020-10-05 23:44:15,980 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-05 23:44:15,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-10-05 23:44:15,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-10-05 23:44:15,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-05 23:44:15,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 147 transitions. [2020-10-05 23:44:15,982 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 147 transitions. Word has length 22 [2020-10-05 23:44:15,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:15,983 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 147 transitions. [2020-10-05 23:44:15,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:44:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 147 transitions. [2020-10-05 23:44:15,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:44:15,983 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:15,984 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:15,984 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-05 23:44:15,984 INFO L427 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-05 23:44:15,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:15,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1853019498, now seen corresponding path program 12 times [2020-10-05 23:44:15,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:15,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841759779] [2020-10-05 23:44:15,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:16,615 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-05 23:44:16,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841759779] [2020-10-05 23:44:16,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:16,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:44:16,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535818860] [2020-10-05 23:44:16,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:44:16,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:16,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:44:16,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:44:16,617 INFO L87 Difference]: Start difference. First operand 94 states and 147 transitions. Second operand 12 states. [2020-10-05 23:44:17,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:17,288 INFO L93 Difference]: Finished difference Result 112 states and 171 transitions. [2020-10-05 23:44:17,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-05 23:44:17,289 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-05 23:44:17,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:17,290 INFO L225 Difference]: With dead ends: 112 [2020-10-05 23:44:17,290 INFO L226 Difference]: Without dead ends: 112 [2020-10-05 23:44:17,291 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-05 23:44:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-05 23:44:17,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2020-10-05 23:44:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-05 23:44:17,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 171 transitions. [2020-10-05 23:44:17,295 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 171 transitions. Word has length 22 [2020-10-05 23:44:17,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:17,295 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 171 transitions. [2020-10-05 23:44:17,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:44:17,296 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 171 transitions. [2020-10-05 23:44:17,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:44:17,296 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:17,296 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:17,296 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-05 23:44:17,297 INFO L427 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-05 23:44:17,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:17,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1853019508, now seen corresponding path program 4 times [2020-10-05 23:44:17,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:17,297 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002187251] [2020-10-05 23:44:17,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:17,545 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-05 23:44:17,545 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002187251] [2020-10-05 23:44:17,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:17,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:44:17,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114604092] [2020-10-05 23:44:17,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:44:17,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:17,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:44:17,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:44:17,547 INFO L87 Difference]: Start difference. First operand 111 states and 171 transitions. Second operand 8 states. [2020-10-05 23:44:17,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:17,822 INFO L93 Difference]: Finished difference Result 120 states and 181 transitions. [2020-10-05 23:44:17,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 23:44:17,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-05 23:44:17,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:17,824 INFO L225 Difference]: With dead ends: 120 [2020-10-05 23:44:17,824 INFO L226 Difference]: Without dead ends: 95 [2020-10-05 23:44:17,824 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:44:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-05 23:44:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 68. [2020-10-05 23:44:17,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-05 23:44:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 106 transitions. [2020-10-05 23:44:17,827 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 106 transitions. Word has length 22 [2020-10-05 23:44:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:17,827 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 106 transitions. [2020-10-05 23:44:17,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:44:17,827 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 106 transitions. [2020-10-05 23:44:17,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:44:17,828 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:17,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:17,828 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-05 23:44:17,828 INFO L427 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-05 23:44:17,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:17,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1877323498, now seen corresponding path program 13 times [2020-10-05 23:44:17,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:17,829 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017183046] [2020-10-05 23:44:17,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:44:18,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017183046] [2020-10-05 23:44:18,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:18,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:44:18,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842521661] [2020-10-05 23:44:18,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:44:18,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:18,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:44:18,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:44:18,479 INFO L87 Difference]: Start difference. First operand 68 states and 106 transitions. Second operand 12 states. [2020-10-05 23:44:19,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:19,220 INFO L93 Difference]: Finished difference Result 94 states and 141 transitions. [2020-10-05 23:44:19,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-05 23:44:19,221 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-05 23:44:19,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:19,221 INFO L225 Difference]: With dead ends: 94 [2020-10-05 23:44:19,222 INFO L226 Difference]: Without dead ends: 77 [2020-10-05 23:44:19,222 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-10-05 23:44:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-05 23:44:19,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2020-10-05 23:44:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-05 23:44:19,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2020-10-05 23:44:19,226 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 22 [2020-10-05 23:44:19,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:19,226 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2020-10-05 23:44:19,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:44:19,226 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2020-10-05 23:44:19,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:44:19,227 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:19,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:19,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-05 23:44:19,227 INFO L427 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-05 23:44:19,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:19,227 INFO L82 PathProgramCache]: Analyzing trace with hash 280732566, now seen corresponding path program 14 times [2020-10-05 23:44:19,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:19,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425568288] [2020-10-05 23:44:19,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:19,745 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-05 23:44:19,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425568288] [2020-10-05 23:44:19,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:19,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:44:19,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956143349] [2020-10-05 23:44:19,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:44:19,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:19,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:44:19,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:44:19,747 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand 12 states. [2020-10-05 23:44:20,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:20,347 INFO L93 Difference]: Finished difference Result 86 states and 125 transitions. [2020-10-05 23:44:20,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-05 23:44:20,348 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-05 23:44:20,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:20,349 INFO L225 Difference]: With dead ends: 86 [2020-10-05 23:44:20,349 INFO L226 Difference]: Without dead ends: 59 [2020-10-05 23:44:20,350 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2020-10-05 23:44:20,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-05 23:44:20,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2020-10-05 23:44:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-10-05 23:44:20,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2020-10-05 23:44:20,352 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 22 [2020-10-05 23:44:20,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:20,352 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2020-10-05 23:44:20,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:44:20,352 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2020-10-05 23:44:20,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:44:20,353 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:20,353 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:20,353 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-05 23:44:20,353 INFO L427 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-05 23:44:20,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:20,354 INFO L82 PathProgramCache]: Analyzing trace with hash 779226054, now seen corresponding path program 15 times [2020-10-05 23:44:20,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:20,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31401725] [2020-10-05 23:44:20,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:21,037 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-05 23:44:21,038 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31401725] [2020-10-05 23:44:21,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:21,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:44:21,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265945589] [2020-10-05 23:44:21,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:44:21,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:21,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:44:21,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:44:21,039 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand 12 states. [2020-10-05 23:44:21,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:21,594 INFO L93 Difference]: Finished difference Result 49 states and 73 transitions. [2020-10-05 23:44:21,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-05 23:44:21,594 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-05 23:44:21,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:21,595 INFO L225 Difference]: With dead ends: 49 [2020-10-05 23:44:21,595 INFO L226 Difference]: Without dead ends: 0 [2020-10-05 23:44:21,595 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-05 23:44:21,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-05 23:44:21,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-05 23:44:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-05 23:44:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-05 23:44:21,596 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-10-05 23:44:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:21,596 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-05 23:44:21,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:44:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-05 23:44:21,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-05 23:44:21,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-05 23:44:21,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:44:21 BasicIcfg [2020-10-05 23:44:21,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:44:21,603 INFO L168 Benchmark]: Toolchain (without parser) took 39389.06 ms. Allocated memory was 148.9 MB in the beginning and 504.4 MB in the end (delta: 355.5 MB). Free memory was 101.1 MB in the beginning and 216.6 MB in the end (delta: -115.6 MB). Peak memory consumption was 239.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:44:21,603 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 148.9 MB. Free memory was 123.6 MB in the beginning and 123.2 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-10-05 23:44:21,604 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1437.47 ms. Allocated memory was 148.9 MB in the beginning and 237.5 MB in the end (delta: 88.6 MB). Free memory was 101.1 MB in the beginning and 168.0 MB in the end (delta: -66.9 MB). Peak memory consumption was 70.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:44:21,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.13 ms. Allocated memory is still 237.5 MB. Free memory was 168.0 MB in the beginning and 164.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:44:21,604 INFO L168 Benchmark]: Boogie Preprocessor took 56.42 ms. Allocated memory is still 237.5 MB. Free memory was 164.6 MB in the beginning and 161.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:44:21,605 INFO L168 Benchmark]: RCFGBuilder took 708.86 ms. Allocated memory is still 237.5 MB. Free memory was 161.3 MB in the beginning and 113.9 MB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB. [2020-10-05 23:44:21,605 INFO L168 Benchmark]: TraceAbstraction took 37100.89 ms. Allocated memory was 237.5 MB in the beginning and 504.4 MB in the end (delta: 266.9 MB). Free memory was 112.2 MB in the beginning and 216.6 MB in the end (delta: -104.4 MB). Peak memory consumption was 162.5 MB. Max. memory is 7.1 GB. [2020-10-05 23:44:21,608 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 148.9 MB. Free memory was 123.6 MB in the beginning and 123.2 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1437.47 ms. Allocated memory was 148.9 MB in the beginning and 237.5 MB in the end (delta: 88.6 MB). Free memory was 101.1 MB in the beginning and 168.0 MB in the end (delta: -66.9 MB). Peak memory consumption was 70.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.13 ms. Allocated memory is still 237.5 MB. Free memory was 168.0 MB in the beginning and 164.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.42 ms. Allocated memory is still 237.5 MB. Free memory was 164.6 MB in the beginning and 161.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 708.86 ms. Allocated memory is still 237.5 MB. Free memory was 161.3 MB in the beginning and 113.9 MB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37100.89 ms. Allocated memory was 237.5 MB in the beginning and 504.4 MB in the end (delta: 266.9 MB). Free memory was 112.2 MB in the beginning and 216.6 MB in the end (delta: -104.4 MB). Peak memory consumption was 162.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.7s, 150 ProgramPointsBefore, 40 ProgramPointsAfterwards, 154 TransitionsBefore, 38 TransitionsAfterwards, 2652 CoEnabledTransitionPairs, 8 FixpointIterations, 90 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 16 ConcurrentYvCompositions, 6 ChoiceCompositions, 1372 VarBasedMoverChecksPositive, 38 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 5194 CheckedPairsTotal, 168 TotalNumberOfCompositions - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 36.9s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 677 SDtfs, 948 SDslu, 2210 SDs, 0 SdLazy, 5479 SolverSat, 454 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 416 GetRequests, 23 SyntacticMatches, 35 SemanticMatches, 358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 16.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 469 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 548 NumberOfCodeBlocks, 548 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 520 ConstructedInterpolants, 0 QuantifiedInterpolants, 238053 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...