/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.epf -i ../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 14:20:11,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 14:20:11,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 14:20:11,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 14:20:11,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 14:20:11,942 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 14:20:11,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 14:20:11,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 14:20:11,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 14:20:11,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 14:20:11,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 14:20:11,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 14:20:11,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 14:20:11,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 14:20:11,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 14:20:11,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 14:20:11,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 14:20:11,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 14:20:11,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 14:20:11,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 14:20:11,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 14:20:12,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 14:20:12,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 14:20:12,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 14:20:12,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 14:20:12,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 14:20:12,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 14:20:12,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 14:20:12,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 14:20:12,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 14:20:12,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 14:20:12,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 14:20:12,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 14:20:12,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 14:20:12,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 14:20:12,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 14:20:12,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 14:20:12,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 14:20:12,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 14:20:12,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 14:20:12,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 14:20:12,030 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-11-09 14:20:12,058 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 14:20:12,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 14:20:12,060 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 14:20:12,060 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 14:20:12,061 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 14:20:12,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 14:20:12,061 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 14:20:12,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 14:20:12,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 14:20:12,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 14:20:12,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 14:20:12,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 14:20:12,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 14:20:12,063 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 14:20:12,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 14:20:12,063 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 14:20:12,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 14:20:12,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 14:20:12,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 14:20:12,064 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 14:20:12,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 14:20:12,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 14:20:12,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 14:20:12,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 14:20:12,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 14:20:12,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 14:20:12,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 14:20:12,066 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 14:20:12,066 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 14:20:12,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 14:20:12,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 14:20:12,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 14:20:12,489 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 14:20:12,490 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 14:20:12,491 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2020-11-09 14:20:12,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/460357089/b941ba1a8c134320a507a0b5e2f6f353/FLAG33eb62359 [2020-11-09 14:20:13,518 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 14:20:13,518 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2020-11-09 14:20:13,543 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/460357089/b941ba1a8c134320a507a0b5e2f6f353/FLAG33eb62359 [2020-11-09 14:20:13,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/460357089/b941ba1a8c134320a507a0b5e2f6f353 [2020-11-09 14:20:13,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 14:20:13,634 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 14:20:13,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 14:20:13,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 14:20:13,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 14:20:13,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:20:13" (1/1) ... [2020-11-09 14:20:13,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b74add1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:13, skipping insertion in model container [2020-11-09 14:20:13,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:20:13" (1/1) ... [2020-11-09 14:20:13,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 14:20:13,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 14:20:14,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 14:20:14,597 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 14:20:14,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 14:20:15,215 INFO L208 MainTranslator]: Completed translation [2020-11-09 14:20:15,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:15 WrapperNode [2020-11-09 14:20:15,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 14:20:15,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 14:20:15,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 14:20:15,218 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 14:20:15,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:15" (1/1) ... [2020-11-09 14:20:15,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:15" (1/1) ... [2020-11-09 14:20:15,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 14:20:15,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 14:20:15,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 14:20:15,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 14:20:15,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:15" (1/1) ... [2020-11-09 14:20:15,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:15" (1/1) ... [2020-11-09 14:20:15,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:15" (1/1) ... [2020-11-09 14:20:15,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:15" (1/1) ... [2020-11-09 14:20:15,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:15" (1/1) ... [2020-11-09 14:20:15,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:15" (1/1) ... [2020-11-09 14:20:15,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:15" (1/1) ... [2020-11-09 14:20:15,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 14:20:15,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 14:20:15,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 14:20:15,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 14:20:15,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:15" (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 14:20:15,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 14:20:15,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-09 14:20:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-11-09 14:20:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-09 14:20:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 14:20:15,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 14:20:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-11-09 14:20:15,495 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-11-09 14:20:15,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 14:20:15,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 14:20:15,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 14:20:15,498 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 14:20:16,218 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 14:20:16,218 INFO L298 CfgBuilder]: Removed 36 assume(true) statements. [2020-11-09 14:20:16,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:20:16 BoogieIcfgContainer [2020-11-09 14:20:16,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 14:20:16,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 14:20:16,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 14:20:16,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 14:20:16,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:20:13" (1/3) ... [2020-11-09 14:20:16,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611010b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:20:16, skipping insertion in model container [2020-11-09 14:20:16,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:15" (2/3) ... [2020-11-09 14:20:16,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611010b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:20:16, skipping insertion in model container [2020-11-09 14:20:16,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:20:16" (3/3) ... [2020-11-09 14:20:16,230 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2020-11-09 14:20:16,247 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 14:20:16,247 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 14:20:16,252 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-11-09 14:20:16,253 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 14:20:16,299 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,300 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,300 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,300 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,300 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,301 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,301 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,301 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,301 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,302 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,302 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,302 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,302 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,302 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,302 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,303 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,303 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,303 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,303 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,304 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,304 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,304 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,304 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,304 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,305 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,305 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,305 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,305 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,305 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,306 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,306 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,306 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,306 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,306 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,307 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,307 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,307 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,307 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,307 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,308 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,308 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,308 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,308 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,309 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,309 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,309 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,309 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,310 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,310 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,310 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,310 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,311 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,311 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,311 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,311 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,312 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,312 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,312 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,312 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,312 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,313 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,313 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,313 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,313 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,314 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,314 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,314 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,314 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,314 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,315 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,315 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,315 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,315 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,316 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,316 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,316 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,316 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,316 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,317 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,317 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,317 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,317 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,317 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,317 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,318 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,318 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,318 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,318 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,318 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,319 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,319 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,319 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,319 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,319 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,320 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,320 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,320 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,320 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,320 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,321 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,321 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,321 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,321 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,322 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,322 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,322 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,322 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,322 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,323 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,323 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,323 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,323 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,324 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,324 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,324 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,324 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,325 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,325 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,325 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,325 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,325 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,326 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,326 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,326 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,326 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,326 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,327 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,327 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,327 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,327 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,328 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,328 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,328 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,328 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,329 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,329 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,329 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,329 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,329 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,329 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,332 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,333 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,333 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,333 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,333 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,333 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,334 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,334 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,334 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,334 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,334 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,335 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,342 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,342 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,342 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,343 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,343 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,343 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,343 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,343 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,344 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,344 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,344 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,344 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:16,355 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-11-09 14:20:16,368 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-11-09 14:20:16,393 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 14:20:16,393 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 14:20:16,393 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 14:20:16,394 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-09 14:20:16,394 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 14:20:16,394 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 14:20:16,394 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 14:20:16,394 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 14:20:16,412 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 14:20:16,413 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 189 transitions, 400 flow [2020-11-09 14:20:16,417 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 189 transitions, 400 flow [2020-11-09 14:20:16,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 179 places, 189 transitions, 400 flow [2020-11-09 14:20:16,511 INFO L129 PetriNetUnfolder]: 19/237 cut-off events. [2020-11-09 14:20:16,511 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-11-09 14:20:16,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 237 events. 19/237 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 508 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 131. Up to 4 conditions per place. [2020-11-09 14:20:16,525 INFO L116 LiptonReduction]: Number of co-enabled transitions 3444 [2020-11-09 14:20:17,835 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 14:20:17,862 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:17,867 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 14:20:17,883 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:17,885 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 14:20:17,885 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-11-09 14:20:17,947 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 14:20:17,965 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:17,970 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 14:20:17,984 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:17,985 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 14:20:17,986 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-11-09 14:20:23,052 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 14:20:23,572 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2020-11-09 14:20:24,120 WARN L194 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2020-11-09 14:20:24,443 WARN L194 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2020-11-09 14:20:24,570 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-11-09 14:20:24,761 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 14:20:24,790 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:24,795 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 14:20:24,816 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:24,818 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 14:20:24,819 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-11-09 14:20:24,903 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 14:20:24,933 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:24,941 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 14:20:24,963 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:24,964 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 14:20:24,965 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-11-09 14:20:25,256 WARN L194 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 82 [2020-11-09 14:20:25,568 WARN L194 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 82 [2020-11-09 14:20:26,124 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2020-11-09 14:20:27,330 WARN L194 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 135 [2020-11-09 14:20:27,778 WARN L194 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-11-09 14:20:28,624 WARN L194 SmtUtils]: Spent 844.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 135 [2020-11-09 14:20:29,002 WARN L194 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-11-09 14:20:29,128 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2020-11-09 14:20:29,343 WARN L194 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2020-11-09 14:20:29,556 WARN L194 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2020-11-09 14:20:29,759 WARN L194 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2020-11-09 14:20:30,143 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2020-11-09 14:20:30,502 WARN L194 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2020-11-09 14:20:32,102 WARN L194 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 168 DAG size of output: 164 [2020-11-09 14:20:32,148 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 14:20:33,023 WARN L194 SmtUtils]: Spent 874.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-11-09 14:20:33,023 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:33,034 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 14:20:33,776 WARN L194 SmtUtils]: Spent 741.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2020-11-09 14:20:33,777 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:33,778 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 14:20:33,778 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:350, output treesize:362 [2020-11-09 14:20:34,509 WARN L194 SmtUtils]: Spent 729.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2020-11-09 14:20:36,135 WARN L194 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 177 DAG size of output: 173 [2020-11-09 14:20:36,181 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 14:20:37,051 WARN L194 SmtUtils]: Spent 868.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-09 14:20:37,055 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:37,071 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 14:20:37,886 WARN L194 SmtUtils]: Spent 814.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-11-09 14:20:37,887 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:37,888 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 14:20:37,889 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:359, output treesize:371 [2020-11-09 14:20:38,714 WARN L194 SmtUtils]: Spent 822.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-11-09 14:20:39,712 WARN L194 SmtUtils]: Spent 995.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 158 [2020-11-09 14:20:40,240 WARN L194 SmtUtils]: Spent 509.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2020-11-09 14:20:41,350 WARN L194 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 171 DAG size of output: 167 [2020-11-09 14:20:41,905 WARN L194 SmtUtils]: Spent 546.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-11-09 14:20:41,946 INFO L131 LiptonReduction]: Checked pairs total: 7933 [2020-11-09 14:20:41,946 INFO L133 LiptonReduction]: Total number of compositions: 237 [2020-11-09 14:20:41,953 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 40 transitions, 102 flow [2020-11-09 14:20:41,986 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 425 states. [2020-11-09 14:20:41,990 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2020-11-09 14:20:41,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-11-09 14:20:41,999 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:41,999 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-11-09 14:20:42,000 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 14:20:42,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:42,006 INFO L82 PathProgramCache]: Analyzing trace with hash 723, now seen corresponding path program 1 times [2020-11-09 14:20:42,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:42,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631098445] [2020-11-09 14:20:42,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:42,354 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 14:20:42,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631098445] [2020-11-09 14:20:42,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:42,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-11-09 14:20:42,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614281420] [2020-11-09 14:20:42,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-09 14:20:42,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:42,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-09 14:20:42,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-09 14:20:42,384 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 2 states. [2020-11-09 14:20:42,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:42,421 INFO L93 Difference]: Finished difference Result 423 states and 1029 transitions. [2020-11-09 14:20:42,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-09 14:20:42,423 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-11-09 14:20:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:42,440 INFO L225 Difference]: With dead ends: 423 [2020-11-09 14:20:42,441 INFO L226 Difference]: Without dead ends: 385 [2020-11-09 14:20:42,442 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 14:20:42,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-11-09 14:20:42,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2020-11-09 14:20:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-11-09 14:20:42,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 931 transitions. [2020-11-09 14:20:42,525 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 931 transitions. Word has length 1 [2020-11-09 14:20:42,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:42,526 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 931 transitions. [2020-11-09 14:20:42,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-09 14:20:42,526 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 931 transitions. [2020-11-09 14:20:42,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-11-09 14:20:42,527 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:42,527 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-11-09 14:20:42,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 14:20:42,527 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 14:20:42,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:42,528 INFO L82 PathProgramCache]: Analyzing trace with hash 22064617, now seen corresponding path program 1 times [2020-11-09 14:20:42,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:42,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788276969] [2020-11-09 14:20:42,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:42,753 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 14:20:42,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788276969] [2020-11-09 14:20:42,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:42,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 14:20:42,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342230990] [2020-11-09 14:20:42,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 14:20:42,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:42,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 14:20:42,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 14:20:42,757 INFO L87 Difference]: Start difference. First operand 385 states and 931 transitions. Second operand 3 states. [2020-11-09 14:20:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:42,880 INFO L93 Difference]: Finished difference Result 540 states and 1306 transitions. [2020-11-09 14:20:42,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 14:20:42,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-11-09 14:20:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:42,889 INFO L225 Difference]: With dead ends: 540 [2020-11-09 14:20:42,889 INFO L226 Difference]: Without dead ends: 540 [2020-11-09 14:20:42,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 14:20:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-11-09 14:20:42,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 444. [2020-11-09 14:20:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-11-09 14:20:42,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1086 transitions. [2020-11-09 14:20:42,945 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1086 transitions. Word has length 4 [2020-11-09 14:20:42,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:42,946 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 1086 transitions. [2020-11-09 14:20:42,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 14:20:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1086 transitions. [2020-11-09 14:20:42,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-09 14:20:42,947 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:42,948 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-09 14:20:42,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 14:20:42,948 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 14:20:42,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:42,949 INFO L82 PathProgramCache]: Analyzing trace with hash -270739087, now seen corresponding path program 1 times [2020-11-09 14:20:42,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:42,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898671264] [2020-11-09 14:20:42,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:43,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898671264] [2020-11-09 14:20:43,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:43,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 14:20:43,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950244895] [2020-11-09 14:20:43,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 14:20:43,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:43,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 14:20:43,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 14:20:43,140 INFO L87 Difference]: Start difference. First operand 444 states and 1086 transitions. Second operand 5 states. [2020-11-09 14:20:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:43,368 INFO L93 Difference]: Finished difference Result 600 states and 1430 transitions. [2020-11-09 14:20:43,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 14:20:43,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-11-09 14:20:43,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:43,375 INFO L225 Difference]: With dead ends: 600 [2020-11-09 14:20:43,375 INFO L226 Difference]: Without dead ends: 514 [2020-11-09 14:20:43,376 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 14:20:43,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-11-09 14:20:43,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 482. [2020-11-09 14:20:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-11-09 14:20:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1195 transitions. [2020-11-09 14:20:43,411 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1195 transitions. Word has length 6 [2020-11-09 14:20:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:43,411 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1195 transitions. [2020-11-09 14:20:43,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 14:20:43,412 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1195 transitions. [2020-11-09 14:20:43,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 14:20:43,414 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:43,414 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:43,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 14:20:43,414 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 14:20:43,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:43,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1711454574, now seen corresponding path program 1 times [2020-11-09 14:20:43,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:43,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190390554] [2020-11-09 14:20:43,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:43,484 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 14:20:43,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190390554] [2020-11-09 14:20:43,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:43,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 14:20:43,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692306719] [2020-11-09 14:20:43,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 14:20:43,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:43,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 14:20:43,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 14:20:43,488 INFO L87 Difference]: Start difference. First operand 482 states and 1195 transitions. Second operand 3 states. [2020-11-09 14:20:43,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:43,508 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-11-09 14:20:43,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 14:20:43,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-09 14:20:43,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:43,510 INFO L225 Difference]: With dead ends: 162 [2020-11-09 14:20:43,510 INFO L226 Difference]: Without dead ends: 162 [2020-11-09 14:20:43,511 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 14:20:43,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-11-09 14:20:43,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-11-09 14:20:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-11-09 14:20:43,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-11-09 14:20:43,517 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-11-09 14:20:43,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:43,517 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-11-09 14:20:43,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 14:20:43,518 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-11-09 14:20:43,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:20:43,520 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:43,520 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:43,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 14:20:43,520 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 14:20:43,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:43,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1613525791, now seen corresponding path program 1 times [2020-11-09 14:20:43,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:43,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687079316] [2020-11-09 14:20:43,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:43,733 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 14:20:43,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687079316] [2020-11-09 14:20:43,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:43,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 14:20:43,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415107906] [2020-11-09 14:20:43,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 14:20:43,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:43,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 14:20:43,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-09 14:20:43,736 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 9 states. [2020-11-09 14:20:44,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:44,152 INFO L93 Difference]: Finished difference Result 194 states and 403 transitions. [2020-11-09 14:20:44,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:20:44,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-11-09 14:20:44,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:44,155 INFO L225 Difference]: With dead ends: 194 [2020-11-09 14:20:44,155 INFO L226 Difference]: Without dead ends: 194 [2020-11-09 14:20:44,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2020-11-09 14:20:44,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-11-09 14:20:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 186. [2020-11-09 14:20:44,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-11-09 14:20:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 389 transitions. [2020-11-09 14:20:44,167 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 389 transitions. Word has length 22 [2020-11-09 14:20:44,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:44,168 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 389 transitions. [2020-11-09 14:20:44,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 14:20:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 389 transitions. [2020-11-09 14:20:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:20:44,178 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:44,178 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:44,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 14:20:44,179 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 14:20:44,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:44,180 INFO L82 PathProgramCache]: Analyzing trace with hash -721777329, now seen corresponding path program 1 times [2020-11-09 14:20:44,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:44,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234189531] [2020-11-09 14:20:44,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:44,389 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 14:20:44,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234189531] [2020-11-09 14:20:44,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:44,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 14:20:44,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510414797] [2020-11-09 14:20:44,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 14:20:44,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:44,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 14:20:44,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-09 14:20:44,392 INFO L87 Difference]: Start difference. First operand 186 states and 389 transitions. Second operand 6 states. [2020-11-09 14:20:44,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:44,518 INFO L93 Difference]: Finished difference Result 226 states and 457 transitions. [2020-11-09 14:20:44,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 14:20:44,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-11-09 14:20:44,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:44,522 INFO L225 Difference]: With dead ends: 226 [2020-11-09 14:20:44,522 INFO L226 Difference]: Without dead ends: 226 [2020-11-09 14:20:44,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-09 14:20:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-11-09 14:20:44,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 198. [2020-11-09 14:20:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-11-09 14:20:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 409 transitions. [2020-11-09 14:20:44,530 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 409 transitions. Word has length 22 [2020-11-09 14:20:44,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:44,530 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 409 transitions. [2020-11-09 14:20:44,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 14:20:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 409 transitions. [2020-11-09 14:20:44,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:20:44,532 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:44,533 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:44,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 14:20:44,533 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 14:20:44,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:44,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1148795979, now seen corresponding path program 2 times [2020-11-09 14:20:44,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:44,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517551379] [2020-11-09 14:20:44,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:45,473 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 14:20:45,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517551379] [2020-11-09 14:20:45,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:45,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:20:45,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112515930] [2020-11-09 14:20:45,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:20:45,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:45,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:20:45,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:20:45,476 INFO L87 Difference]: Start difference. First operand 198 states and 409 transitions. Second operand 14 states. [2020-11-09 14:20:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:46,611 INFO L93 Difference]: Finished difference Result 227 states and 452 transitions. [2020-11-09 14:20:46,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-09 14:20:46,611 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:20:46,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:46,613 INFO L225 Difference]: With dead ends: 227 [2020-11-09 14:20:46,613 INFO L226 Difference]: Without dead ends: 227 [2020-11-09 14:20:46,613 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:20:46,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-11-09 14:20:46,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2020-11-09 14:20:46,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-11-09 14:20:46,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 452 transitions. [2020-11-09 14:20:46,620 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 452 transitions. Word has length 22 [2020-11-09 14:20:46,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:46,621 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 452 transitions. [2020-11-09 14:20:46,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:20:46,621 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 452 transitions. [2020-11-09 14:20:46,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:20:46,622 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:46,622 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:46,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 14:20:46,623 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 14:20:46,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:46,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1148795934, now seen corresponding path program 1 times [2020-11-09 14:20:46,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:46,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454158770] [2020-11-09 14:20:46,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:46,925 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 14:20:46,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454158770] [2020-11-09 14:20:46,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:46,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 14:20:46,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353001062] [2020-11-09 14:20:46,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 14:20:46,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:46,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 14:20:46,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-09 14:20:46,927 INFO L87 Difference]: Start difference. First operand 226 states and 452 transitions. Second operand 9 states. [2020-11-09 14:20:47,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:47,367 INFO L93 Difference]: Finished difference Result 295 states and 565 transitions. [2020-11-09 14:20:47,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 14:20:47,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-11-09 14:20:47,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:47,370 INFO L225 Difference]: With dead ends: 295 [2020-11-09 14:20:47,370 INFO L226 Difference]: Without dead ends: 265 [2020-11-09 14:20:47,371 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:20:47,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-11-09 14:20:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 227. [2020-11-09 14:20:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2020-11-09 14:20:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 456 transitions. [2020-11-09 14:20:47,394 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 456 transitions. Word has length 22 [2020-11-09 14:20:47,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:47,394 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 456 transitions. [2020-11-09 14:20:47,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 14:20:47,395 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 456 transitions. [2020-11-09 14:20:47,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:20:47,396 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:47,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:47,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 14:20:47,396 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 14:20:47,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:47,397 INFO L82 PathProgramCache]: Analyzing trace with hash 235549017, now seen corresponding path program 3 times [2020-11-09 14:20:47,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:47,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064484558] [2020-11-09 14:20:47,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:48,227 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 14:20:48,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064484558] [2020-11-09 14:20:48,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:48,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:20:48,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282830472] [2020-11-09 14:20:48,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:20:48,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:48,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:20:48,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:20:48,232 INFO L87 Difference]: Start difference. First operand 227 states and 456 transitions. Second operand 14 states. [2020-11-09 14:20:49,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:49,309 INFO L93 Difference]: Finished difference Result 257 states and 502 transitions. [2020-11-09 14:20:49,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-09 14:20:49,310 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:20:49,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:49,312 INFO L225 Difference]: With dead ends: 257 [2020-11-09 14:20:49,312 INFO L226 Difference]: Without dead ends: 229 [2020-11-09 14:20:49,313 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:20:49,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-11-09 14:20:49,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2020-11-09 14:20:49,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-11-09 14:20:49,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 459 transitions. [2020-11-09 14:20:49,320 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 459 transitions. Word has length 22 [2020-11-09 14:20:49,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:49,320 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 459 transitions. [2020-11-09 14:20:49,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:20:49,321 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 459 transitions. [2020-11-09 14:20:49,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:20:49,322 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:49,322 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:49,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 14:20:49,322 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 14:20:49,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:49,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1400369243, now seen corresponding path program 4 times [2020-11-09 14:20:49,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:49,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915646038] [2020-11-09 14:20:49,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:50,028 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 14:20:50,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915646038] [2020-11-09 14:20:50,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:50,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:20:50,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977897639] [2020-11-09 14:20:50,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:20:50,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:50,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:20:50,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:20:50,031 INFO L87 Difference]: Start difference. First operand 229 states and 459 transitions. Second operand 14 states. [2020-11-09 14:20:51,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:51,101 INFO L93 Difference]: Finished difference Result 280 states and 545 transitions. [2020-11-09 14:20:51,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-09 14:20:51,101 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:20:51,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:51,104 INFO L225 Difference]: With dead ends: 280 [2020-11-09 14:20:51,105 INFO L226 Difference]: Without dead ends: 253 [2020-11-09 14:20:51,105 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:20:51,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-11-09 14:20:51,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 233. [2020-11-09 14:20:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-11-09 14:20:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 465 transitions. [2020-11-09 14:20:51,114 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 465 transitions. Word has length 22 [2020-11-09 14:20:51,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:51,114 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 465 transitions. [2020-11-09 14:20:51,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:20:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 465 transitions. [2020-11-09 14:20:51,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:20:51,115 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:51,115 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:51,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 14:20:51,116 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 14:20:51,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:51,116 INFO L82 PathProgramCache]: Analyzing trace with hash -223372275, now seen corresponding path program 5 times [2020-11-09 14:20:51,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:51,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816264938] [2020-11-09 14:20:51,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:51,896 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 14:20:51,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816264938] [2020-11-09 14:20:51,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:51,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:20:51,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448749835] [2020-11-09 14:20:51,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:20:51,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:51,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:20:51,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:20:51,900 INFO L87 Difference]: Start difference. First operand 233 states and 465 transitions. Second operand 14 states. [2020-11-09 14:20:53,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:53,033 INFO L93 Difference]: Finished difference Result 273 states and 529 transitions. [2020-11-09 14:20:53,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-09 14:20:53,034 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:20:53,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:53,036 INFO L225 Difference]: With dead ends: 273 [2020-11-09 14:20:53,036 INFO L226 Difference]: Without dead ends: 273 [2020-11-09 14:20:53,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:20:53,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-11-09 14:20:53,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 266. [2020-11-09 14:20:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2020-11-09 14:20:53,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 518 transitions. [2020-11-09 14:20:53,048 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 518 transitions. Word has length 22 [2020-11-09 14:20:53,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:53,048 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 518 transitions. [2020-11-09 14:20:53,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:20:53,049 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 518 transitions. [2020-11-09 14:20:53,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:20:53,052 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:53,052 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:53,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 14:20:53,052 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 14:20:53,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:53,053 INFO L82 PathProgramCache]: Analyzing trace with hash -223372320, now seen corresponding path program 2 times [2020-11-09 14:20:53,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:53,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306813182] [2020-11-09 14:20:53,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:53,287 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 14:20:53,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306813182] [2020-11-09 14:20:53,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:53,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 14:20:53,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111206798] [2020-11-09 14:20:53,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 14:20:53,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:53,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 14:20:53,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-09 14:20:53,291 INFO L87 Difference]: Start difference. First operand 266 states and 518 transitions. Second operand 9 states. [2020-11-09 14:20:53,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:53,742 INFO L93 Difference]: Finished difference Result 367 states and 686 transitions. [2020-11-09 14:20:53,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 14:20:53,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-11-09 14:20:53,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:53,746 INFO L225 Difference]: With dead ends: 367 [2020-11-09 14:20:53,746 INFO L226 Difference]: Without dead ends: 338 [2020-11-09 14:20:53,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:20:53,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-11-09 14:20:53,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 258. [2020-11-09 14:20:53,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-11-09 14:20:53,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 514 transitions. [2020-11-09 14:20:53,756 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 514 transitions. Word has length 22 [2020-11-09 14:20:53,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:53,757 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 514 transitions. [2020-11-09 14:20:53,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 14:20:53,757 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 514 transitions. [2020-11-09 14:20:53,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:20:53,760 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:53,760 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:53,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 14:20:53,761 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 14:20:53,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:53,761 INFO L82 PathProgramCache]: Analyzing trace with hash 783436301, now seen corresponding path program 6 times [2020-11-09 14:20:53,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:53,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959553798] [2020-11-09 14:20:53,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:54,581 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 14:20:54,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959553798] [2020-11-09 14:20:54,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:54,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:20:54,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348897915] [2020-11-09 14:20:54,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:20:54,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:54,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:20:54,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:20:54,584 INFO L87 Difference]: Start difference. First operand 258 states and 514 transitions. Second operand 14 states. [2020-11-09 14:20:55,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:55,698 INFO L93 Difference]: Finished difference Result 284 states and 551 transitions. [2020-11-09 14:20:55,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-09 14:20:55,699 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:20:55,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:55,701 INFO L225 Difference]: With dead ends: 284 [2020-11-09 14:20:55,702 INFO L226 Difference]: Without dead ends: 267 [2020-11-09 14:20:55,702 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2020-11-09 14:20:55,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-11-09 14:20:55,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 262. [2020-11-09 14:20:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2020-11-09 14:20:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 520 transitions. [2020-11-09 14:20:55,710 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 520 transitions. Word has length 22 [2020-11-09 14:20:55,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:55,710 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 520 transitions. [2020-11-09 14:20:55,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:20:55,710 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 520 transitions. [2020-11-09 14:20:55,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:20:55,711 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:55,711 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:55,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 14:20:55,712 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 14:20:55,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:55,712 INFO L82 PathProgramCache]: Analyzing trace with hash -617705459, now seen corresponding path program 7 times [2020-11-09 14:20:55,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:55,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666952224] [2020-11-09 14:20:55,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:56,359 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 14:20:56,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666952224] [2020-11-09 14:20:56,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:56,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:20:56,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651329352] [2020-11-09 14:20:56,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:20:56,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:56,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:20:56,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:20:56,363 INFO L87 Difference]: Start difference. First operand 262 states and 520 transitions. Second operand 14 states. [2020-11-09 14:20:57,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:57,239 INFO L93 Difference]: Finished difference Result 273 states and 531 transitions. [2020-11-09 14:20:57,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-09 14:20:57,240 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:20:57,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:57,244 INFO L225 Difference]: With dead ends: 273 [2020-11-09 14:20:57,244 INFO L226 Difference]: Without dead ends: 244 [2020-11-09 14:20:57,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:20:57,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-11-09 14:20:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2020-11-09 14:20:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-11-09 14:20:57,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 491 transitions. [2020-11-09 14:20:57,258 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 491 transitions. Word has length 22 [2020-11-09 14:20:57,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:57,258 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 491 transitions. [2020-11-09 14:20:57,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:20:57,258 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 491 transitions. [2020-11-09 14:20:57,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:20:57,260 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:57,260 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:57,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 14:20:57,261 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 14:20:57,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:57,261 INFO L82 PathProgramCache]: Analyzing trace with hash 207084251, now seen corresponding path program 8 times [2020-11-09 14:20:57,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:57,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229813077] [2020-11-09 14:20:57,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:58,065 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 14:20:58,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229813077] [2020-11-09 14:20:58,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:58,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:20:58,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86575406] [2020-11-09 14:20:58,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:20:58,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:58,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:20:58,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:20:58,067 INFO L87 Difference]: Start difference. First operand 244 states and 491 transitions. Second operand 14 states. [2020-11-09 14:20:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:59,212 INFO L93 Difference]: Finished difference Result 290 states and 574 transitions. [2020-11-09 14:20:59,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-09 14:20:59,213 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:20:59,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:59,215 INFO L225 Difference]: With dead ends: 290 [2020-11-09 14:20:59,215 INFO L226 Difference]: Without dead ends: 262 [2020-11-09 14:20:59,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:20:59,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-11-09 14:20:59,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 243. [2020-11-09 14:20:59,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-11-09 14:20:59,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 489 transitions. [2020-11-09 14:20:59,223 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 489 transitions. Word has length 22 [2020-11-09 14:20:59,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:59,224 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 489 transitions. [2020-11-09 14:20:59,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:20:59,224 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 489 transitions. [2020-11-09 14:20:59,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:20:59,225 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:59,225 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:59,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 14:20:59,225 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 14:20:59,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:59,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1428834009, now seen corresponding path program 9 times [2020-11-09 14:20:59,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:59,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901207532] [2020-11-09 14:20:59,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:59,921 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 14:20:59,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901207532] [2020-11-09 14:20:59,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:59,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:20:59,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040483666] [2020-11-09 14:20:59,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:20:59,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:59,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:20:59,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:20:59,926 INFO L87 Difference]: Start difference. First operand 243 states and 489 transitions. Second operand 14 states. [2020-11-09 14:21:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:01,109 INFO L93 Difference]: Finished difference Result 313 states and 617 transitions. [2020-11-09 14:21:01,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-09 14:21:01,109 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:01,111 INFO L225 Difference]: With dead ends: 313 [2020-11-09 14:21:01,112 INFO L226 Difference]: Without dead ends: 286 [2020-11-09 14:21:01,112 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:21:01,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-11-09 14:21:01,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 247. [2020-11-09 14:21:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-11-09 14:21:01,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 495 transitions. [2020-11-09 14:21:01,120 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 495 transitions. Word has length 22 [2020-11-09 14:21:01,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:01,120 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 495 transitions. [2020-11-09 14:21:01,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:01,121 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 495 transitions. [2020-11-09 14:21:01,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:01,122 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:01,122 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:01,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 14:21:01,122 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 14:21:01,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:01,123 INFO L82 PathProgramCache]: Analyzing trace with hash -251837041, now seen corresponding path program 10 times [2020-11-09 14:21:01,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:01,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534016032] [2020-11-09 14:21:01,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:01,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534016032] [2020-11-09 14:21:01,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:01,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:01,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666185646] [2020-11-09 14:21:01,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:01,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:01,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:01,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:01,884 INFO L87 Difference]: Start difference. First operand 247 states and 495 transitions. Second operand 14 states. [2020-11-09 14:21:02,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:02,971 INFO L93 Difference]: Finished difference Result 305 states and 600 transitions. [2020-11-09 14:21:02,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-09 14:21:02,972 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:02,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:02,974 INFO L225 Difference]: With dead ends: 305 [2020-11-09 14:21:02,974 INFO L226 Difference]: Without dead ends: 276 [2020-11-09 14:21:02,975 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:21:02,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-11-09 14:21:02,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 251. [2020-11-09 14:21:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2020-11-09 14:21:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 501 transitions. [2020-11-09 14:21:02,982 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 501 transitions. Word has length 22 [2020-11-09 14:21:02,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:02,983 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 501 transitions. [2020-11-09 14:21:02,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:02,983 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 501 transitions. [2020-11-09 14:21:02,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:02,984 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:02,984 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:02,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-09 14:21:02,984 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 14:21:02,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:02,985 INFO L82 PathProgramCache]: Analyzing trace with hash 754971535, now seen corresponding path program 11 times [2020-11-09 14:21:02,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:02,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845100284] [2020-11-09 14:21:02,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:03,727 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 14:21:03,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845100284] [2020-11-09 14:21:03,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:03,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:03,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161588646] [2020-11-09 14:21:03,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:03,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:03,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:03,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:03,729 INFO L87 Difference]: Start difference. First operand 251 states and 501 transitions. Second operand 14 states. [2020-11-09 14:21:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:04,857 INFO L93 Difference]: Finished difference Result 296 states and 580 transitions. [2020-11-09 14:21:04,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-09 14:21:04,857 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:04,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:04,859 INFO L225 Difference]: With dead ends: 296 [2020-11-09 14:21:04,859 INFO L226 Difference]: Without dead ends: 279 [2020-11-09 14:21:04,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2020-11-09 14:21:04,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-11-09 14:21:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 255. [2020-11-09 14:21:04,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2020-11-09 14:21:04,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 507 transitions. [2020-11-09 14:21:04,868 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 507 transitions. Word has length 22 [2020-11-09 14:21:04,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:04,868 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 507 transitions. [2020-11-09 14:21:04,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:04,868 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 507 transitions. [2020-11-09 14:21:04,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:04,869 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:04,869 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:04,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-09 14:21:04,870 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 14:21:04,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:04,870 INFO L82 PathProgramCache]: Analyzing trace with hash -646170225, now seen corresponding path program 12 times [2020-11-09 14:21:04,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:04,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298943485] [2020-11-09 14:21:04,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:05,528 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 14:21:05,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298943485] [2020-11-09 14:21:05,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:05,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:05,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516066434] [2020-11-09 14:21:05,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:05,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:05,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:05,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:05,530 INFO L87 Difference]: Start difference. First operand 255 states and 507 transitions. Second operand 14 states. [2020-11-09 14:21:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:06,474 INFO L93 Difference]: Finished difference Result 285 states and 560 transitions. [2020-11-09 14:21:06,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-09 14:21:06,475 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:06,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:06,477 INFO L225 Difference]: With dead ends: 285 [2020-11-09 14:21:06,477 INFO L226 Difference]: Without dead ends: 260 [2020-11-09 14:21:06,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:21:06,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2020-11-09 14:21:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 241. [2020-11-09 14:21:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-11-09 14:21:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 485 transitions. [2020-11-09 14:21:06,485 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 485 transitions. Word has length 22 [2020-11-09 14:21:06,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:06,485 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 485 transitions. [2020-11-09 14:21:06,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 485 transitions. [2020-11-09 14:21:06,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:06,486 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:06,486 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:06,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-09 14:21:06,487 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:06,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:06,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1326801883, now seen corresponding path program 13 times [2020-11-09 14:21:06,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:06,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530038540] [2020-11-09 14:21:06,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:07,165 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 14:21:07,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530038540] [2020-11-09 14:21:07,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:07,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:07,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92707034] [2020-11-09 14:21:07,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:07,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:07,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:07,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:07,166 INFO L87 Difference]: Start difference. First operand 241 states and 485 transitions. Second operand 14 states. [2020-11-09 14:21:08,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:08,360 INFO L93 Difference]: Finished difference Result 351 states and 690 transitions. [2020-11-09 14:21:08,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-09 14:21:08,360 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:08,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:08,363 INFO L225 Difference]: With dead ends: 351 [2020-11-09 14:21:08,363 INFO L226 Difference]: Without dead ends: 324 [2020-11-09 14:21:08,364 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:21:08,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-11-09 14:21:08,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 242. [2020-11-09 14:21:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-11-09 14:21:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 486 transitions. [2020-11-09 14:21:08,371 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 486 transitions. Word has length 22 [2020-11-09 14:21:08,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:08,371 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 486 transitions. [2020-11-09 14:21:08,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:08,371 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 486 transitions. [2020-11-09 14:21:08,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:08,372 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:08,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:08,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-09 14:21:08,373 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:08,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:08,373 INFO L82 PathProgramCache]: Analyzing trace with hash -149804915, now seen corresponding path program 14 times [2020-11-09 14:21:08,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:08,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883310001] [2020-11-09 14:21:08,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:09,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883310001] [2020-11-09 14:21:09,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:09,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:09,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702609309] [2020-11-09 14:21:09,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:09,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:09,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:09,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:09,135 INFO L87 Difference]: Start difference. First operand 242 states and 486 transitions. Second operand 14 states. [2020-11-09 14:21:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:10,421 INFO L93 Difference]: Finished difference Result 343 states and 673 transitions. [2020-11-09 14:21:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-09 14:21:10,422 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:10,426 INFO L225 Difference]: With dead ends: 343 [2020-11-09 14:21:10,427 INFO L226 Difference]: Without dead ends: 314 [2020-11-09 14:21:10,427 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:21:10,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-11-09 14:21:10,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 246. [2020-11-09 14:21:10,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-11-09 14:21:10,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 492 transitions. [2020-11-09 14:21:10,437 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 492 transitions. Word has length 22 [2020-11-09 14:21:10,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:10,438 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 492 transitions. [2020-11-09 14:21:10,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:10,439 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 492 transitions. [2020-11-09 14:21:10,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:10,440 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:10,440 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:10,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-09 14:21:10,440 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:10,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:10,441 INFO L82 PathProgramCache]: Analyzing trace with hash 857003661, now seen corresponding path program 15 times [2020-11-09 14:21:10,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:10,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194728603] [2020-11-09 14:21:10,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:11,233 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 14:21:11,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194728603] [2020-11-09 14:21:11,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:11,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:11,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230059133] [2020-11-09 14:21:11,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:11,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:11,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:11,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:11,235 INFO L87 Difference]: Start difference. First operand 246 states and 492 transitions. Second operand 14 states. [2020-11-09 14:21:12,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:12,347 INFO L93 Difference]: Finished difference Result 334 states and 653 transitions. [2020-11-09 14:21:12,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-09 14:21:12,347 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:12,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:12,350 INFO L225 Difference]: With dead ends: 334 [2020-11-09 14:21:12,350 INFO L226 Difference]: Without dead ends: 317 [2020-11-09 14:21:12,351 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2020-11-09 14:21:12,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-11-09 14:21:12,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 250. [2020-11-09 14:21:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-11-09 14:21:12,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 498 transitions. [2020-11-09 14:21:12,358 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 498 transitions. Word has length 22 [2020-11-09 14:21:12,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:12,358 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 498 transitions. [2020-11-09 14:21:12,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:12,358 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 498 transitions. [2020-11-09 14:21:12,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:12,359 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:12,359 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:12,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-09 14:21:12,360 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:12,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:12,360 INFO L82 PathProgramCache]: Analyzing trace with hash -544138099, now seen corresponding path program 16 times [2020-11-09 14:21:12,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:12,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795866694] [2020-11-09 14:21:12,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:12,964 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 14:21:12,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795866694] [2020-11-09 14:21:12,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:12,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:12,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265596507] [2020-11-09 14:21:12,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:12,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:12,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:12,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:12,988 INFO L87 Difference]: Start difference. First operand 250 states and 498 transitions. Second operand 14 states. [2020-11-09 14:21:14,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:14,004 INFO L93 Difference]: Finished difference Result 323 states and 633 transitions. [2020-11-09 14:21:14,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-09 14:21:14,005 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:14,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:14,006 INFO L225 Difference]: With dead ends: 323 [2020-11-09 14:21:14,007 INFO L226 Difference]: Without dead ends: 290 [2020-11-09 14:21:14,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:21:14,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-11-09 14:21:14,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 228. [2020-11-09 14:21:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2020-11-09 14:21:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 463 transitions. [2020-11-09 14:21:14,014 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 463 transitions. Word has length 22 [2020-11-09 14:21:14,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:14,014 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 463 transitions. [2020-11-09 14:21:14,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 463 transitions. [2020-11-09 14:21:14,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:14,015 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:14,015 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:14,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-09 14:21:14,015 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:14,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:14,015 INFO L82 PathProgramCache]: Analyzing trace with hash -618210351, now seen corresponding path program 17 times [2020-11-09 14:21:14,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:14,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352196899] [2020-11-09 14:21:14,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:14,128 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 14:21:14,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352196899] [2020-11-09 14:21:14,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:14,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 14:21:14,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250251005] [2020-11-09 14:21:14,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 14:21:14,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:14,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 14:21:14,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-09 14:21:14,130 INFO L87 Difference]: Start difference. First operand 228 states and 463 transitions. Second operand 6 states. [2020-11-09 14:21:14,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:14,223 INFO L93 Difference]: Finished difference Result 128 states and 203 transitions. [2020-11-09 14:21:14,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 14:21:14,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-11-09 14:21:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:14,224 INFO L225 Difference]: With dead ends: 128 [2020-11-09 14:21:14,224 INFO L226 Difference]: Without dead ends: 128 [2020-11-09 14:21:14,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-09 14:21:14,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-11-09 14:21:14,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-11-09 14:21:14,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-11-09 14:21:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 203 transitions. [2020-11-09 14:21:14,228 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 203 transitions. Word has length 22 [2020-11-09 14:21:14,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:14,228 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 203 transitions. [2020-11-09 14:21:14,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 14:21:14,229 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 203 transitions. [2020-11-09 14:21:14,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:14,229 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:14,229 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:14,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-09 14:21:14,230 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:14,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:14,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1321574743, now seen corresponding path program 18 times [2020-11-09 14:21:14,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:14,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969333723] [2020-11-09 14:21:14,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:14,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969333723] [2020-11-09 14:21:14,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:14,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:14,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345718124] [2020-11-09 14:21:14,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:14,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:14,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:14,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:14,869 INFO L87 Difference]: Start difference. First operand 128 states and 203 transitions. Second operand 14 states. [2020-11-09 14:21:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:15,869 INFO L93 Difference]: Finished difference Result 159 states and 248 transitions. [2020-11-09 14:21:15,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-09 14:21:15,870 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:15,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:15,871 INFO L225 Difference]: With dead ends: 159 [2020-11-09 14:21:15,872 INFO L226 Difference]: Without dead ends: 129 [2020-11-09 14:21:15,872 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:21:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-09 14:21:15,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2020-11-09 14:21:15,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-11-09 14:21:15,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 201 transitions. [2020-11-09 14:21:15,876 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 201 transitions. Word has length 22 [2020-11-09 14:21:15,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:15,877 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 201 transitions. [2020-11-09 14:21:15,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:15,877 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 201 transitions. [2020-11-09 14:21:15,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:15,877 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:15,878 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:15,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-09 14:21:15,878 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:15,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:15,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1537379531, now seen corresponding path program 19 times [2020-11-09 14:21:15,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:15,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040819936] [2020-11-09 14:21:15,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:16,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040819936] [2020-11-09 14:21:16,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:16,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:16,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840491294] [2020-11-09 14:21:16,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:16,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:16,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:16,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:16,550 INFO L87 Difference]: Start difference. First operand 128 states and 201 transitions. Second operand 14 states. [2020-11-09 14:21:17,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:17,513 INFO L93 Difference]: Finished difference Result 156 states and 243 transitions. [2020-11-09 14:21:17,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-09 14:21:17,514 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:17,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:17,515 INFO L225 Difference]: With dead ends: 156 [2020-11-09 14:21:17,515 INFO L226 Difference]: Without dead ends: 128 [2020-11-09 14:21:17,516 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:21:17,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-11-09 14:21:17,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-11-09 14:21:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-11-09 14:21:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 200 transitions. [2020-11-09 14:21:17,520 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 200 transitions. Word has length 22 [2020-11-09 14:21:17,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:17,521 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 200 transitions. [2020-11-09 14:21:17,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:17,521 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 200 transitions. [2020-11-09 14:21:17,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:17,521 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:17,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:17,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-09 14:21:17,522 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:17,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:17,522 INFO L82 PathProgramCache]: Analyzing trace with hash -98538729, now seen corresponding path program 20 times [2020-11-09 14:21:17,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:17,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633915649] [2020-11-09 14:21:17,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:18,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:18,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633915649] [2020-11-09 14:21:18,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:18,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:18,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48512106] [2020-11-09 14:21:18,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:18,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:18,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:18,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:18,159 INFO L87 Difference]: Start difference. First operand 128 states and 200 transitions. Second operand 14 states. [2020-11-09 14:21:19,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:19,174 INFO L93 Difference]: Finished difference Result 167 states and 262 transitions. [2020-11-09 14:21:19,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-09 14:21:19,174 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:19,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:19,175 INFO L225 Difference]: With dead ends: 167 [2020-11-09 14:21:19,175 INFO L226 Difference]: Without dead ends: 140 [2020-11-09 14:21:19,176 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:21:19,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-11-09 14:21:19,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2020-11-09 14:21:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-11-09 14:21:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 198 transitions. [2020-11-09 14:21:19,180 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 198 transitions. Word has length 22 [2020-11-09 14:21:19,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:19,180 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 198 transitions. [2020-11-09 14:21:19,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 198 transitions. [2020-11-09 14:21:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:19,181 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:19,181 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:19,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-09 14:21:19,181 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:19,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:19,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1078458239, now seen corresponding path program 21 times [2020-11-09 14:21:19,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:19,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298975045] [2020-11-09 14:21:19,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:19,832 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 14:21:19,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298975045] [2020-11-09 14:21:19,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:19,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:19,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489839387] [2020-11-09 14:21:19,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:19,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:19,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:19,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:19,833 INFO L87 Difference]: Start difference. First operand 128 states and 198 transitions. Second operand 14 states. [2020-11-09 14:21:20,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:20,883 INFO L93 Difference]: Finished difference Result 159 states and 245 transitions. [2020-11-09 14:21:20,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-09 14:21:20,883 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:20,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:20,884 INFO L225 Difference]: With dead ends: 159 [2020-11-09 14:21:20,884 INFO L226 Difference]: Without dead ends: 130 [2020-11-09 14:21:20,885 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:21:20,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-11-09 14:21:20,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2020-11-09 14:21:20,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-09 14:21:20,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 194 transitions. [2020-11-09 14:21:20,889 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 194 transitions. Word has length 22 [2020-11-09 14:21:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:20,889 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 194 transitions. [2020-11-09 14:21:20,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:20,889 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 194 transitions. [2020-11-09 14:21:20,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:20,890 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:20,890 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:20,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-09 14:21:20,890 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:20,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:20,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2085266815, now seen corresponding path program 22 times [2020-11-09 14:21:20,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:20,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034717788] [2020-11-09 14:21:20,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:21,526 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 14:21:21,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034717788] [2020-11-09 14:21:21,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:21,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:21,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103406053] [2020-11-09 14:21:21,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:21,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:21,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:21,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:21,528 INFO L87 Difference]: Start difference. First operand 127 states and 194 transitions. Second operand 14 states. [2020-11-09 14:21:22,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:22,610 INFO L93 Difference]: Finished difference Result 151 states and 225 transitions. [2020-11-09 14:21:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-09 14:21:22,611 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:22,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:22,612 INFO L225 Difference]: With dead ends: 151 [2020-11-09 14:21:22,612 INFO L226 Difference]: Without dead ends: 134 [2020-11-09 14:21:22,613 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-11-09 14:21:22,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-11-09 14:21:22,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2020-11-09 14:21:22,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-11-09 14:21:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 188 transitions. [2020-11-09 14:21:22,617 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 188 transitions. Word has length 22 [2020-11-09 14:21:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:22,617 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 188 transitions. [2020-11-09 14:21:22,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 188 transitions. [2020-11-09 14:21:22,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:22,618 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:22,618 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:22,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-09 14:21:22,618 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:22,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:22,619 INFO L82 PathProgramCache]: Analyzing trace with hash 684125055, now seen corresponding path program 23 times [2020-11-09 14:21:22,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:22,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538709585] [2020-11-09 14:21:22,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:23,278 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 14:21:23,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538709585] [2020-11-09 14:21:23,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:23,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:23,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453421282] [2020-11-09 14:21:23,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:23,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:23,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:23,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:23,280 INFO L87 Difference]: Start difference. First operand 125 states and 188 transitions. Second operand 14 states. [2020-11-09 14:21:24,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:24,196 INFO L93 Difference]: Finished difference Result 139 states and 204 transitions. [2020-11-09 14:21:24,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-09 14:21:24,197 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:24,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:24,198 INFO L225 Difference]: With dead ends: 139 [2020-11-09 14:21:24,198 INFO L226 Difference]: Without dead ends: 110 [2020-11-09 14:21:24,199 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:21:24,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-11-09 14:21:24,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2020-11-09 14:21:24,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-11-09 14:21:24,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 152 transitions. [2020-11-09 14:21:24,203 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 152 transitions. Word has length 22 [2020-11-09 14:21:24,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:24,203 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 152 transitions. [2020-11-09 14:21:24,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:24,204 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 152 transitions. [2020-11-09 14:21:24,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:24,204 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:24,204 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:24,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-09 14:21:24,205 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:24,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:24,205 INFO L82 PathProgramCache]: Analyzing trace with hash 374516555, now seen corresponding path program 24 times [2020-11-09 14:21:24,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:24,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699578712] [2020-11-09 14:21:24,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:24,831 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 14:21:24,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699578712] [2020-11-09 14:21:24,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:24,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:24,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691674852] [2020-11-09 14:21:24,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:24,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:24,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:24,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:24,833 INFO L87 Difference]: Start difference. First operand 101 states and 152 transitions. Second operand 14 states. [2020-11-09 14:21:25,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:25,787 INFO L93 Difference]: Finished difference Result 101 states and 151 transitions. [2020-11-09 14:21:25,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-09 14:21:25,788 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:25,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:25,789 INFO L225 Difference]: With dead ends: 101 [2020-11-09 14:21:25,789 INFO L226 Difference]: Without dead ends: 71 [2020-11-09 14:21:25,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:21:25,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-11-09 14:21:25,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-11-09 14:21:25,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-09 14:21:25,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 106 transitions. [2020-11-09 14:21:25,795 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 106 transitions. Word has length 22 [2020-11-09 14:21:25,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:25,795 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 106 transitions. [2020-11-09 14:21:25,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 106 transitions. [2020-11-09 14:21:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:25,796 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:25,796 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:25,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-09 14:21:25,797 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:25,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:25,798 INFO L82 PathProgramCache]: Analyzing trace with hash -983508743, now seen corresponding path program 25 times [2020-11-09 14:21:25,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:25,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331594081] [2020-11-09 14:21:25,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:26,449 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 14:21:26,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331594081] [2020-11-09 14:21:26,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:26,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:26,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809923871] [2020-11-09 14:21:26,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:26,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:26,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:26,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:26,451 INFO L87 Difference]: Start difference. First operand 71 states and 106 transitions. Second operand 14 states. [2020-11-09 14:21:27,063 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2020-11-09 14:21:27,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:27,453 INFO L93 Difference]: Finished difference Result 87 states and 121 transitions. [2020-11-09 14:21:27,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-09 14:21:27,454 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:27,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:27,456 INFO L225 Difference]: With dead ends: 87 [2020-11-09 14:21:27,456 INFO L226 Difference]: Without dead ends: 87 [2020-11-09 14:21:27,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:21:27,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-09 14:21:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2020-11-09 14:21:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-09 14:21:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 121 transitions. [2020-11-09 14:21:27,460 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 121 transitions. Word has length 22 [2020-11-09 14:21:27,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:27,460 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 121 transitions. [2020-11-09 14:21:27,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 121 transitions. [2020-11-09 14:21:27,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:27,461 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:27,461 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:27,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-09 14:21:27,461 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:27,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:27,462 INFO L82 PathProgramCache]: Analyzing trace with hash -983508788, now seen corresponding path program 3 times [2020-11-09 14:21:27,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:27,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362347078] [2020-11-09 14:21:27,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:27,642 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 14:21:27,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362347078] [2020-11-09 14:21:27,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:27,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 14:21:27,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180361728] [2020-11-09 14:21:27,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 14:21:27,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:27,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 14:21:27,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-09 14:21:27,644 INFO L87 Difference]: Start difference. First operand 86 states and 121 transitions. Second operand 9 states. [2020-11-09 14:21:28,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:28,010 INFO L93 Difference]: Finished difference Result 111 states and 158 transitions. [2020-11-09 14:21:28,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 14:21:28,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-11-09 14:21:28,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:28,012 INFO L225 Difference]: With dead ends: 111 [2020-11-09 14:21:28,012 INFO L226 Difference]: Without dead ends: 95 [2020-11-09 14:21:28,013 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:28,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-09 14:21:28,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-11-09 14:21:28,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-09 14:21:28,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 142 transitions. [2020-11-09 14:21:28,016 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 142 transitions. Word has length 22 [2020-11-09 14:21:28,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:28,016 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 142 transitions. [2020-11-09 14:21:28,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 14:21:28,016 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 142 transitions. [2020-11-09 14:21:28,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:28,017 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:28,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:28,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-09 14:21:28,017 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:28,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:28,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1609619909, now seen corresponding path program 26 times [2020-11-09 14:21:28,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:28,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677232389] [2020-11-09 14:21:28,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:28,658 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 14:21:28,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677232389] [2020-11-09 14:21:28,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:28,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:28,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338504105] [2020-11-09 14:21:28,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:28,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:28,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:28,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:28,660 INFO L87 Difference]: Start difference. First operand 95 states and 142 transitions. Second operand 14 states. [2020-11-09 14:21:29,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:29,708 INFO L93 Difference]: Finished difference Result 126 states and 188 transitions. [2020-11-09 14:21:29,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-09 14:21:29,709 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:29,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:29,709 INFO L225 Difference]: With dead ends: 126 [2020-11-09 14:21:29,709 INFO L226 Difference]: Without dead ends: 84 [2020-11-09 14:21:29,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:21:29,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-09 14:21:29,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-11-09 14:21:29,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-09 14:21:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 129 transitions. [2020-11-09 14:21:29,713 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 129 transitions. Word has length 22 [2020-11-09 14:21:29,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:29,713 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 129 transitions. [2020-11-09 14:21:29,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 129 transitions. [2020-11-09 14:21:29,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:29,714 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:29,714 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:29,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-09 14:21:29,714 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:29,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:29,715 INFO L82 PathProgramCache]: Analyzing trace with hash 468200473, now seen corresponding path program 2 times [2020-11-09 14:21:29,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:29,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223923255] [2020-11-09 14:21:29,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:29,836 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 14:21:29,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223923255] [2020-11-09 14:21:29,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:29,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 14:21:29,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536270307] [2020-11-09 14:21:29,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 14:21:29,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:29,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 14:21:29,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-09 14:21:29,838 INFO L87 Difference]: Start difference. First operand 84 states and 129 transitions. Second operand 8 states. [2020-11-09 14:21:30,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:30,076 INFO L93 Difference]: Finished difference Result 69 states and 95 transitions. [2020-11-09 14:21:30,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 14:21:30,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-11-09 14:21:30,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:30,077 INFO L225 Difference]: With dead ends: 69 [2020-11-09 14:21:30,077 INFO L226 Difference]: Without dead ends: 69 [2020-11-09 14:21:30,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-09 14:21:30,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-09 14:21:30,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2020-11-09 14:21:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-09 14:21:30,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2020-11-09 14:21:30,080 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 22 [2020-11-09 14:21:30,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:30,080 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2020-11-09 14:21:30,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 14:21:30,080 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2020-11-09 14:21:30,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:30,080 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:30,081 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:30,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-09 14:21:30,081 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:30,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:30,081 INFO L82 PathProgramCache]: Analyzing trace with hash -411053783, now seen corresponding path program 27 times [2020-11-09 14:21:30,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:30,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162982866] [2020-11-09 14:21:30,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:30,715 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 14:21:30,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162982866] [2020-11-09 14:21:30,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:30,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:30,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458087886] [2020-11-09 14:21:30,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:30,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:30,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:30,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:30,718 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand 14 states. [2020-11-09 14:21:31,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:31,788 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2020-11-09 14:21:31,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-09 14:21:31,789 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:31,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:31,789 INFO L225 Difference]: With dead ends: 79 [2020-11-09 14:21:31,789 INFO L226 Difference]: Without dead ends: 66 [2020-11-09 14:21:31,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2020-11-09 14:21:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-09 14:21:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-11-09 14:21:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-09 14:21:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2020-11-09 14:21:31,795 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 22 [2020-11-09 14:21:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:31,795 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2020-11-09 14:21:31,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2020-11-09 14:21:31,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:31,796 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:31,796 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:31,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-09 14:21:31,796 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:31,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:31,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2098826979, now seen corresponding path program 28 times [2020-11-09 14:21:31,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:31,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231190589] [2020-11-09 14:21:31,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:32,407 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 14:21:32,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231190589] [2020-11-09 14:21:32,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:32,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:32,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60998496] [2020-11-09 14:21:32,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:32,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:32,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:32,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:32,409 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 14 states. [2020-11-09 14:21:33,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:33,433 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2020-11-09 14:21:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-09 14:21:33,434 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:33,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:33,434 INFO L225 Difference]: With dead ends: 66 [2020-11-09 14:21:33,435 INFO L226 Difference]: Without dead ends: 54 [2020-11-09 14:21:33,435 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-11-09 14:21:33,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-09 14:21:33,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-11-09 14:21:33,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-09 14:21:33,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2020-11-09 14:21:33,436 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 22 [2020-11-09 14:21:33,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:33,437 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2020-11-09 14:21:33,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:33,437 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2020-11-09 14:21:33,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:33,439 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:33,439 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:33,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-09 14:21:33,439 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:33,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:33,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1088468309, now seen corresponding path program 29 times [2020-11-09 14:21:33,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:33,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075549765] [2020-11-09 14:21:33,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:34,061 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 14:21:34,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075549765] [2020-11-09 14:21:34,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:34,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:34,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386180135] [2020-11-09 14:21:34,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:34,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:34,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:34,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:34,063 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand 14 states. [2020-11-09 14:21:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:35,035 INFO L93 Difference]: Finished difference Result 72 states and 101 transitions. [2020-11-09 14:21:35,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-09 14:21:35,035 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:35,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:35,036 INFO L225 Difference]: With dead ends: 72 [2020-11-09 14:21:35,036 INFO L226 Difference]: Without dead ends: 72 [2020-11-09 14:21:35,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:21:35,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-09 14:21:35,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2020-11-09 14:21:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-09 14:21:35,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2020-11-09 14:21:35,039 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 22 [2020-11-09 14:21:35,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:35,040 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2020-11-09 14:21:35,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:35,040 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2020-11-09 14:21:35,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:35,040 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:35,040 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:35,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-11-09 14:21:35,041 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:35,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:35,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1088468264, now seen corresponding path program 4 times [2020-11-09 14:21:35,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:35,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989452103] [2020-11-09 14:21:35,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:35,242 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 14:21:35,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989452103] [2020-11-09 14:21:35,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:35,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 14:21:35,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347856654] [2020-11-09 14:21:35,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 14:21:35,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:35,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 14:21:35,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-09 14:21:35,245 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand 9 states. [2020-11-09 14:21:35,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:35,580 INFO L93 Difference]: Finished difference Result 70 states and 99 transitions. [2020-11-09 14:21:35,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 14:21:35,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-11-09 14:21:35,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:35,581 INFO L225 Difference]: With dead ends: 70 [2020-11-09 14:21:35,581 INFO L226 Difference]: Without dead ends: 44 [2020-11-09 14:21:35,582 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:35,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-11-09 14:21:35,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-11-09 14:21:35,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-11-09 14:21:35,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2020-11-09 14:21:35,584 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 22 [2020-11-09 14:21:35,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:35,584 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2020-11-09 14:21:35,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 14:21:35,584 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2020-11-09 14:21:35,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:35,584 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:35,585 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:35,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-09 14:21:35,585 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:35,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:35,585 INFO L82 PathProgramCache]: Analyzing trace with hash 22133125, now seen corresponding path program 3 times [2020-11-09 14:21:35,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:35,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043282805] [2020-11-09 14:21:35,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:35,881 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 14:21:35,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043282805] [2020-11-09 14:21:35,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:35,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:35,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238128189] [2020-11-09 14:21:35,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-09 14:21:35,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:35,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-09 14:21:35,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-11-09 14:21:35,882 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand 13 states. [2020-11-09 14:21:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:36,360 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2020-11-09 14:21:36,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:36,361 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-11-09 14:21:36,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:36,361 INFO L225 Difference]: With dead ends: 44 [2020-11-09 14:21:36,361 INFO L226 Difference]: Without dead ends: 35 [2020-11-09 14:21:36,362 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2020-11-09 14:21:36,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-11-09 14:21:36,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-11-09 14:21:36,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-09 14:21:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2020-11-09 14:21:36,364 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 22 [2020-11-09 14:21:36,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:36,364 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2020-11-09 14:21:36,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-09 14:21:36,364 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2020-11-09 14:21:36,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:36,364 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:36,364 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:36,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-11-09 14:21:36,365 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:36,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:36,365 INFO L82 PathProgramCache]: Analyzing trace with hash 913881587, now seen corresponding path program 30 times [2020-11-09 14:21:36,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:36,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761046359] [2020-11-09 14:21:36,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:36,959 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 14:21:36,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761046359] [2020-11-09 14:21:36,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:36,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:36,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485332350] [2020-11-09 14:21:36,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:36,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:36,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:36,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:36,961 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 14 states. [2020-11-09 14:21:37,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:37,917 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2020-11-09 14:21:37,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-09 14:21:37,918 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:37,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:37,918 INFO L225 Difference]: With dead ends: 42 [2020-11-09 14:21:37,918 INFO L226 Difference]: Without dead ends: 34 [2020-11-09 14:21:37,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:21:37,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-11-09 14:21:37,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-11-09 14:21:37,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-09 14:21:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2020-11-09 14:21:37,920 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 22 [2020-11-09 14:21:37,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:37,920 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-11-09 14:21:37,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2020-11-09 14:21:37,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 14:21:37,921 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:37,921 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:37,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-11-09 14:21:37,921 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:37,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:37,921 INFO L82 PathProgramCache]: Analyzing trace with hash -92005337, now seen corresponding path program 31 times [2020-11-09 14:21:37,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:37,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096524561] [2020-11-09 14:21:37,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:38,526 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 14:21:38,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096524561] [2020-11-09 14:21:38,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:38,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-09 14:21:38,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996272202] [2020-11-09 14:21:38,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-09 14:21:38,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:38,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-09 14:21:38,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:21:38,528 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand 14 states. [2020-11-09 14:21:39,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:39,300 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2020-11-09 14:21:39,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-09 14:21:39,301 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-09 14:21:39,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:39,301 INFO L225 Difference]: With dead ends: 33 [2020-11-09 14:21:39,302 INFO L226 Difference]: Without dead ends: 0 [2020-11-09 14:21:39,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2020-11-09 14:21:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-09 14:21:39,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-09 14:21:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-09 14:21:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-09 14:21:39,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-11-09 14:21:39,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:39,303 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-09 14:21:39,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-09 14:21:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-09 14:21:39,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-09 14:21:39,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-11-09 14:21:39,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:21:39 BasicIcfg [2020-11-09 14:21:39,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 14:21:39,309 INFO L168 Benchmark]: Toolchain (without parser) took 85682.36 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 123.8 MB in the beginning and 201.2 MB in the end (delta: -77.4 MB). Peak memory consumption was 86.7 MB. Max. memory is 8.0 GB. [2020-11-09 14:21:39,310 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 151.0 MB. Free memory was 125.1 MB in the beginning and 125.0 MB in the end (delta: 77.6 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 14:21:39,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1580.77 ms. Allocated memory is still 151.0 MB. Free memory was 123.2 MB in the beginning and 93.6 MB in the end (delta: 29.6 MB). Peak memory consumption was 79.7 MB. Max. memory is 8.0 GB. [2020-11-09 14:21:39,311 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.25 ms. Allocated memory is still 151.0 MB. Free memory was 93.6 MB in the beginning and 90.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 14:21:39,311 INFO L168 Benchmark]: Boogie Preprocessor took 59.48 ms. Allocated memory is still 151.0 MB. Free memory was 90.4 MB in the beginning and 87.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 14:21:39,311 INFO L168 Benchmark]: RCFGBuilder took 808.54 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 87.3 MB in the beginning and 149.7 MB in the end (delta: -62.4 MB). Peak memory consumption was 45.1 MB. Max. memory is 8.0 GB. [2020-11-09 14:21:39,312 INFO L168 Benchmark]: TraceAbstraction took 83085.74 ms. Allocated memory was 181.4 MB in the beginning and 314.6 MB in the end (delta: 133.2 MB). Free memory was 149.2 MB in the beginning and 201.2 MB in the end (delta: -52.0 MB). Peak memory consumption was 80.6 MB. Max. memory is 8.0 GB. [2020-11-09 14:21:39,314 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.25 ms. Allocated memory is still 151.0 MB. Free memory was 125.1 MB in the beginning and 125.0 MB in the end (delta: 77.6 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1580.77 ms. Allocated memory is still 151.0 MB. Free memory was 123.2 MB in the beginning and 93.6 MB in the end (delta: 29.6 MB). Peak memory consumption was 79.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 132.25 ms. Allocated memory is still 151.0 MB. Free memory was 93.6 MB in the beginning and 90.4 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.48 ms. Allocated memory is still 151.0 MB. Free memory was 90.4 MB in the beginning and 87.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 808.54 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 87.3 MB in the beginning and 149.7 MB in the end (delta: -62.4 MB). Peak memory consumption was 45.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 83085.74 ms. Allocated memory was 181.4 MB in the beginning and 314.6 MB in the end (delta: 133.2 MB). Free memory was 149.2 MB in the beginning and 201.2 MB in the end (delta: -52.0 MB). Peak memory consumption was 80.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1911 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 79 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 25.5s, 179 PlacesBefore, 41 PlacesAfterwards, 189 TransitionsBefore, 40 TransitionsAfterwards, 3444 CoEnabledTransitionPairs, 8 FixpointIterations, 116 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 20 TrivialYvCompositions, 27 ConcurrentYvCompositions, 11 ChoiceCompositions, 237 TotalNumberOfCompositions, 7933 MoverChecksTotal - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 158 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 82.9s, OverallIterations: 42, TraceHistogramMax: 1, AutomataDifference: 33.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 25.5s, HoareTripleCheckerStatistics: 1035 SDtfs, 1801 SDslu, 4544 SDs, 0 SdLazy, 11406 SolverSat, 879 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 759 GetRequests, 25 SyntacticMatches, 71 SemanticMatches, 663 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 32.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 42 MinimizatonAttempts, 758 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 20.5s InterpolantComputationTime, 857 NumberOfCodeBlocks, 857 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 815 ConstructedInterpolants, 0 QuantifiedInterpolants, 382305 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...