/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 15:49:16,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 15:49:16,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 15:49:16,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 15:49:16,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 15:49:16,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 15:49:16,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 15:49:16,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 15:49:16,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 15:49:16,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 15:49:16,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 15:49:16,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 15:49:16,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 15:49:16,744 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 15:49:16,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 15:49:16,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 15:49:16,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 15:49:16,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 15:49:16,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 15:49:16,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 15:49:16,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 15:49:16,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 15:49:16,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 15:49:16,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 15:49:16,792 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 15:49:16,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 15:49:16,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 15:49:16,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 15:49:16,794 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 15:49:16,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 15:49:16,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 15:49:16,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 15:49:16,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 15:49:16,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 15:49:16,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 15:49:16,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 15:49:16,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 15:49:16,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 15:49:16,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 15:49:16,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 15:49:16,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 15:49:16,806 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-McrAutomaton-WP.epf [2020-11-09 15:49:16,864 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 15:49:16,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 15:49:16,868 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 15:49:16,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 15:49:16,869 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 15:49:16,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 15:49:16,869 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 15:49:16,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 15:49:16,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 15:49:16,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 15:49:16,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 15:49:16,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 15:49:16,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 15:49:16,872 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 15:49:16,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 15:49:16,872 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 15:49:16,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 15:49:16,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 15:49:16,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 15:49:16,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 15:49:16,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 15:49:16,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:49:16,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 15:49:16,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 15:49:16,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 15:49:16,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 15:49:16,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 15:49:16,875 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 15:49:16,875 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 15:49:16,875 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 15:49:16,875 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 15:49:17,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 15:49:17,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 15:49:17,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 15:49:17,328 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 15:49:17,329 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 15:49:17,330 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-11-09 15:49:17,424 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc77bfb38/4fbfd3daa90d425f9fe6545d943e4988/FLAG71c269ca1 [2020-11-09 15:49:18,228 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 15:49:18,229 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-11-09 15:49:18,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc77bfb38/4fbfd3daa90d425f9fe6545d943e4988/FLAG71c269ca1 [2020-11-09 15:49:18,378 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc77bfb38/4fbfd3daa90d425f9fe6545d943e4988 [2020-11-09 15:49:18,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 15:49:18,387 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 15:49:18,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 15:49:18,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 15:49:18,393 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 15:49:18,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:49:18" (1/1) ... [2020-11-09 15:49:18,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eed4f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:18, skipping insertion in model container [2020-11-09 15:49:18,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:49:18" (1/1) ... [2020-11-09 15:49:18,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 15:49:18,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 15:49:18,617 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-11-09 15:49:19,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:49:19,264 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 15:49:19,278 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-11-09 15:49:19,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:49:19,757 INFO L208 MainTranslator]: Completed translation [2020-11-09 15:49:19,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:19 WrapperNode [2020-11-09 15:49:19,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 15:49:19,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 15:49:19,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 15:49:19,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 15:49:19,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:19" (1/1) ... [2020-11-09 15:49:19,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:19" (1/1) ... [2020-11-09 15:49:19,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 15:49:19,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 15:49:19,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 15:49:19,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 15:49:19,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:19" (1/1) ... [2020-11-09 15:49:19,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:19" (1/1) ... [2020-11-09 15:49:19,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:19" (1/1) ... [2020-11-09 15:49:19,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:19" (1/1) ... [2020-11-09 15:49:19,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:19" (1/1) ... [2020-11-09 15:49:19,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:19" (1/1) ... [2020-11-09 15:49:19,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:19" (1/1) ... [2020-11-09 15:49:19,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 15:49:19,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 15:49:19,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 15:49:19,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 15:49:19,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:49:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 15:49:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 15:49:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 15:49:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-09 15:49:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-09 15:49:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 15:49:19,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 15:49:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-11-09 15:49:19,989 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-11-09 15:49:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 15:49:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 15:49:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 15:49:19,992 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 15:49:20,964 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 15:49:20,965 INFO L298 CfgBuilder]: Removed 36 assume(true) statements. [2020-11-09 15:49:20,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:49:20 BoogieIcfgContainer [2020-11-09 15:49:20,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 15:49:20,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 15:49:20,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 15:49:20,973 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 15:49:20,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 03:49:18" (1/3) ... [2020-11-09 15:49:20,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2062b393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:49:20, skipping insertion in model container [2020-11-09 15:49:20,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:19" (2/3) ... [2020-11-09 15:49:20,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2062b393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:49:20, skipping insertion in model container [2020-11-09 15:49:20,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:49:20" (3/3) ... [2020-11-09 15:49:20,977 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2020-11-09 15:49:20,993 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 15:49:20,993 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 15:49:20,997 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-11-09 15:49:20,998 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 15:49:21,037 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,037 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,037 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,037 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,038 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,038 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,038 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,038 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,038 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,039 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,039 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,039 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,039 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,039 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,040 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,040 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,040 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,040 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,040 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,041 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,041 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,041 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,041 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,041 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,043 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,044 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,044 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,044 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,044 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,044 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,045 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,045 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,045 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,045 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,045 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,046 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,046 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,046 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,046 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,046 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,047 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,047 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,047 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,047 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,047 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,047 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,048 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,048 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,048 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,048 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,048 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,049 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,049 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,049 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,049 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,049 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,050 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,050 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,050 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,050 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,051 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,051 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,051 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,051 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,076 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,076 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,076 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,076 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,079 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,080 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,082 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,082 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,083 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,083 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,083 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,083 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,084 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,094 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,094 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,094 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,094 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,095 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,095 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,095 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,095 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,095 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:49:21,111 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-11-09 15:49:21,127 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-11-09 15:49:21,152 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 15:49:21,152 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 15:49:21,153 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 15:49:21,153 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 15:49:21,153 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 15:49:21,153 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 15:49:21,153 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 15:49:21,153 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 15:49:21,171 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 15:49:21,172 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 178 transitions, 378 flow [2020-11-09 15:49:21,175 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 178 transitions, 378 flow [2020-11-09 15:49:21,177 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 168 places, 178 transitions, 378 flow [2020-11-09 15:49:21,258 INFO L129 PetriNetUnfolder]: 19/226 cut-off events. [2020-11-09 15:49:21,258 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-11-09 15:49:21,264 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 226 events. 19/226 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 444 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 126. Up to 4 conditions per place. [2020-11-09 15:49:21,269 INFO L116 LiptonReduction]: Number of co-enabled transitions 1872 [2020-11-09 15:49:24,805 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:24,827 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 15:49:24,833 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:24,849 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 15:49:24,851 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:24,852 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-11-09 15:49:24,933 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:24,956 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 15:49:24,962 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:24,977 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 15:49:24,980 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:24,981 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-11-09 15:49:26,713 WARN L194 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-11-09 15:49:26,916 WARN L194 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-11-09 15:49:29,118 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2020-11-09 15:49:29,527 WARN L194 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2020-11-09 15:49:29,866 WARN L194 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2020-11-09 15:49:31,079 WARN L194 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2020-11-09 15:49:31,096 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:31,201 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 15:49:31,203 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 15:49:31,214 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:31,306 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 15:49:31,308 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:31,309 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:163, output treesize:135 [2020-11-09 15:49:31,824 WARN L194 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2020-11-09 15:49:31,837 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:31,959 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 15:49:31,960 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 15:49:31,966 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:32,059 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 15:49:32,061 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:32,061 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:163, output treesize:135 [2020-11-09 15:49:32,509 WARN L194 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2020-11-09 15:49:32,520 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:32,653 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-09 15:49:32,654 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 15:49:32,675 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:32,795 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-09 15:49:32,795 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 15:49:32,797 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:32,797 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:172, output treesize:144 [2020-11-09 15:49:32,902 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-09 15:49:33,266 WARN L194 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 100 [2020-11-09 15:49:33,284 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:33,428 WARN L194 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-09 15:49:33,429 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 15:49:33,437 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:33,560 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-11-09 15:49:33,561 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 15:49:33,562 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:33,562 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:175, output treesize:147 [2020-11-09 15:49:33,710 WARN L194 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-11-09 15:49:34,142 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2020-11-09 15:49:34,340 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 15:49:34,474 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 15:49:34,580 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 15:49:34,697 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 15:49:34,986 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2020-11-09 15:49:35,151 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2020-11-09 15:49:36,003 WARN L194 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 144 [2020-11-09 15:49:36,393 WARN L194 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-11-09 15:49:37,349 WARN L194 SmtUtils]: Spent 954.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 151 [2020-11-09 15:49:37,779 WARN L194 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2020-11-09 15:49:38,133 WARN L194 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2020-11-09 15:49:38,490 WARN L194 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2020-11-09 15:49:40,315 WARN L194 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 173 DAG size of output: 171 [2020-11-09 15:49:40,356 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:41,240 WARN L194 SmtUtils]: Spent 882.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-11-09 15:49:41,240 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 15:49:41,254 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:42,027 WARN L194 SmtUtils]: Spent 772.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-11-09 15:49:42,027 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 15:49:42,029 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:42,029 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:350, output treesize:362 [2020-11-09 15:49:42,775 WARN L194 SmtUtils]: Spent 745.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-11-09 15:49:45,056 WARN L194 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 185 DAG size of output: 183 [2020-11-09 15:49:45,088 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:46,038 WARN L194 SmtUtils]: Spent 949.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-09 15:49:46,040 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 15:49:46,056 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:46,953 WARN L194 SmtUtils]: Spent 896.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-11-09 15:49:46,954 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 15:49:46,955 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-09 15:49:46,956 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:362, output treesize:374 [2020-11-09 15:49:47,895 WARN L194 SmtUtils]: Spent 938.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-11-09 15:49:48,929 WARN L194 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 161 DAG size of output: 159 [2020-11-09 15:49:49,421 WARN L194 SmtUtils]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-11-09 15:49:50,611 WARN L194 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 173 DAG size of output: 171 [2020-11-09 15:49:51,140 WARN L194 SmtUtils]: Spent 522.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-11-09 15:49:51,149 INFO L131 LiptonReduction]: Checked pairs total: 3600 [2020-11-09 15:49:51,149 INFO L133 LiptonReduction]: Total number of compositions: 222 [2020-11-09 15:49:51,157 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 32 transitions, 86 flow [2020-11-09 15:49:51,180 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 121 states. [2020-11-09 15:49:51,182 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2020-11-09 15:49:51,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-11-09 15:49:51,188 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:49:51,189 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-11-09 15:49:51,190 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:49:51,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:49:51,197 INFO L82 PathProgramCache]: Analyzing trace with hash 688, now seen corresponding path program 1 times [2020-11-09 15:49:51,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:49:51,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350218961] [2020-11-09 15:49:51,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:49:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:49:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:49:51,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350218961] [2020-11-09 15:49:51,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:49:51,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-11-09 15:49:51,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1578663987] [2020-11-09 15:49:51,521 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:49:51,524 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:49:51,535 INFO L252 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2020-11-09 15:49:51,535 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:49:51,540 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:49:51,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-09 15:49:51,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:49:51,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-09 15:49:51,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-09 15:49:51,559 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 2 states. [2020-11-09 15:49:51,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:49:51,576 INFO L93 Difference]: Finished difference Result 119 states and 236 transitions. [2020-11-09 15:49:51,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-09 15:49:51,578 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-11-09 15:49:51,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:49:51,589 INFO L225 Difference]: With dead ends: 119 [2020-11-09 15:49:51,589 INFO L226 Difference]: Without dead ends: 108 [2020-11-09 15:49:51,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-09 15:49:51,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-11-09 15:49:51,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-11-09 15:49:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-11-09 15:49:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 213 transitions. [2020-11-09 15:49:51,643 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 213 transitions. Word has length 1 [2020-11-09 15:49:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:49:51,644 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 213 transitions. [2020-11-09 15:49:51,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-09 15:49:51,644 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 213 transitions. [2020-11-09 15:49:51,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-09 15:49:51,644 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:49:51,645 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-09 15:49:51,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 15:49:51,645 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:49:51,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:49:51,646 INFO L82 PathProgramCache]: Analyzing trace with hash 654434250, now seen corresponding path program 1 times [2020-11-09 15:49:51,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:49:51,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15798260] [2020-11-09 15:49:51,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:49:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:49:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:49:51,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15798260] [2020-11-09 15:49:51,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:49:51,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:49:51,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1639557774] [2020-11-09 15:49:51,931 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:49:51,932 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:49:51,934 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-11-09 15:49:51,934 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:49:51,934 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:49:51,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:49:51,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:49:51,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:49:51,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:49:51,937 INFO L87 Difference]: Start difference. First operand 108 states and 213 transitions. Second operand 4 states. [2020-11-09 15:49:52,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:49:52,082 INFO L93 Difference]: Finished difference Result 146 states and 291 transitions. [2020-11-09 15:49:52,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:49:52,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-11-09 15:49:52,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:49:52,087 INFO L225 Difference]: With dead ends: 146 [2020-11-09 15:49:52,087 INFO L226 Difference]: Without dead ends: 146 [2020-11-09 15:49:52,088 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:49:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-11-09 15:49:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2020-11-09 15:49:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-11-09 15:49:52,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 263 transitions. [2020-11-09 15:49:52,107 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 263 transitions. Word has length 5 [2020-11-09 15:49:52,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:49:52,107 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 263 transitions. [2020-11-09 15:49:52,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:49:52,107 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 263 transitions. [2020-11-09 15:49:52,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-09 15:49:52,108 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:49:52,108 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-09 15:49:52,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 15:49:52,108 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:49:52,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:49:52,109 INFO L82 PathProgramCache]: Analyzing trace with hash 654434302, now seen corresponding path program 1 times [2020-11-09 15:49:52,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:49:52,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320398986] [2020-11-09 15:49:52,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:49:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:49:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:49:52,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320398986] [2020-11-09 15:49:52,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:49:52,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:49:52,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [408959827] [2020-11-09 15:49:52,186 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:49:52,187 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:49:52,188 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-11-09 15:49:52,188 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:49:52,189 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:49:52,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:49:52,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:49:52,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:49:52,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:49:52,190 INFO L87 Difference]: Start difference. First operand 130 states and 263 transitions. Second operand 3 states. [2020-11-09 15:49:52,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:49:52,279 INFO L93 Difference]: Finished difference Result 160 states and 315 transitions. [2020-11-09 15:49:52,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:49:52,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-09 15:49:52,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:49:52,281 INFO L225 Difference]: With dead ends: 160 [2020-11-09 15:49:52,282 INFO L226 Difference]: Without dead ends: 153 [2020-11-09 15:49:52,282 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:49:52,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-11-09 15:49:52,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2020-11-09 15:49:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-11-09 15:49:52,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 297 transitions. [2020-11-09 15:49:52,298 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 297 transitions. Word has length 5 [2020-11-09 15:49:52,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:49:52,298 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 297 transitions. [2020-11-09 15:49:52,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:49:52,298 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 297 transitions. [2020-11-09 15:49:52,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 15:49:52,300 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:49:52,300 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:49:52,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 15:49:52,301 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:49:52,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:49:52,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1212118520, now seen corresponding path program 1 times [2020-11-09 15:49:52,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:49:52,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487656374] [2020-11-09 15:49:52,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:49:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:49:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:49:52,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487656374] [2020-11-09 15:49:52,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:49:52,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:49:52,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1686781426] [2020-11-09 15:49:52,380 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:49:52,382 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:49:52,384 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-11-09 15:49:52,384 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:49:52,385 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:49:52,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:49:52,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:49:52,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:49:52,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:49:52,386 INFO L87 Difference]: Start difference. First operand 145 states and 297 transitions. Second operand 3 states. [2020-11-09 15:49:52,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:49:52,409 INFO L93 Difference]: Finished difference Result 57 states and 101 transitions. [2020-11-09 15:49:52,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:49:52,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-09 15:49:52,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:49:52,410 INFO L225 Difference]: With dead ends: 57 [2020-11-09 15:49:52,410 INFO L226 Difference]: Without dead ends: 57 [2020-11-09 15:49:52,411 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:49:52,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-09 15:49:52,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-11-09 15:49:52,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-09 15:49:52,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 101 transitions. [2020-11-09 15:49:52,416 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 101 transitions. Word has length 10 [2020-11-09 15:49:52,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:49:52,416 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 101 transitions. [2020-11-09 15:49:52,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:49:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 101 transitions. [2020-11-09 15:49:52,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:49:52,418 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:49:52,418 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:49:52,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 15:49:52,418 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:49:52,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:49:52,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1197590593, now seen corresponding path program 1 times [2020-11-09 15:49:52,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:49:52,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812045729] [2020-11-09 15:49:52,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:49:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:49:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:49:52,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812045729] [2020-11-09 15:49:52,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:49:52,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:49:52,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1548691653] [2020-11-09 15:49:52,870 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:49:52,874 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:49:52,880 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 20 transitions. [2020-11-09 15:49:52,880 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:49:52,894 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:52,898 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:52,900 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:52,948 INFO L625 ElimStorePlain]: treesize reduction 98, result has 27.4 percent of original size [2020-11-09 15:49:52,948 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_195| vanished before elimination [2020-11-09 15:49:52,948 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-11-09 15:49:52,949 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:195, output treesize:37 [2020-11-09 15:49:52,959 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:49:52,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 15:49:52,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:49:52,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 15:49:52,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:49:52,960 INFO L87 Difference]: Start difference. First operand 57 states and 101 transitions. Second operand 7 states. [2020-11-09 15:49:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:49:53,345 INFO L93 Difference]: Finished difference Result 98 states and 161 transitions. [2020-11-09 15:49:53,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:49:53,346 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-11-09 15:49:53,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:49:53,348 INFO L225 Difference]: With dead ends: 98 [2020-11-09 15:49:53,348 INFO L226 Difference]: Without dead ends: 98 [2020-11-09 15:49:53,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2020-11-09 15:49:53,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-11-09 15:49:53,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 74. [2020-11-09 15:49:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-09 15:49:53,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 124 transitions. [2020-11-09 15:49:53,355 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 124 transitions. Word has length 16 [2020-11-09 15:49:53,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:49:53,356 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 124 transitions. [2020-11-09 15:49:53,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 15:49:53,356 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 124 transitions. [2020-11-09 15:49:53,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:49:53,357 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:49:53,357 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:49:53,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 15:49:53,357 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:49:53,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:49:53,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1197590631, now seen corresponding path program 1 times [2020-11-09 15:49:53,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:49:53,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68128791] [2020-11-09 15:49:53,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:49:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:49:54,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:49:54,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68128791] [2020-11-09 15:49:54,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:49:54,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 15:49:54,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1641336278] [2020-11-09 15:49:54,138 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:49:54,145 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:49:54,153 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 20 transitions. [2020-11-09 15:49:54,153 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:49:54,166 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:54,167 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:54,170 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:54,221 INFO L625 ElimStorePlain]: treesize reduction 98, result has 25.2 percent of original size [2020-11-09 15:49:54,221 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_196| vanished before elimination [2020-11-09 15:49:54,222 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-11-09 15:49:54,222 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:191, output treesize:33 [2020-11-09 15:49:54,223 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:49:54,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 15:49:54,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:49:54,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 15:49:54,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:49:54,224 INFO L87 Difference]: Start difference. First operand 74 states and 124 transitions. Second operand 10 states. [2020-11-09 15:49:54,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:49:54,734 INFO L93 Difference]: Finished difference Result 88 states and 141 transitions. [2020-11-09 15:49:54,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:49:54,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 15:49:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:49:54,736 INFO L225 Difference]: With dead ends: 88 [2020-11-09 15:49:54,736 INFO L226 Difference]: Without dead ends: 77 [2020-11-09 15:49:54,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-11-09 15:49:54,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-09 15:49:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2020-11-09 15:49:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-09 15:49:54,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2020-11-09 15:49:54,742 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 16 [2020-11-09 15:49:54,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:49:54,742 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2020-11-09 15:49:54,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 15:49:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2020-11-09 15:49:54,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:49:54,743 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:49:54,744 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:49:54,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 15:49:54,744 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:49:54,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:49:54,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1365975115, now seen corresponding path program 2 times [2020-11-09 15:49:54,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:49:54,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840802348] [2020-11-09 15:49:54,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:49:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:49:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:49:55,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840802348] [2020-11-09 15:49:55,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:49:55,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 15:49:55,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [298265690] [2020-11-09 15:49:55,407 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:49:55,410 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:49:55,416 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 18 transitions. [2020-11-09 15:49:55,417 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:49:55,420 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:49:55,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 15:49:55,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:49:55,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 15:49:55,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:49:55,422 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 10 states. [2020-11-09 15:49:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:49:56,043 INFO L93 Difference]: Finished difference Result 77 states and 127 transitions. [2020-11-09 15:49:56,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 15:49:56,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 15:49:56,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:49:56,044 INFO L225 Difference]: With dead ends: 77 [2020-11-09 15:49:56,044 INFO L226 Difference]: Without dead ends: 62 [2020-11-09 15:49:56,045 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-09 15:49:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-09 15:49:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2020-11-09 15:49:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-09 15:49:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 99 transitions. [2020-11-09 15:49:56,049 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 99 transitions. Word has length 16 [2020-11-09 15:49:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:49:56,049 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 99 transitions. [2020-11-09 15:49:56,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 15:49:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 99 transitions. [2020-11-09 15:49:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:49:56,050 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:49:56,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:49:56,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 15:49:56,051 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:49:56,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:49:56,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1825504767, now seen corresponding path program 2 times [2020-11-09 15:49:56,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:49:56,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266672828] [2020-11-09 15:49:56,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:49:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:49:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:49:56,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266672828] [2020-11-09 15:49:56,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:49:56,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:49:56,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [164356489] [2020-11-09 15:49:56,409 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:49:56,412 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:49:56,418 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 16 transitions. [2020-11-09 15:49:56,419 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:49:56,421 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:49:56,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 15:49:56,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:49:56,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 15:49:56,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:49:56,422 INFO L87 Difference]: Start difference. First operand 57 states and 99 transitions. Second operand 7 states. [2020-11-09 15:49:56,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:49:56,799 INFO L93 Difference]: Finished difference Result 86 states and 145 transitions. [2020-11-09 15:49:56,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:49:56,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-11-09 15:49:56,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:49:56,801 INFO L225 Difference]: With dead ends: 86 [2020-11-09 15:49:56,801 INFO L226 Difference]: Without dead ends: 86 [2020-11-09 15:49:56,801 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-09 15:49:56,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-11-09 15:49:56,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2020-11-09 15:49:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-09 15:49:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 116 transitions. [2020-11-09 15:49:56,806 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 116 transitions. Word has length 16 [2020-11-09 15:49:56,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:49:56,806 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 116 transitions. [2020-11-09 15:49:56,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 15:49:56,806 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 116 transitions. [2020-11-09 15:49:56,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:49:56,808 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:49:56,808 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:49:56,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 15:49:56,808 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:49:56,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:49:56,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1825504729, now seen corresponding path program 3 times [2020-11-09 15:49:56,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:49:56,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792322187] [2020-11-09 15:49:56,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:49:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:49:57,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:49:57,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792322187] [2020-11-09 15:49:57,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:49:57,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 15:49:57,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1340321880] [2020-11-09 15:49:57,408 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:49:57,411 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:49:57,416 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 16 transitions. [2020-11-09 15:49:57,416 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:49:57,417 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:49:57,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 15:49:57,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:49:57,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 15:49:57,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:49:57,418 INFO L87 Difference]: Start difference. First operand 70 states and 116 transitions. Second operand 10 states. [2020-11-09 15:49:57,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:49:57,943 INFO L93 Difference]: Finished difference Result 91 states and 146 transitions. [2020-11-09 15:49:57,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:49:57,944 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 15:49:57,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:49:57,945 INFO L225 Difference]: With dead ends: 91 [2020-11-09 15:49:57,945 INFO L226 Difference]: Without dead ends: 70 [2020-11-09 15:49:57,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-09 15:49:57,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-09 15:49:57,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2020-11-09 15:49:57,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-09 15:49:57,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 108 transitions. [2020-11-09 15:49:57,955 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 108 transitions. Word has length 16 [2020-11-09 15:49:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:49:57,970 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 108 transitions. [2020-11-09 15:49:57,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 15:49:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 108 transitions. [2020-11-09 15:49:57,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:49:57,973 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:49:57,973 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:49:57,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 15:49:57,973 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:49:57,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:49:57,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1400756409, now seen corresponding path program 3 times [2020-11-09 15:49:57,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:49:57,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946673070] [2020-11-09 15:49:57,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:49:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:49:58,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:49:58,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946673070] [2020-11-09 15:49:58,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:49:58,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 15:49:58,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2066834130] [2020-11-09 15:49:58,433 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:49:58,436 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:49:58,443 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 22 transitions. [2020-11-09 15:49:58,443 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:49:58,474 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:58,475 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:58,477 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:58,526 INFO L625 ElimStorePlain]: treesize reduction 98, result has 27.4 percent of original size [2020-11-09 15:49:58,526 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_197| vanished before elimination [2020-11-09 15:49:58,527 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-11-09 15:49:58,528 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:195, output treesize:37 [2020-11-09 15:49:58,551 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:58,555 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:58,557 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:58,559 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:58,560 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:58,621 INFO L625 ElimStorePlain]: treesize reduction 177, result has 20.6 percent of original size [2020-11-09 15:49:58,621 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_198| vanished before elimination [2020-11-09 15:49:58,622 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-11-09 15:49:58,622 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:323, output treesize:46 [2020-11-09 15:49:58,632 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:49:58,632 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 15:49:58,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:49:58,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 15:49:58,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-09 15:49:58,634 INFO L87 Difference]: Start difference. First operand 66 states and 108 transitions. Second operand 9 states. [2020-11-09 15:49:59,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:49:59,277 INFO L93 Difference]: Finished difference Result 118 states and 181 transitions. [2020-11-09 15:49:59,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 15:49:59,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-11-09 15:49:59,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:49:59,279 INFO L225 Difference]: With dead ends: 118 [2020-11-09 15:49:59,280 INFO L226 Difference]: Without dead ends: 118 [2020-11-09 15:49:59,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2020-11-09 15:49:59,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-11-09 15:49:59,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 77. [2020-11-09 15:49:59,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-09 15:49:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 128 transitions. [2020-11-09 15:49:59,285 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 128 transitions. Word has length 16 [2020-11-09 15:49:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:49:59,285 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 128 transitions. [2020-11-09 15:49:59,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 15:49:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 128 transitions. [2020-11-09 15:49:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:49:59,286 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:49:59,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:49:59,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 15:49:59,287 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:49:59,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:49:59,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1400756371, now seen corresponding path program 4 times [2020-11-09 15:49:59,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:49:59,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876611473] [2020-11-09 15:49:59,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:49:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:49:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:49:59,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876611473] [2020-11-09 15:49:59,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:49:59,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 15:49:59,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1060922598] [2020-11-09 15:49:59,895 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:49:59,897 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:49:59,901 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 22 transitions. [2020-11-09 15:49:59,902 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:49:59,919 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:59,923 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:59,925 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:59,974 INFO L625 ElimStorePlain]: treesize reduction 98, result has 25.2 percent of original size [2020-11-09 15:49:59,974 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_199| vanished before elimination [2020-11-09 15:49:59,974 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-11-09 15:49:59,975 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:191, output treesize:33 [2020-11-09 15:49:59,989 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:59,991 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:59,992 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:59,994 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:59,995 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-09 15:49:59,998 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:00,068 INFO L625 ElimStorePlain]: treesize reduction 194, result has 13.4 percent of original size [2020-11-09 15:50:00,068 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_200| vanished before elimination [2020-11-09 15:50:00,068 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-11-09 15:50:00,069 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:344, output treesize:30 [2020-11-09 15:50:00,069 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:50:00,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 15:50:00,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:50:00,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 15:50:00,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:50:00,074 INFO L87 Difference]: Start difference. First operand 77 states and 128 transitions. Second operand 10 states. [2020-11-09 15:50:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:50:00,480 INFO L93 Difference]: Finished difference Result 110 states and 181 transitions. [2020-11-09 15:50:00,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:50:00,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 15:50:00,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:50:00,482 INFO L225 Difference]: With dead ends: 110 [2020-11-09 15:50:00,482 INFO L226 Difference]: Without dead ends: 99 [2020-11-09 15:50:00,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-09 15:50:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-11-09 15:50:00,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2020-11-09 15:50:00,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-09 15:50:00,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 136 transitions. [2020-11-09 15:50:00,488 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 136 transitions. Word has length 16 [2020-11-09 15:50:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:50:00,490 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 136 transitions. [2020-11-09 15:50:00,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 15:50:00,491 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 136 transitions. [2020-11-09 15:50:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:50:00,491 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:50:00,491 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:50:00,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 15:50:00,492 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:50:00,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:50:00,494 INFO L82 PathProgramCache]: Analyzing trace with hash 330645179, now seen corresponding path program 5 times [2020-11-09 15:50:00,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:50:00,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114529797] [2020-11-09 15:50:00,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:50:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:50:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:50:01,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114529797] [2020-11-09 15:50:01,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:50:01,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 15:50:01,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1207438977] [2020-11-09 15:50:01,131 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:50:01,133 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:50:01,137 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 20 transitions. [2020-11-09 15:50:01,138 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:50:01,153 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:01,155 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:01,158 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:01,162 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:01,166 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:01,167 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:01,243 INFO L625 ElimStorePlain]: treesize reduction 194, result has 13.4 percent of original size [2020-11-09 15:50:01,243 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_201| vanished before elimination [2020-11-09 15:50:01,244 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-11-09 15:50:01,244 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:344, output treesize:30 [2020-11-09 15:50:01,245 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:50:01,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 15:50:01,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:50:01,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 15:50:01,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:50:01,246 INFO L87 Difference]: Start difference. First operand 81 states and 136 transitions. Second operand 10 states. [2020-11-09 15:50:01,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:50:01,723 INFO L93 Difference]: Finished difference Result 116 states and 191 transitions. [2020-11-09 15:50:01,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 15:50:01,727 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 15:50:01,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:50:01,728 INFO L225 Difference]: With dead ends: 116 [2020-11-09 15:50:01,728 INFO L226 Difference]: Without dead ends: 101 [2020-11-09 15:50:01,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-09 15:50:01,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-11-09 15:50:01,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 79. [2020-11-09 15:50:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-09 15:50:01,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 132 transitions. [2020-11-09 15:50:01,735 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 132 transitions. Word has length 16 [2020-11-09 15:50:01,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:50:01,736 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 132 transitions. [2020-11-09 15:50:01,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 15:50:01,736 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 132 transitions. [2020-11-09 15:50:01,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:50:01,737 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:50:01,737 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:50:01,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 15:50:01,737 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:50:01,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:50:01,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1002549257, now seen corresponding path program 6 times [2020-11-09 15:50:01,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:50:01,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480723004] [2020-11-09 15:50:01,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:50:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:50:02,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:50:02,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480723004] [2020-11-09 15:50:02,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:50:02,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 15:50:02,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [281983499] [2020-11-09 15:50:02,329 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:50:02,333 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:50:02,337 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 22 transitions. [2020-11-09 15:50:02,337 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:50:02,348 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:02,349 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:02,351 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:02,401 INFO L625 ElimStorePlain]: treesize reduction 98, result has 25.2 percent of original size [2020-11-09 15:50:02,401 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_202| vanished before elimination [2020-11-09 15:50:02,402 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-11-09 15:50:02,402 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:191, output treesize:33 [2020-11-09 15:50:02,412 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:02,414 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:02,416 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:02,420 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:02,421 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:02,423 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:02,484 INFO L625 ElimStorePlain]: treesize reduction 194, result has 13.4 percent of original size [2020-11-09 15:50:02,484 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_203| vanished before elimination [2020-11-09 15:50:02,485 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-11-09 15:50:02,485 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:344, output treesize:30 [2020-11-09 15:50:02,485 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:50:02,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 15:50:02,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:50:02,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 15:50:02,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:50:02,487 INFO L87 Difference]: Start difference. First operand 79 states and 132 transitions. Second operand 10 states. [2020-11-09 15:50:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:50:02,902 INFO L93 Difference]: Finished difference Result 104 states and 167 transitions. [2020-11-09 15:50:02,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:50:02,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 15:50:02,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:50:02,904 INFO L225 Difference]: With dead ends: 104 [2020-11-09 15:50:02,905 INFO L226 Difference]: Without dead ends: 93 [2020-11-09 15:50:02,905 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-09 15:50:02,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-11-09 15:50:02,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2020-11-09 15:50:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-09 15:50:02,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 134 transitions. [2020-11-09 15:50:02,910 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 134 transitions. Word has length 16 [2020-11-09 15:50:02,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:50:02,910 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 134 transitions. [2020-11-09 15:50:02,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 15:50:02,910 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 134 transitions. [2020-11-09 15:50:02,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:50:02,911 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:50:02,911 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:50:02,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 15:50:02,911 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:50:02,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:50:02,912 INFO L82 PathProgramCache]: Analyzing trace with hash 615893921, now seen corresponding path program 7 times [2020-11-09 15:50:02,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:50:02,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372164608] [2020-11-09 15:50:02,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:50:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:50:03,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:50:03,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372164608] [2020-11-09 15:50:03,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:50:03,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 15:50:03,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2055192791] [2020-11-09 15:50:03,542 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:50:03,545 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:50:03,550 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 20 transitions. [2020-11-09 15:50:03,550 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:50:03,569 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:03,574 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:03,575 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:03,578 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:03,579 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:03,581 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-11-09 15:50:03,682 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 23 [2020-11-09 15:50:03,683 INFO L625 ElimStorePlain]: treesize reduction 194, result has 13.4 percent of original size [2020-11-09 15:50:03,683 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_204| vanished before elimination [2020-11-09 15:50:03,683 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-11-09 15:50:03,683 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:344, output treesize:30 [2020-11-09 15:50:03,684 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:50:03,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 15:50:03,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:50:03,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 15:50:03,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:50:03,686 INFO L87 Difference]: Start difference. First operand 81 states and 134 transitions. Second operand 10 states. [2020-11-09 15:50:04,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:50:04,194 INFO L93 Difference]: Finished difference Result 110 states and 177 transitions. [2020-11-09 15:50:04,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 15:50:04,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 15:50:04,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:50:04,196 INFO L225 Difference]: With dead ends: 110 [2020-11-09 15:50:04,196 INFO L226 Difference]: Without dead ends: 95 [2020-11-09 15:50:04,197 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-09 15:50:04,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-09 15:50:04,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 79. [2020-11-09 15:50:04,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-09 15:50:04,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 130 transitions. [2020-11-09 15:50:04,200 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 130 transitions. Word has length 16 [2020-11-09 15:50:04,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:50:04,200 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 130 transitions. [2020-11-09 15:50:04,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 15:50:04,200 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 130 transitions. [2020-11-09 15:50:04,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:50:04,201 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:50:04,201 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:50:04,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 15:50:04,201 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:50:04,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:50:04,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1037223855, now seen corresponding path program 8 times [2020-11-09 15:50:04,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:50:04,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030362422] [2020-11-09 15:50:04,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:50:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:50:04,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:50:04,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030362422] [2020-11-09 15:50:04,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:50:04,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 15:50:04,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1784119434] [2020-11-09 15:50:04,809 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:50:04,811 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:50:04,814 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 18 transitions. [2020-11-09 15:50:04,814 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:50:04,816 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:50:04,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 15:50:04,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:50:04,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 15:50:04,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:50:04,817 INFO L87 Difference]: Start difference. First operand 79 states and 130 transitions. Second operand 10 states. [2020-11-09 15:50:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:50:05,320 INFO L93 Difference]: Finished difference Result 99 states and 159 transitions. [2020-11-09 15:50:05,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:50:05,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 15:50:05,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:50:05,323 INFO L225 Difference]: With dead ends: 99 [2020-11-09 15:50:05,323 INFO L226 Difference]: Without dead ends: 86 [2020-11-09 15:50:05,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-09 15:50:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-11-09 15:50:05,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2020-11-09 15:50:05,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-09 15:50:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 131 transitions. [2020-11-09 15:50:05,330 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 131 transitions. Word has length 16 [2020-11-09 15:50:05,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:50:05,330 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 131 transitions. [2020-11-09 15:50:05,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 15:50:05,330 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 131 transitions. [2020-11-09 15:50:05,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:50:05,331 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:50:05,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:50:05,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 15:50:05,331 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:50:05,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:50:05,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1150182227, now seen corresponding path program 9 times [2020-11-09 15:50:05,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:50:05,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414686691] [2020-11-09 15:50:05,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:50:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:50:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:50:05,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414686691] [2020-11-09 15:50:05,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:50:05,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 15:50:05,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1735458745] [2020-11-09 15:50:05,962 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:50:05,965 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:50:05,969 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 18 transitions. [2020-11-09 15:50:05,969 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:50:05,978 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:50:05,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 15:50:05,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:50:05,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 15:50:05,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:50:05,979 INFO L87 Difference]: Start difference. First operand 80 states and 131 transitions. Second operand 10 states. [2020-11-09 15:50:06,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:50:06,471 INFO L93 Difference]: Finished difference Result 95 states and 151 transitions. [2020-11-09 15:50:06,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:50:06,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 15:50:06,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:50:06,479 INFO L225 Difference]: With dead ends: 95 [2020-11-09 15:50:06,480 INFO L226 Difference]: Without dead ends: 79 [2020-11-09 15:50:06,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-09 15:50:06,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-09 15:50:06,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2020-11-09 15:50:06,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-09 15:50:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 126 transitions. [2020-11-09 15:50:06,483 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 126 transitions. Word has length 16 [2020-11-09 15:50:06,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:50:06,483 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 126 transitions. [2020-11-09 15:50:06,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 15:50:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 126 transitions. [2020-11-09 15:50:06,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:50:06,484 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:50:06,485 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:50:06,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 15:50:06,485 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:50:06,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:50:06,486 INFO L82 PathProgramCache]: Analyzing trace with hash -123632883, now seen corresponding path program 10 times [2020-11-09 15:50:06,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:50:06,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878166786] [2020-11-09 15:50:06,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:50:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:50:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:50:07,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878166786] [2020-11-09 15:50:07,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:50:07,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 15:50:07,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1604300428] [2020-11-09 15:50:07,242 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:50:07,245 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:50:07,249 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 16 transitions. [2020-11-09 15:50:07,249 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:50:07,250 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:50:07,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 15:50:07,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:50:07,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 15:50:07,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:50:07,253 INFO L87 Difference]: Start difference. First operand 77 states and 126 transitions. Second operand 10 states. [2020-11-09 15:50:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:50:07,743 INFO L93 Difference]: Finished difference Result 99 states and 158 transitions. [2020-11-09 15:50:07,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:50:07,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 15:50:07,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:50:07,745 INFO L225 Difference]: With dead ends: 99 [2020-11-09 15:50:07,745 INFO L226 Difference]: Without dead ends: 82 [2020-11-09 15:50:07,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-09 15:50:07,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-11-09 15:50:07,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2020-11-09 15:50:07,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-09 15:50:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 125 transitions. [2020-11-09 15:50:07,749 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 125 transitions. Word has length 16 [2020-11-09 15:50:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:50:07,749 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 125 transitions. [2020-11-09 15:50:07,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 15:50:07,749 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 125 transitions. [2020-11-09 15:50:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:50:07,750 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:50:07,750 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:50:07,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-09 15:50:07,751 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:50:07,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:50:07,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1031972303, now seen corresponding path program 11 times [2020-11-09 15:50:07,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:50:07,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357717633] [2020-11-09 15:50:07,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:50:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:50:08,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:50:08,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357717633] [2020-11-09 15:50:08,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:50:08,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 15:50:08,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [539027723] [2020-11-09 15:50:08,336 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:50:08,341 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:50:08,345 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 16 transitions. [2020-11-09 15:50:08,345 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:50:08,346 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:50:08,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 15:50:08,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:50:08,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 15:50:08,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:50:08,348 INFO L87 Difference]: Start difference. First operand 77 states and 125 transitions. Second operand 10 states. [2020-11-09 15:50:08,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:50:08,849 INFO L93 Difference]: Finished difference Result 96 states and 152 transitions. [2020-11-09 15:50:08,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:50:08,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 15:50:08,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:50:08,850 INFO L225 Difference]: With dead ends: 96 [2020-11-09 15:50:08,850 INFO L226 Difference]: Without dead ends: 83 [2020-11-09 15:50:08,851 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-09 15:50:08,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-11-09 15:50:08,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2020-11-09 15:50:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-11-09 15:50:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 126 transitions. [2020-11-09 15:50:08,855 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 126 transitions. Word has length 16 [2020-11-09 15:50:08,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:50:08,856 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 126 transitions. [2020-11-09 15:50:08,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 15:50:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 126 transitions. [2020-11-09 15:50:08,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:50:08,859 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:50:08,859 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:50:08,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-09 15:50:08,860 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:50:08,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:50:08,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1144930675, now seen corresponding path program 12 times [2020-11-09 15:50:08,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:50:08,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607338373] [2020-11-09 15:50:08,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:50:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:50:08,968 ERROR L253 erpolLogProxyWrapper]: Interpolant 3 not inductive [2020-11-09 15:50:09,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-09 15:50:09,056 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:876) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:241) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:378) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-09 15:50:09,067 INFO L168 Benchmark]: Toolchain (without parser) took 50680.69 ms. Allocated memory was 151.0 MB in the beginning and 373.3 MB in the end (delta: 222.3 MB). Free memory was 122.6 MB in the beginning and 169.0 MB in the end (delta: -46.4 MB). Peak memory consumption was 176.6 MB. Max. memory is 8.0 GB. [2020-11-09 15:50:09,067 INFO L168 Benchmark]: CDTParser took 0.80 ms. Allocated memory is still 151.0 MB. Free memory is still 123.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 15:50:09,068 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1369.71 ms. Allocated memory was 151.0 MB in the beginning and 188.7 MB in the end (delta: 37.7 MB). Free memory was 121.9 MB in the beginning and 137.9 MB in the end (delta: -16.0 MB). Peak memory consumption was 79.8 MB. Max. memory is 8.0 GB. [2020-11-09 15:50:09,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.65 ms. Allocated memory is still 188.7 MB. Free memory was 137.9 MB in the beginning and 134.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:50:09,071 INFO L168 Benchmark]: Boogie Preprocessor took 59.00 ms. Allocated memory is still 188.7 MB. Free memory was 134.8 MB in the beginning and 132.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:50:09,071 INFO L168 Benchmark]: RCFGBuilder took 1057.49 ms. Allocated memory is still 188.7 MB. Free memory was 132.2 MB in the beginning and 81.3 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.3 MB. Max. memory is 8.0 GB. [2020-11-09 15:50:09,072 INFO L168 Benchmark]: TraceAbstraction took 48093.08 ms. Allocated memory was 188.7 MB in the beginning and 373.3 MB in the end (delta: 184.5 MB). Free memory was 80.8 MB in the beginning and 169.0 MB in the end (delta: -88.2 MB). Peak memory consumption was 96.3 MB. Max. memory is 8.0 GB. [2020-11-09 15:50:09,082 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.80 ms. Allocated memory is still 151.0 MB. Free memory is still 123.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1369.71 ms. Allocated memory was 151.0 MB in the beginning and 188.7 MB in the end (delta: 37.7 MB). Free memory was 121.9 MB in the beginning and 137.9 MB in the end (delta: -16.0 MB). Peak memory consumption was 79.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 88.65 ms. Allocated memory is still 188.7 MB. Free memory was 137.9 MB in the beginning and 134.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 59.00 ms. Allocated memory is still 188.7 MB. Free memory was 134.8 MB in the beginning and 132.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1057.49 ms. Allocated memory is still 188.7 MB. Free memory was 132.2 MB in the beginning and 81.3 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 48093.08 ms. Allocated memory was 188.7 MB in the beginning and 373.3 MB in the end (delta: 184.5 MB). Free memory was 80.8 MB in the beginning and 169.0 MB in the end (delta: -88.2 MB). Peak memory consumption was 96.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 981 VarBasedMoverChecksPositive, 37 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 19 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 29.9s, 168 PlacesBefore, 34 PlacesAfterwards, 178 TransitionsBefore, 32 TransitionsAfterwards, 1872 CoEnabledTransitionPairs, 8 FixpointIterations, 112 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 22 TrivialYvCompositions, 24 ConcurrentYvCompositions, 12 ChoiceCompositions, 222 TotalNumberOfCompositions, 3600 MoverChecksTotal - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...