/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9e34d99ae2c6837f487980c721c4b6acf9d9b15c-9e34d99 [2021-07-09 17:07:09,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-09 17:07:09,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-09 17:07:09,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-09 17:07:09,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-09 17:07:09,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-09 17:07:09,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-09 17:07:09,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-09 17:07:09,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-09 17:07:09,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-09 17:07:09,491 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-09 17:07:09,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-09 17:07:09,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-09 17:07:09,493 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-09 17:07:09,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-09 17:07:09,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-09 17:07:09,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-09 17:07:09,496 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-09 17:07:09,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-09 17:07:09,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-09 17:07:09,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-09 17:07:09,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-09 17:07:09,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-09 17:07:09,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-09 17:07:09,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-09 17:07:09,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-09 17:07:09,514 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-09 17:07:09,515 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-09 17:07:09,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-09 17:07:09,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-09 17:07:09,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-09 17:07:09,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-09 17:07:09,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-09 17:07:09,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-09 17:07:09,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-09 17:07:09,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-09 17:07:09,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-09 17:07:09,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-09 17:07:09,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-09 17:07:09,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-09 17:07:09,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-09 17:07:09,528 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-07-09 17:07:09,562 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-09 17:07:09,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-09 17:07:09,563 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-09 17:07:09,563 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-09 17:07:09,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-09 17:07:09,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-09 17:07:09,566 INFO L138 SettingsManager]: * Use SBE=true [2021-07-09 17:07:09,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-09 17:07:09,566 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-09 17:07:09,566 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-09 17:07:09,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-09 17:07:09,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-09 17:07:09,567 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-09 17:07:09,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-09 17:07:09,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-09 17:07:09,568 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-09 17:07:09,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-09 17:07:09,568 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-09 17:07:09,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-09 17:07:09,568 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-09 17:07:09,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-09 17:07:09,569 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-09 17:07:09,569 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-09 17:07:09,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 17:07:09,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-09 17:07:09,569 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-09 17:07:09,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-09 17:07:09,570 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-09 17:07:09,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-09 17:07:09,570 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-09 17:07:09,570 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-09 17:07:09,570 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2021-07-09 17:07:09,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-09 17:07:09,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-09 17:07:09,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-09 17:07:09,923 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-09 17:07:09,924 INFO L275 PluginConnector]: CDTParser initialized [2021-07-09 17:07:09,925 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i [2021-07-09 17:07:09,973 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b71cdda0/94ec2235d6924535b2144ae3d504a4a8/FLAG454ad480a [2021-07-09 17:07:10,501 INFO L306 CDTParser]: Found 1 translation units. [2021-07-09 17:07:10,502 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i [2021-07-09 17:07:10,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b71cdda0/94ec2235d6924535b2144ae3d504a4a8/FLAG454ad480a [2021-07-09 17:07:10,793 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b71cdda0/94ec2235d6924535b2144ae3d504a4a8 [2021-07-09 17:07:10,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-09 17:07:10,797 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-09 17:07:10,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-09 17:07:10,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-09 17:07:10,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-09 17:07:10,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 05:07:10" (1/1) ... [2021-07-09 17:07:10,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f71b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:10, skipping insertion in model container [2021-07-09 17:07:10,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 05:07:10" (1/1) ... [2021-07-09 17:07:10,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-09 17:07:10,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-09 17:07:11,273 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i[41060,41073] [2021-07-09 17:07:11,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 17:07:11,331 INFO L203 MainTranslator]: Completed pre-run [2021-07-09 17:07:11,366 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i[41060,41073] [2021-07-09 17:07:11,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 17:07:11,461 INFO L208 MainTranslator]: Completed translation [2021-07-09 17:07:11,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:11 WrapperNode [2021-07-09 17:07:11,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-09 17:07:11,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-09 17:07:11,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-09 17:07:11,463 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-09 17:07:11,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:11" (1/1) ... [2021-07-09 17:07:11,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:11" (1/1) ... [2021-07-09 17:07:11,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-09 17:07:11,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-09 17:07:11,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-09 17:07:11,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-09 17:07:11,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:11" (1/1) ... [2021-07-09 17:07:11,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:11" (1/1) ... [2021-07-09 17:07:11,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:11" (1/1) ... [2021-07-09 17:07:11,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:11" (1/1) ... [2021-07-09 17:07:11,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:11" (1/1) ... [2021-07-09 17:07:11,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:11" (1/1) ... [2021-07-09 17:07:11,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:11" (1/1) ... [2021-07-09 17:07:11,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-09 17:07:11,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-09 17:07:11,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-09 17:07:11,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-09 17:07:11,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:11" (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 [2021-07-09 17:07:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-09 17:07:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-09 17:07:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-07-09 17:07:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-09 17:07:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-07-09 17:07:11,671 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-07-09 17:07:11,672 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-07-09 17:07:11,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-09 17:07:11,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-09 17:07:11,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-09 17:07:11,673 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-09 17:07:12,204 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-09 17:07:12,204 INFO L299 CfgBuilder]: Removed 35 assume(true) statements. [2021-07-09 17:07:12,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 05:07:12 BoogieIcfgContainer [2021-07-09 17:07:12,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-09 17:07:12,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-09 17:07:12,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-09 17:07:12,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-09 17:07:12,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.07 05:07:10" (1/3) ... [2021-07-09 17:07:12,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdbf66d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 05:07:12, skipping insertion in model container [2021-07-09 17:07:12,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:11" (2/3) ... [2021-07-09 17:07:12,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdbf66d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 05:07:12, skipping insertion in model container [2021-07-09 17:07:12,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 05:07:12" (3/3) ... [2021-07-09 17:07:12,212 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_77-tricky_address4_racing.i [2021-07-09 17:07:12,217 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-09 17:07:12,217 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-09 17:07:12,218 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-09 17:07:12,218 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-09 17:07:12,256 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,256 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,256 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,256 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,257 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,257 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,257 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,257 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,257 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,257 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,257 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,258 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,258 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,258 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,258 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,258 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,258 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,258 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,259 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,259 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,259 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,259 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,259 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,259 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,259 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,260 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,260 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,260 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,260 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,260 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,260 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,260 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,261 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,261 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,261 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,261 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,261 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,261 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,262 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,262 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,262 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,262 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,262 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,262 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,262 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,263 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,263 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,263 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,263 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,263 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,263 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,263 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,263 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,264 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,264 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,264 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,264 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,264 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,264 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,264 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,265 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,265 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,265 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,265 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,265 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,265 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,265 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,265 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,266 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,266 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,266 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,266 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,266 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,266 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,266 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,267 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,267 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,267 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,267 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,267 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,267 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,268 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,268 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,268 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,268 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,268 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,268 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,268 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,269 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,269 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,269 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,269 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,269 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,269 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,269 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,270 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,270 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,270 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,270 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,270 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,270 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,270 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,271 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,271 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,271 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,271 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,271 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,271 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,271 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,272 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,272 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,272 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,272 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,272 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,272 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,272 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,272 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,273 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,273 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,273 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,273 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,273 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,273 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,273 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,273 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,274 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,274 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,274 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,274 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,274 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,274 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,274 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,274 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,274 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,275 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,275 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,277 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,277 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,277 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,277 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,277 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,277 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,277 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,278 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,278 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,278 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,278 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,278 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,278 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,278 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,279 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,279 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,279 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,279 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,279 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,279 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,279 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,279 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,280 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:12,284 INFO L149 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-07-09 17:07:12,308 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-09 17:07:12,332 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 17:07:12,333 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 17:07:12,333 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 17:07:12,333 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 17:07:12,333 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 17:07:12,333 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 17:07:12,333 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 17:07:12,333 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t_funThread1of1ForFork0======== [2021-07-09 17:07:12,349 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158 places, 186 transitions, 380 flow [2021-07-09 17:07:12,432 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2220 states, 2215 states have (on average 2.2600451467268625) internal successors, (5006), 2219 states have internal predecessors, (5006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:12,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 2220 states, 2215 states have (on average 2.2600451467268625) internal successors, (5006), 2219 states have internal predecessors, (5006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-07-09 17:07:12,457 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:12,458 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:12,458 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:12,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:12,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1309434599, now seen corresponding path program 1 times [2021-07-09 17:07:12,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:12,472 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504119226] [2021-07-09 17:07:12,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:12,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:07:12,659 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:12,659 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504119226] [2021-07-09 17:07:12,660 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504119226] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:07:12,660 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:07:12,660 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-09 17:07:12,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944084551] [2021-07-09 17:07:12,664 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-09 17:07:12,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:12,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-09 17:07:12,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-09 17:07:12,685 INFO L87 Difference]: Start difference. First operand has 2220 states, 2215 states have (on average 2.2600451467268625) internal successors, (5006), 2219 states have internal predecessors, (5006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:12,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:12,748 INFO L93 Difference]: Finished difference Result 2128 states and 4142 transitions. [2021-07-09 17:07:12,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-09 17:07:12,750 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-07-09 17:07:12,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:12,774 INFO L225 Difference]: With dead ends: 2128 [2021-07-09 17:07:12,774 INFO L226 Difference]: Without dead ends: 1623 [2021-07-09 17:07:12,775 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-09 17:07:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2021-07-09 17:07:12,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1623. [2021-07-09 17:07:12,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1619 states have (on average 1.945027794935145) internal successors, (3149), 1622 states have internal predecessors, (3149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 3149 transitions. [2021-07-09 17:07:12,896 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 3149 transitions. Word has length 58 [2021-07-09 17:07:12,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:12,896 INFO L482 AbstractCegarLoop]: Abstraction has 1623 states and 3149 transitions. [2021-07-09 17:07:12,897 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:12,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 3149 transitions. [2021-07-09 17:07:12,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-07-09 17:07:12,901 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:12,901 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:12,902 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-09 17:07:12,902 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:12,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:12,904 INFO L82 PathProgramCache]: Analyzing trace with hash 152145400, now seen corresponding path program 1 times [2021-07-09 17:07:12,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:12,905 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042000570] [2021-07-09 17:07:12,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:13,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:07:13,028 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:13,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042000570] [2021-07-09 17:07:13,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042000570] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:07:13,028 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:07:13,029 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-09 17:07:13,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493471349] [2021-07-09 17:07:13,030 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-09 17:07:13,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:13,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-09 17:07:13,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 17:07:13,031 INFO L87 Difference]: Start difference. First operand 1623 states and 3149 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:13,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:13,067 INFO L93 Difference]: Finished difference Result 1627 states and 3153 transitions. [2021-07-09 17:07:13,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-09 17:07:13,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-07-09 17:07:13,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:13,079 INFO L225 Difference]: With dead ends: 1627 [2021-07-09 17:07:13,079 INFO L226 Difference]: Without dead ends: 1627 [2021-07-09 17:07:13,081 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 17:07:13,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2021-07-09 17:07:13,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1624. [2021-07-09 17:07:13,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1620 states have (on average 1.9444444444444444) internal successors, (3150), 1623 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 3150 transitions. [2021-07-09 17:07:13,122 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 3150 transitions. Word has length 58 [2021-07-09 17:07:13,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:13,122 INFO L482 AbstractCegarLoop]: Abstraction has 1624 states and 3150 transitions. [2021-07-09 17:07:13,122 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 3150 transitions. [2021-07-09 17:07:13,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-07-09 17:07:13,124 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:13,124 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:13,125 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-09 17:07:13,125 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:13,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:13,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1408293890, now seen corresponding path program 1 times [2021-07-09 17:07:13,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:13,125 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271743885] [2021-07-09 17:07:13,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:07:13,215 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:13,215 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271743885] [2021-07-09 17:07:13,215 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271743885] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:13,215 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65024609] [2021-07-09 17:07:13,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:13,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2021-07-09 17:07:13,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:07:13,643 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65024609] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:13,643 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:13,644 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-07-09 17:07:13,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206567939] [2021-07-09 17:07:13,645 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 17:07:13,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:13,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 17:07:13,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-07-09 17:07:13,646 INFO L87 Difference]: Start difference. First operand 1624 states and 3150 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:13,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:13,740 INFO L93 Difference]: Finished difference Result 1632 states and 3158 transitions. [2021-07-09 17:07:13,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-09 17:07:13,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-07-09 17:07:13,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:13,751 INFO L225 Difference]: With dead ends: 1632 [2021-07-09 17:07:13,751 INFO L226 Difference]: Without dead ends: 1632 [2021-07-09 17:07:13,751 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 40.0ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-07-09 17:07:13,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2021-07-09 17:07:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1629. [2021-07-09 17:07:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1625 states have (on average 1.9415384615384614) internal successors, (3155), 1628 states have internal predecessors, (3155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 3155 transitions. [2021-07-09 17:07:13,795 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 3155 transitions. Word has length 63 [2021-07-09 17:07:13,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:13,795 INFO L482 AbstractCegarLoop]: Abstraction has 1629 states and 3155 transitions. [2021-07-09 17:07:13,796 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:13,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 3155 transitions. [2021-07-09 17:07:13,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-07-09 17:07:13,798 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:13,798 INFO L508 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:14,013 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-07-09 17:07:14,013 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:14,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1616667064, now seen corresponding path program 2 times [2021-07-09 17:07:14,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:14,014 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855165837] [2021-07-09 17:07:14,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:07:14,086 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:14,086 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855165837] [2021-07-09 17:07:14,086 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855165837] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:14,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091729665] [2021-07-09 17:07:14,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:14,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-07-09 17:07:14,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:07:14,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2021-07-09 17:07:14,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:14,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-09 17:07:14,263 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:14,265 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:14,267 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:14,267 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-09 17:07:14,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-09 17:07:14,299 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:14,303 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:14,304 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:14,304 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-09 17:07:14,414 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-09 17:07:14,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-09 17:07:14,417 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:14,421 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:14,421 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:14,422 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-09 17:07:14,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:07:14,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:07:14,480 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:14,485 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:14,485 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:14,491 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:14,494 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:14,495 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-07-09 17:07:14,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-07-09 17:07:14,552 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:14,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:14,557 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-09 17:07:14,557 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:18, output treesize:10 [2021-07-09 17:07:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-07-09 17:07:14,630 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091729665] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:07:14,630 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-07-09 17:07:14,630 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2021-07-09 17:07:14,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926560090] [2021-07-09 17:07:14,631 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 17:07:14,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:14,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 17:07:14,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-07-09 17:07:14,632 INFO L87 Difference]: Start difference. First operand 1629 states and 3155 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:15,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:15,049 INFO L93 Difference]: Finished difference Result 1951 states and 3731 transitions. [2021-07-09 17:07:15,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-07-09 17:07:15,050 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-07-09 17:07:15,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:15,055 INFO L225 Difference]: With dead ends: 1951 [2021-07-09 17:07:15,055 INFO L226 Difference]: Without dead ends: 1059 [2021-07-09 17:07:15,055 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 282.2ms TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2021-07-09 17:07:15,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2021-07-09 17:07:15,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1059. [2021-07-09 17:07:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 1057 states have (on average 1.8987701040681173) internal successors, (2007), 1058 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:15,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 2007 transitions. [2021-07-09 17:07:15,076 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 2007 transitions. Word has length 68 [2021-07-09 17:07:15,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:15,077 INFO L482 AbstractCegarLoop]: Abstraction has 1059 states and 2007 transitions. [2021-07-09 17:07:15,077 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:15,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 2007 transitions. [2021-07-09 17:07:15,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-09 17:07:15,079 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:15,079 INFO L508 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:15,292 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:15,293 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:15,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:15,293 INFO L82 PathProgramCache]: Analyzing trace with hash -69431433, now seen corresponding path program 1 times [2021-07-09 17:07:15,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:15,293 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524387861] [2021-07-09 17:07:15,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-07-09 17:07:15,339 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:15,339 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524387861] [2021-07-09 17:07:15,339 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524387861] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:15,340 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885718212] [2021-07-09 17:07:15,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:15,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2021-07-09 17:07:15,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:15,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-07-09 17:07:15,570 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885718212] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:15,570 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:15,570 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2021-07-09 17:07:15,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790125744] [2021-07-09 17:07:15,571 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 17:07:15,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:15,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 17:07:15,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-07-09 17:07:15,572 INFO L87 Difference]: Start difference. First operand 1059 states and 2007 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:15,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:15,657 INFO L93 Difference]: Finished difference Result 171 states and 266 transitions. [2021-07-09 17:07:15,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-09 17:07:15,657 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-07-09 17:07:15,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:15,658 INFO L225 Difference]: With dead ends: 171 [2021-07-09 17:07:15,658 INFO L226 Difference]: Without dead ends: 0 [2021-07-09 17:07:15,658 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 76.4ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-07-09 17:07:15,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-09 17:07:15,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-09 17:07:15,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:15,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-09 17:07:15,659 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2021-07-09 17:07:15,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:15,659 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-09 17:07:15,659 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:15,659 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-09 17:07:15,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-09 17:07:15,872 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:15,873 INFO L301 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2021-07-09 17:07:15,874 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-07-09 17:07:15,875 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 17:07:15,875 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 17:07:15,875 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 17:07:15,876 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 17:07:15,876 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 17:07:15,876 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 17:07:15,876 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 17:07:15,876 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-09 17:07:15,878 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158 places, 186 transitions, 380 flow [2021-07-09 17:07:15,918 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2985 states, 2980 states have (on average 2.397986577181208) internal successors, (7146), 2984 states have internal predecessors, (7146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:15,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 2985 states, 2980 states have (on average 2.397986577181208) internal successors, (7146), 2984 states have internal predecessors, (7146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:15,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-07-09 17:07:15,924 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:15,924 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:15,924 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:15,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:15,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1144879738, now seen corresponding path program 1 times [2021-07-09 17:07:15,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:15,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801925642] [2021-07-09 17:07:15,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:15,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:07:15,943 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:15,943 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801925642] [2021-07-09 17:07:15,943 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801925642] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:07:15,943 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:07:15,944 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-09 17:07:15,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087295195] [2021-07-09 17:07:15,944 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-09 17:07:15,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:15,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-09 17:07:15,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-09 17:07:15,957 INFO L87 Difference]: Start difference. First operand has 2985 states, 2980 states have (on average 2.397986577181208) internal successors, (7146), 2984 states have internal predecessors, (7146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:15,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:15,982 INFO L93 Difference]: Finished difference Result 2877 states and 5679 transitions. [2021-07-09 17:07:15,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-09 17:07:15,983 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-07-09 17:07:15,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:15,989 INFO L225 Difference]: With dead ends: 2877 [2021-07-09 17:07:15,989 INFO L226 Difference]: Without dead ends: 1451 [2021-07-09 17:07:15,989 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-09 17:07:15,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2021-07-09 17:07:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1451. [2021-07-09 17:07:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 1444 states have (on average 1.9362880886426592) internal successors, (2796), 1450 states have internal predecessors, (2796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2796 transitions. [2021-07-09 17:07:16,020 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2796 transitions. Word has length 42 [2021-07-09 17:07:16,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:16,020 INFO L482 AbstractCegarLoop]: Abstraction has 1451 states and 2796 transitions. [2021-07-09 17:07:16,020 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2796 transitions. [2021-07-09 17:07:16,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-07-09 17:07:16,021 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:16,021 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:16,021 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-09 17:07:16,021 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:16,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:16,021 INFO L82 PathProgramCache]: Analyzing trace with hash 572314360, now seen corresponding path program 1 times [2021-07-09 17:07:16,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:16,022 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229868939] [2021-07-09 17:07:16,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:07:16,061 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:16,062 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229868939] [2021-07-09 17:07:16,062 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229868939] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:07:16,062 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:07:16,063 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-09 17:07:16,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404821028] [2021-07-09 17:07:16,063 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-09 17:07:16,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:16,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-09 17:07:16,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 17:07:16,064 INFO L87 Difference]: Start difference. First operand 1451 states and 2796 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:16,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:16,081 INFO L93 Difference]: Finished difference Result 1455 states and 2800 transitions. [2021-07-09 17:07:16,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-09 17:07:16,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-07-09 17:07:16,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:16,087 INFO L225 Difference]: With dead ends: 1455 [2021-07-09 17:07:16,087 INFO L226 Difference]: Without dead ends: 1455 [2021-07-09 17:07:16,088 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 17:07:16,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2021-07-09 17:07:16,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1452. [2021-07-09 17:07:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1445 states have (on average 1.9356401384083044) internal successors, (2797), 1451 states have internal predecessors, (2797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:16,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2797 transitions. [2021-07-09 17:07:16,121 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2797 transitions. Word has length 42 [2021-07-09 17:07:16,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:16,121 INFO L482 AbstractCegarLoop]: Abstraction has 1452 states and 2797 transitions. [2021-07-09 17:07:16,121 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:16,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2797 transitions. [2021-07-09 17:07:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-07-09 17:07:16,122 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:16,122 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:16,122 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-09 17:07:16,122 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:16,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:16,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1507642114, now seen corresponding path program 1 times [2021-07-09 17:07:16,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:16,123 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128635715] [2021-07-09 17:07:16,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:07:16,163 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:16,163 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128635715] [2021-07-09 17:07:16,163 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128635715] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:16,163 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032527314] [2021-07-09 17:07:16,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:16,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2021-07-09 17:07:16,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-07-09 17:07:16,327 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032527314] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:07:16,327 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-07-09 17:07:16,327 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-07-09 17:07:16,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902035436] [2021-07-09 17:07:16,328 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-09 17:07:16,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:16,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-09 17:07:16,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-09 17:07:16,328 INFO L87 Difference]: Start difference. First operand 1452 states and 2797 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:16,345 INFO L93 Difference]: Finished difference Result 1438 states and 2783 transitions. [2021-07-09 17:07:16,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-09 17:07:16,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-07-09 17:07:16,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:16,351 INFO L225 Difference]: With dead ends: 1438 [2021-07-09 17:07:16,351 INFO L226 Difference]: Without dead ends: 1438 [2021-07-09 17:07:16,351 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 12.6ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-09 17:07:16,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2021-07-09 17:07:16,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1438. [2021-07-09 17:07:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1432 states have (on average 1.943435754189944) internal successors, (2783), 1437 states have internal predecessors, (2783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 2783 transitions. [2021-07-09 17:07:16,399 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 2783 transitions. Word has length 47 [2021-07-09 17:07:16,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:16,399 INFO L482 AbstractCegarLoop]: Abstraction has 1438 states and 2783 transitions. [2021-07-09 17:07:16,400 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 2783 transitions. [2021-07-09 17:07:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-07-09 17:07:16,400 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:16,400 INFO L508 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:16,616 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:16,617 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:16,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:16,617 INFO L82 PathProgramCache]: Analyzing trace with hash 985402851, now seen corresponding path program 1 times [2021-07-09 17:07:16,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:16,617 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954585813] [2021-07-09 17:07:16,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:07:16,662 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:16,662 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954585813] [2021-07-09 17:07:16,662 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954585813] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:16,662 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008392388] [2021-07-09 17:07:16,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:16,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2021-07-09 17:07:16,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:16,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:07:16,804 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008392388] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:16,804 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:16,804 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-07-09 17:07:16,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413241871] [2021-07-09 17:07:16,805 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 17:07:16,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:16,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 17:07:16,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-07-09 17:07:16,806 INFO L87 Difference]: Start difference. First operand 1438 states and 2783 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:16,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:16,846 INFO L93 Difference]: Finished difference Result 1446 states and 2791 transitions. [2021-07-09 17:07:16,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-09 17:07:16,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-07-09 17:07:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:16,853 INFO L225 Difference]: With dead ends: 1446 [2021-07-09 17:07:16,853 INFO L226 Difference]: Without dead ends: 1446 [2021-07-09 17:07:16,853 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 26.6ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-07-09 17:07:16,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2021-07-09 17:07:16,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1443. [2021-07-09 17:07:16,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 1437 states have (on average 1.9401530967292973) internal successors, (2788), 1442 states have internal predecessors, (2788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:16,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2788 transitions. [2021-07-09 17:07:16,881 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2788 transitions. Word has length 48 [2021-07-09 17:07:16,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:16,881 INFO L482 AbstractCegarLoop]: Abstraction has 1443 states and 2788 transitions. [2021-07-09 17:07:16,881 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:16,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2788 transitions. [2021-07-09 17:07:16,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-07-09 17:07:16,886 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:16,886 INFO L508 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:17,109 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:17,109 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:17,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:17,110 INFO L82 PathProgramCache]: Analyzing trace with hash -2108271767, now seen corresponding path program 2 times [2021-07-09 17:07:17,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:17,110 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107173298] [2021-07-09 17:07:17,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:07:17,154 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:17,154 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107173298] [2021-07-09 17:07:17,154 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107173298] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:17,154 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694839292] [2021-07-09 17:07:17,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:17,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-07-09 17:07:17,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:07:17,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-07-09 17:07:17,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:17,313 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:07:17,313 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694839292] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:17,313 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:17,313 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-07-09 17:07:17,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748491242] [2021-07-09 17:07:17,316 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 17:07:17,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:17,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 17:07:17,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-07-09 17:07:17,316 INFO L87 Difference]: Start difference. First operand 1443 states and 2788 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:17,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:17,374 INFO L93 Difference]: Finished difference Result 1451 states and 2796 transitions. [2021-07-09 17:07:17,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 17:07:17,375 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-07-09 17:07:17,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:17,380 INFO L225 Difference]: With dead ends: 1451 [2021-07-09 17:07:17,380 INFO L226 Difference]: Without dead ends: 1451 [2021-07-09 17:07:17,381 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 55.0ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-07-09 17:07:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2021-07-09 17:07:17,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1448. [2021-07-09 17:07:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1442 states have (on average 1.9368932038834952) internal successors, (2793), 1447 states have internal predecessors, (2793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2793 transitions. [2021-07-09 17:07:17,426 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2793 transitions. Word has length 53 [2021-07-09 17:07:17,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:17,426 INFO L482 AbstractCegarLoop]: Abstraction has 1448 states and 2793 transitions. [2021-07-09 17:07:17,426 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:17,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2793 transitions. [2021-07-09 17:07:17,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-07-09 17:07:17,427 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:17,427 INFO L508 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:17,640 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:17,641 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:17,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:17,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1912041053, now seen corresponding path program 3 times [2021-07-09 17:07:17,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:17,641 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463715053] [2021-07-09 17:07:17,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:07:17,702 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:17,702 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463715053] [2021-07-09 17:07:17,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463715053] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:17,703 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394450109] [2021-07-09 17:07:17,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:17,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-07-09 17:07:17,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:07:17,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjunts are in the unsatisfiable core [2021-07-09 17:07:17,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:17,910 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:07:17,910 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394450109] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:17,910 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:17,910 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-07-09 17:07:17,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682555996] [2021-07-09 17:07:17,911 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-09 17:07:17,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:17,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-09 17:07:17,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-07-09 17:07:17,912 INFO L87 Difference]: Start difference. First operand 1448 states and 2793 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:17,996 INFO L93 Difference]: Finished difference Result 1456 states and 2801 transitions. [2021-07-09 17:07:17,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-09 17:07:17,996 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-07-09 17:07:17,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:18,001 INFO L225 Difference]: With dead ends: 1456 [2021-07-09 17:07:18,002 INFO L226 Difference]: Without dead ends: 1456 [2021-07-09 17:07:18,002 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 80.9ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-07-09 17:07:18,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2021-07-09 17:07:18,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1453. [2021-07-09 17:07:18,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1447 states have (on average 1.9336558396682793) internal successors, (2798), 1452 states have internal predecessors, (2798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2798 transitions. [2021-07-09 17:07:18,027 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2798 transitions. Word has length 58 [2021-07-09 17:07:18,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:18,027 INFO L482 AbstractCegarLoop]: Abstraction has 1453 states and 2798 transitions. [2021-07-09 17:07:18,027 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:18,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2798 transitions. [2021-07-09 17:07:18,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-07-09 17:07:18,028 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:18,028 INFO L508 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:18,251 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:18,251 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:18,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:18,252 INFO L82 PathProgramCache]: Analyzing trace with hash 822486953, now seen corresponding path program 4 times [2021-07-09 17:07:18,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:18,252 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749751125] [2021-07-09 17:07:18,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:18,322 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:07:18,322 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:18,322 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749751125] [2021-07-09 17:07:18,323 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749751125] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:18,323 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116975604] [2021-07-09 17:07:18,323 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:18,402 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-07-09 17:07:18,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:07:18,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2021-07-09 17:07:18,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:18,554 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:07:18,554 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116975604] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:18,554 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:18,554 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-07-09 17:07:18,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232737519] [2021-07-09 17:07:18,557 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-09 17:07:18,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:18,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-09 17:07:18,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-07-09 17:07:18,558 INFO L87 Difference]: Start difference. First operand 1453 states and 2798 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:18,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:18,716 INFO L93 Difference]: Finished difference Result 1461 states and 2806 transitions. [2021-07-09 17:07:18,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-09 17:07:18,716 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-07-09 17:07:18,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:18,721 INFO L225 Difference]: With dead ends: 1461 [2021-07-09 17:07:18,721 INFO L226 Difference]: Without dead ends: 1461 [2021-07-09 17:07:18,722 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 129.8ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-07-09 17:07:18,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2021-07-09 17:07:18,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1458. [2021-07-09 17:07:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 1452 states have (on average 1.9304407713498624) internal successors, (2803), 1457 states have internal predecessors, (2803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 2803 transitions. [2021-07-09 17:07:18,749 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 2803 transitions. Word has length 63 [2021-07-09 17:07:18,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:18,750 INFO L482 AbstractCegarLoop]: Abstraction has 1458 states and 2803 transitions. [2021-07-09 17:07:18,750 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 2803 transitions. [2021-07-09 17:07:18,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-07-09 17:07:18,750 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:18,751 INFO L508 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:18,964 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-07-09 17:07:18,965 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:18,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:18,965 INFO L82 PathProgramCache]: Analyzing trace with hash -447519389, now seen corresponding path program 5 times [2021-07-09 17:07:18,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:18,965 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775743919] [2021-07-09 17:07:18,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:07:19,066 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:19,066 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775743919] [2021-07-09 17:07:19,066 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775743919] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:19,066 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574104337] [2021-07-09 17:07:19,066 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:19,140 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-07-09 17:07:19,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:07:19,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2021-07-09 17:07:19,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:07:19,260 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574104337] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:19,260 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:19,260 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2021-07-09 17:07:19,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036707105] [2021-07-09 17:07:19,261 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-07-09 17:07:19,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:19,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-07-09 17:07:19,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-07-09 17:07:19,262 INFO L87 Difference]: Start difference. First operand 1458 states and 2803 transitions. Second operand has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:19,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:19,411 INFO L93 Difference]: Finished difference Result 1466 states and 2811 transitions. [2021-07-09 17:07:19,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-07-09 17:07:19,413 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-07-09 17:07:19,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:19,418 INFO L225 Difference]: With dead ends: 1466 [2021-07-09 17:07:19,418 INFO L226 Difference]: Without dead ends: 1466 [2021-07-09 17:07:19,418 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 160.9ms TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2021-07-09 17:07:19,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2021-07-09 17:07:19,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1463. [2021-07-09 17:07:19,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1463 states, 1457 states have (on average 1.9272477693891559) internal successors, (2808), 1462 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 2808 transitions. [2021-07-09 17:07:19,441 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 2808 transitions. Word has length 68 [2021-07-09 17:07:19,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:19,442 INFO L482 AbstractCegarLoop]: Abstraction has 1463 states and 2808 transitions. [2021-07-09 17:07:19,442 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:19,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2808 transitions. [2021-07-09 17:07:19,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-09 17:07:19,442 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:19,443 INFO L508 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:19,665 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:19,665 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:19,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:19,665 INFO L82 PathProgramCache]: Analyzing trace with hash 774482921, now seen corresponding path program 6 times [2021-07-09 17:07:19,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:19,665 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419546523] [2021-07-09 17:07:19,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:07:19,788 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:19,788 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419546523] [2021-07-09 17:07:19,788 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419546523] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:19,788 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695399896] [2021-07-09 17:07:19,788 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:19,894 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-07-09 17:07:19,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:07:19,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjunts are in the unsatisfiable core [2021-07-09 17:07:19,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:20,030 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:07:20,030 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695399896] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:20,030 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:20,030 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-07-09 17:07:20,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108875314] [2021-07-09 17:07:20,031 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-07-09 17:07:20,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:20,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-07-09 17:07:20,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-07-09 17:07:20,031 INFO L87 Difference]: Start difference. First operand 1463 states and 2808 transitions. Second operand has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:20,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:20,203 INFO L93 Difference]: Finished difference Result 1471 states and 2816 transitions. [2021-07-09 17:07:20,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-07-09 17:07:20,204 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-07-09 17:07:20,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:20,209 INFO L225 Difference]: With dead ends: 1471 [2021-07-09 17:07:20,209 INFO L226 Difference]: Without dead ends: 1471 [2021-07-09 17:07:20,209 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 200.4ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-07-09 17:07:20,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2021-07-09 17:07:20,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1468. [2021-07-09 17:07:20,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1462 states have (on average 1.924076607387141) internal successors, (2813), 1467 states have internal predecessors, (2813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:20,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2813 transitions. [2021-07-09 17:07:20,233 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2813 transitions. Word has length 73 [2021-07-09 17:07:20,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:20,233 INFO L482 AbstractCegarLoop]: Abstraction has 1468 states and 2813 transitions. [2021-07-09 17:07:20,233 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:20,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2813 transitions. [2021-07-09 17:07:20,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-07-09 17:07:20,234 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:20,234 INFO L508 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:20,457 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:20,457 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:20,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:20,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1392019747, now seen corresponding path program 7 times [2021-07-09 17:07:20,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:20,458 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378992710] [2021-07-09 17:07:20,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:07:20,604 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:20,604 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378992710] [2021-07-09 17:07:20,604 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378992710] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:20,604 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842322996] [2021-07-09 17:07:20,604 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:20,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjunts are in the unsatisfiable core [2021-07-09 17:07:20,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:07:20,871 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842322996] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:20,871 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:20,871 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-07-09 17:07:20,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306364102] [2021-07-09 17:07:20,871 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-07-09 17:07:20,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:20,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-07-09 17:07:20,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-07-09 17:07:20,872 INFO L87 Difference]: Start difference. First operand 1468 states and 2813 transitions. Second operand has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:21,089 INFO L93 Difference]: Finished difference Result 1476 states and 2821 transitions. [2021-07-09 17:07:21,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-07-09 17:07:21,090 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-07-09 17:07:21,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:21,111 INFO L225 Difference]: With dead ends: 1476 [2021-07-09 17:07:21,111 INFO L226 Difference]: Without dead ends: 1476 [2021-07-09 17:07:21,111 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 258.3ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-07-09 17:07:21,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2021-07-09 17:07:21,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1473. [2021-07-09 17:07:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1473 states, 1467 states have (on average 1.9209270620313565) internal successors, (2818), 1472 states have internal predecessors, (2818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:21,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2818 transitions. [2021-07-09 17:07:21,137 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 2818 transitions. Word has length 78 [2021-07-09 17:07:21,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:21,138 INFO L482 AbstractCegarLoop]: Abstraction has 1473 states and 2818 transitions. [2021-07-09 17:07:21,138 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:21,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 2818 transitions. [2021-07-09 17:07:21,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-07-09 17:07:21,138 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:21,138 INFO L508 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:21,361 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-07-09 17:07:21,362 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:21,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:21,362 INFO L82 PathProgramCache]: Analyzing trace with hash -2132484055, now seen corresponding path program 8 times [2021-07-09 17:07:21,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:21,362 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242755318] [2021-07-09 17:07:21,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:21,516 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:07:21,517 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:21,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242755318] [2021-07-09 17:07:21,517 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242755318] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:21,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084532027] [2021-07-09 17:07:21,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:21,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-07-09 17:07:21,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:07:21,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 18 conjunts are in the unsatisfiable core [2021-07-09 17:07:21,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:21,741 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:07:21,741 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084532027] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:21,741 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:21,742 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2021-07-09 17:07:21,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256273724] [2021-07-09 17:07:21,742 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-07-09 17:07:21,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:21,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-07-09 17:07:21,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2021-07-09 17:07:21,743 INFO L87 Difference]: Start difference. First operand 1473 states and 2818 transitions. Second operand has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:22,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:22,016 INFO L93 Difference]: Finished difference Result 1481 states and 2826 transitions. [2021-07-09 17:07:22,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-07-09 17:07:22,021 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-07-09 17:07:22,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:22,024 INFO L225 Difference]: With dead ends: 1481 [2021-07-09 17:07:22,024 INFO L226 Difference]: Without dead ends: 1481 [2021-07-09 17:07:22,025 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 321.6ms TimeCoverageRelationStatistics Valid=427, Invalid=905, Unknown=0, NotChecked=0, Total=1332 [2021-07-09 17:07:22,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2021-07-09 17:07:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1478. [2021-07-09 17:07:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 1472 states have (on average 1.9177989130434783) internal successors, (2823), 1477 states have internal predecessors, (2823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:22,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 2823 transitions. [2021-07-09 17:07:22,047 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 2823 transitions. Word has length 83 [2021-07-09 17:07:22,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:22,047 INFO L482 AbstractCegarLoop]: Abstraction has 1478 states and 2823 transitions. [2021-07-09 17:07:22,047 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2823 transitions. [2021-07-09 17:07:22,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-07-09 17:07:22,048 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:22,048 INFO L508 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:22,268 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-07-09 17:07:22,269 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:22,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:22,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1504445213, now seen corresponding path program 9 times [2021-07-09 17:07:22,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:22,269 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608958054] [2021-07-09 17:07:22,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:07:22,481 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:22,481 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608958054] [2021-07-09 17:07:22,481 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608958054] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:22,481 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467255205] [2021-07-09 17:07:22,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:22,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-07-09 17:07:22,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:07:22,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 20 conjunts are in the unsatisfiable core [2021-07-09 17:07:22,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:07:22,791 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467255205] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:22,791 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:22,792 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-07-09 17:07:22,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136950913] [2021-07-09 17:07:22,792 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-07-09 17:07:22,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:22,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-07-09 17:07:22,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-07-09 17:07:22,793 INFO L87 Difference]: Start difference. First operand 1478 states and 2823 transitions. Second operand has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:23,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:23,090 INFO L93 Difference]: Finished difference Result 1483 states and 2828 transitions. [2021-07-09 17:07:23,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-07-09 17:07:23,090 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-07-09 17:07:23,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:23,093 INFO L225 Difference]: With dead ends: 1483 [2021-07-09 17:07:23,093 INFO L226 Difference]: Without dead ends: 1483 [2021-07-09 17:07:23,093 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 409.1ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-07-09 17:07:23,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2021-07-09 17:07:23,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1483. [2021-07-09 17:07:23,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 1477 states have (on average 1.914691943127962) internal successors, (2828), 1482 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 2828 transitions. [2021-07-09 17:07:23,117 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 2828 transitions. Word has length 88 [2021-07-09 17:07:23,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:23,117 INFO L482 AbstractCegarLoop]: Abstraction has 1483 states and 2828 transitions. [2021-07-09 17:07:23,117 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:23,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 2828 transitions. [2021-07-09 17:07:23,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-07-09 17:07:23,118 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:23,118 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:23,332 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-07-09 17:07:23,333 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:23,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:23,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1822702487, now seen corresponding path program 10 times [2021-07-09 17:07:23,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:23,333 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264694842] [2021-07-09 17:07:23,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 17:07:23,363 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 17:07:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 17:07:23,385 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 17:07:23,412 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-09 17:07:23,412 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-09 17:07:23,412 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-07-09 17:07:23,412 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2021-07-09 17:07:23,413 WARN L243 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-07-09 17:07:23,413 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-07-09 17:07:23,433 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,433 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,433 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,433 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,433 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,433 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,433 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,433 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,433 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,433 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,434 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,434 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,434 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,434 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,434 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,434 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,434 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,435 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,435 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,435 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,435 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,435 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,435 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,435 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,435 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,435 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,435 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,435 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,435 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,435 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,435 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,435 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,436 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,436 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,436 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,436 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,436 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,436 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,436 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,436 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,436 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,436 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,436 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,436 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,436 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,436 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,436 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,437 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,437 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,437 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,437 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,437 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,437 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,437 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,437 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,437 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,437 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,437 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,437 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,437 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,437 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,438 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,438 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,438 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,438 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,438 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,438 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,438 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,438 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,438 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,438 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,438 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,438 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,438 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,438 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,439 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,439 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,439 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,439 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,439 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,439 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,439 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,439 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,439 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,439 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,439 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,439 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,439 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,440 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,440 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,440 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,440 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,440 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,440 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,440 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,440 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,440 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,440 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,440 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,440 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,440 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,440 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,441 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,441 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,441 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,441 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,441 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,441 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,441 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,441 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,441 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,441 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,441 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,441 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,441 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,441 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,441 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,442 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,442 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,442 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,442 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,442 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,442 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,442 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,442 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,442 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,442 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,443 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,443 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,444 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,444 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,444 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,444 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,444 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,444 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,444 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,444 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,444 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,444 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,444 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,444 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,445 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,445 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,445 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,445 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,445 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,445 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,445 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,445 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,445 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,445 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,445 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,445 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,445 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,446 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,446 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,446 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,446 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,446 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,446 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,446 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,446 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,446 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,446 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,446 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,446 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,446 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,446 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,446 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,447 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,447 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,447 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,447 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,447 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,447 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,447 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,447 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,447 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,447 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,447 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,447 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,447 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,447 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,447 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,447 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,448 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,448 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,448 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,448 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,448 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,448 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,448 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,448 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,448 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,448 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,448 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,448 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,448 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,449 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,449 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,449 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,449 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,449 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,449 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,449 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,449 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,449 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,449 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,449 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,449 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,450 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,450 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,450 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,450 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,450 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,450 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,450 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,450 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,450 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,451 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,451 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,451 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,452 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,452 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,452 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,452 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,452 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,452 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,453 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,453 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,453 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,453 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,453 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,453 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,453 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,453 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,453 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,453 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,453 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,453 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,453 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,453 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,454 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,454 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,454 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,454 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,455 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,455 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,455 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,455 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,455 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,455 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,455 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,455 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,456 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,456 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,456 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,456 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,456 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,456 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,456 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,456 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,456 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,456 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,456 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,456 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,456 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,456 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,457 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,457 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,458 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,458 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,458 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,458 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,458 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,458 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,458 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,458 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,458 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,458 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,459 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,459 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,459 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,459 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,459 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,459 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,459 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,459 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,459 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,459 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,459 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,459 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,459 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:23,462 INFO L149 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-07-09 17:07:23,463 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-09 17:07:23,463 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 17:07:23,465 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 17:07:23,465 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 17:07:23,465 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 17:07:23,465 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 17:07:23,465 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 17:07:23,465 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 17:07:23,465 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t_funThread1of2ForFork0======== [2021-07-09 17:07:23,470 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 217 places, 257 transitions, 532 flow [2021-07-09 17:07:27,767 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 193105 states, 193093 states have (on average 3.6028131522116285) internal successors, (695678), 193104 states have internal predecessors, (695678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:28,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 193105 states, 193093 states have (on average 3.6028131522116285) internal successors, (695678), 193104 states have internal predecessors, (695678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-07-09 17:07:28,082 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:28,082 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:28,082 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:28,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:28,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1205536748, now seen corresponding path program 1 times [2021-07-09 17:07:28,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:28,083 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754151100] [2021-07-09 17:07:28,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:07:28,098 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:28,098 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754151100] [2021-07-09 17:07:28,098 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754151100] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:07:28,098 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:07:28,099 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-09 17:07:28,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649394137] [2021-07-09 17:07:28,099 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-09 17:07:28,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:28,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-09 17:07:28,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-09 17:07:28,874 INFO L87 Difference]: Start difference. First operand has 193105 states, 193093 states have (on average 3.6028131522116285) internal successors, (695678), 193104 states have internal predecessors, (695678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:30,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:30,823 INFO L93 Difference]: Finished difference Result 183278 states and 546271 transitions. [2021-07-09 17:07:30,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-09 17:07:30,823 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-07-09 17:07:30,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:31,566 INFO L225 Difference]: With dead ends: 183278 [2021-07-09 17:07:31,566 INFO L226 Difference]: Without dead ends: 90517 [2021-07-09 17:07:31,566 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-09 17:07:34,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90517 states. [2021-07-09 17:07:35,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90517 to 90517. [2021-07-09 17:07:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90517 states, 90503 states have (on average 2.943394141630664) internal successors, (266386), 90516 states have internal predecessors, (266386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90517 states to 90517 states and 266386 transitions. [2021-07-09 17:07:36,434 INFO L78 Accepts]: Start accepts. Automaton has 90517 states and 266386 transitions. Word has length 58 [2021-07-09 17:07:36,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:36,434 INFO L482 AbstractCegarLoop]: Abstraction has 90517 states and 266386 transitions. [2021-07-09 17:07:36,435 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 90517 states and 266386 transitions. [2021-07-09 17:07:36,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-07-09 17:07:36,441 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:36,441 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:36,441 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-07-09 17:07:36,441 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:36,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:36,442 INFO L82 PathProgramCache]: Analyzing trace with hash 256043251, now seen corresponding path program 1 times [2021-07-09 17:07:36,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:36,442 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132147903] [2021-07-09 17:07:36,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:07:36,456 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:36,456 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132147903] [2021-07-09 17:07:36,457 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132147903] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:07:36,457 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:07:36,457 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-09 17:07:36,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275056567] [2021-07-09 17:07:36,457 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-09 17:07:36,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:36,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-09 17:07:36,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 17:07:36,458 INFO L87 Difference]: Start difference. First operand 90517 states and 266386 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:37,256 INFO L93 Difference]: Finished difference Result 90521 states and 266390 transitions. [2021-07-09 17:07:37,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-09 17:07:37,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-07-09 17:07:37,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:37,595 INFO L225 Difference]: With dead ends: 90521 [2021-07-09 17:07:37,595 INFO L226 Difference]: Without dead ends: 90521 [2021-07-09 17:07:37,595 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 17:07:39,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90521 states. [2021-07-09 17:07:41,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90521 to 90518. [2021-07-09 17:07:41,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90518 states, 90504 states have (on average 2.943372668611332) internal successors, (266387), 90517 states have internal predecessors, (266387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90518 states to 90518 states and 266387 transitions. [2021-07-09 17:07:42,223 INFO L78 Accepts]: Start accepts. Automaton has 90518 states and 266387 transitions. Word has length 58 [2021-07-09 17:07:42,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:42,223 INFO L482 AbstractCegarLoop]: Abstraction has 90518 states and 266387 transitions. [2021-07-09 17:07:42,223 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:42,223 INFO L276 IsEmpty]: Start isEmpty. Operand 90518 states and 266387 transitions. [2021-07-09 17:07:42,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-07-09 17:07:42,229 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:42,229 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:42,229 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-07-09 17:07:42,229 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:42,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:42,229 INFO L82 PathProgramCache]: Analyzing trace with hash 141175930, now seen corresponding path program 1 times [2021-07-09 17:07:42,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:42,230 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279526567] [2021-07-09 17:07:42,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:07:42,295 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:42,295 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279526567] [2021-07-09 17:07:42,295 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279526567] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:42,295 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606708316] [2021-07-09 17:07:42,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:42,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2021-07-09 17:07:42,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:07:42,496 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606708316] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:42,497 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:42,497 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-07-09 17:07:42,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764665219] [2021-07-09 17:07:42,497 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 17:07:42,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:42,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 17:07:42,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-07-09 17:07:42,498 INFO L87 Difference]: Start difference. First operand 90518 states and 266387 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:42,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:42,894 INFO L93 Difference]: Finished difference Result 90526 states and 266395 transitions. [2021-07-09 17:07:42,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-09 17:07:42,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-07-09 17:07:42,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:43,453 INFO L225 Difference]: With dead ends: 90526 [2021-07-09 17:07:43,453 INFO L226 Difference]: Without dead ends: 90526 [2021-07-09 17:07:43,453 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 26.2ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-07-09 17:07:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90526 states. [2021-07-09 17:07:47,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90526 to 90523. [2021-07-09 17:07:47,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90523 states, 90509 states have (on average 2.943265310632092) internal successors, (266392), 90522 states have internal predecessors, (266392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:47,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90523 states to 90523 states and 266392 transitions. [2021-07-09 17:07:47,800 INFO L78 Accepts]: Start accepts. Automaton has 90523 states and 266392 transitions. Word has length 63 [2021-07-09 17:07:47,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:47,801 INFO L482 AbstractCegarLoop]: Abstraction has 90523 states and 266392 transitions. [2021-07-09 17:07:47,801 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:47,801 INFO L276 IsEmpty]: Start isEmpty. Operand 90523 states and 266392 transitions. [2021-07-09 17:07:47,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-07-09 17:07:47,806 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:47,806 INFO L508 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:48,029 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:48,029 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:48,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:48,030 INFO L82 PathProgramCache]: Analyzing trace with hash -357366445, now seen corresponding path program 2 times [2021-07-09 17:07:48,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:48,030 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002307781] [2021-07-09 17:07:48,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:48,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:07:48,100 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:48,101 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002307781] [2021-07-09 17:07:48,101 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002307781] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:48,101 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101145388] [2021-07-09 17:07:48,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:48,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-07-09 17:07:48,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:07:48,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2021-07-09 17:07:48,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:48,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-09 17:07:48,211 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:48,212 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:48,213 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:48,213 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-09 17:07:48,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-09 17:07:48,228 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:48,231 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:48,232 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:48,232 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-09 17:07:48,290 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-09 17:07:48,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-09 17:07:48,292 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:48,295 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:48,296 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:48,296 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-09 17:07:48,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:07:48,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:07:48,346 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:48,349 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:48,350 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:48,355 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:48,356 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:48,356 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-07-09 17:07:48,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-07-09 17:07:48,414 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:48,415 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:48,417 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-09 17:07:48,417 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:18, output treesize:10 [2021-07-09 17:07:48,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-07-09 17:07:48,462 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101145388] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:07:48,462 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-07-09 17:07:48,462 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2021-07-09 17:07:48,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629691251] [2021-07-09 17:07:48,463 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 17:07:48,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:48,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 17:07:48,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-07-09 17:07:48,463 INFO L87 Difference]: Start difference. First operand 90523 states and 266392 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:49,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:49,762 INFO L93 Difference]: Finished difference Result 115429 states and 334822 transitions. [2021-07-09 17:07:49,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-07-09 17:07:49,763 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-07-09 17:07:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:49,961 INFO L225 Difference]: With dead ends: 115429 [2021-07-09 17:07:49,962 INFO L226 Difference]: Without dead ends: 86445 [2021-07-09 17:07:49,962 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 222.6ms TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2021-07-09 17:07:52,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86445 states. [2021-07-09 17:07:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86445 to 84469. [2021-07-09 17:07:53,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84469 states, 84460 states have (on average 2.9208382666350934) internal successors, (246694), 84468 states have internal predecessors, (246694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84469 states to 84469 states and 246694 transitions. [2021-07-09 17:07:54,175 INFO L78 Accepts]: Start accepts. Automaton has 84469 states and 246694 transitions. Word has length 68 [2021-07-09 17:07:54,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:54,175 INFO L482 AbstractCegarLoop]: Abstraction has 84469 states and 246694 transitions. [2021-07-09 17:07:54,175 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:54,175 INFO L276 IsEmpty]: Start isEmpty. Operand 84469 states and 246694 transitions. [2021-07-09 17:07:54,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-09 17:07:54,225 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:54,225 INFO L508 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:54,441 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-07-09 17:07:54,441 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:54,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:54,441 INFO L82 PathProgramCache]: Analyzing trace with hash -34686965, now seen corresponding path program 1 times [2021-07-09 17:07:54,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:54,441 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633816478] [2021-07-09 17:07:54,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-07-09 17:07:54,482 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:54,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633816478] [2021-07-09 17:07:54,482 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633816478] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:54,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711215833] [2021-07-09 17:07:54,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:54,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 2 conjunts are in the unsatisfiable core [2021-07-09 17:07:54,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:54,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-07-09 17:07:54,685 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:54,687 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:54,688 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:54,688 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2021-07-09 17:07:54,716 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-07-09 17:07:54,717 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711215833] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:07:54,717 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-07-09 17:07:54,717 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-07-09 17:07:54,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115851595] [2021-07-09 17:07:54,718 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-09 17:07:54,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:54,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-09 17:07:54,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-09 17:07:54,718 INFO L87 Difference]: Start difference. First operand 84469 states and 246694 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:55,092 INFO L93 Difference]: Finished difference Result 76063 states and 215844 transitions. [2021-07-09 17:07:55,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-09 17:07:55,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-07-09 17:07:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:55,277 INFO L225 Difference]: With dead ends: 76063 [2021-07-09 17:07:55,278 INFO L226 Difference]: Without dead ends: 72969 [2021-07-09 17:07:55,278 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.7ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-09 17:07:56,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72969 states. [2021-07-09 17:07:57,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72969 to 70961. [2021-07-09 17:07:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70961 states, 70935 states have (on average 2.845393670261507) internal successors, (201838), 70960 states have internal predecessors, (201838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70961 states to 70961 states and 201838 transitions. [2021-07-09 17:07:57,935 INFO L78 Accepts]: Start accepts. Automaton has 70961 states and 201838 transitions. Word has length 85 [2021-07-09 17:07:57,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:57,936 INFO L482 AbstractCegarLoop]: Abstraction has 70961 states and 201838 transitions. [2021-07-09 17:07:57,936 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:57,936 INFO L276 IsEmpty]: Start isEmpty. Operand 70961 states and 201838 transitions. [2021-07-09 17:07:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-07-09 17:07:57,961 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:57,961 INFO L508 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:58,161 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:58,161 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:58,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:58,162 INFO L82 PathProgramCache]: Analyzing trace with hash 856318943, now seen corresponding path program 1 times [2021-07-09 17:07:58,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:58,162 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699995264] [2021-07-09 17:07:58,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:58,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-07-09 17:07:58,194 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:58,194 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699995264] [2021-07-09 17:07:58,195 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699995264] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:58,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181172666] [2021-07-09 17:07:58,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:58,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2021-07-09 17:07:58,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-07-09 17:07:58,786 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181172666] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:58,787 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:58,787 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2021-07-09 17:07:58,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884113060] [2021-07-09 17:07:58,787 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 17:07:58,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:58,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 17:07:58,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-07-09 17:07:58,788 INFO L87 Difference]: Start difference. First operand 70961 states and 201838 transitions. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:59,193 INFO L93 Difference]: Finished difference Result 70409 states and 200744 transitions. [2021-07-09 17:07:59,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-09 17:07:59,194 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-07-09 17:07:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:59,348 INFO L225 Difference]: With dead ends: 70409 [2021-07-09 17:07:59,348 INFO L226 Difference]: Without dead ends: 70409 [2021-07-09 17:07:59,348 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 79.6ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-07-09 17:08:00,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70409 states. [2021-07-09 17:08:01,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70409 to 70406. [2021-07-09 17:08:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70406 states, 70381 states have (on average 2.852204430172916) internal successors, (200741), 70405 states have internal predecessors, (200741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70406 states to 70406 states and 200741 transitions. [2021-07-09 17:08:01,889 INFO L78 Accepts]: Start accepts. Automaton has 70406 states and 200741 transitions. Word has length 88 [2021-07-09 17:08:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:08:01,889 INFO L482 AbstractCegarLoop]: Abstraction has 70406 states and 200741 transitions. [2021-07-09 17:08:01,889 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:01,889 INFO L276 IsEmpty]: Start isEmpty. Operand 70406 states and 200741 transitions. [2021-07-09 17:08:01,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-07-09 17:08:01,947 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:08:01,947 INFO L508 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:08:02,148 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-07-09 17:08:02,148 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:08:02,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:08:02,148 INFO L82 PathProgramCache]: Analyzing trace with hash 53633985, now seen corresponding path program 1 times [2021-07-09 17:08:02,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:08:02,149 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865429893] [2021-07-09 17:08:02,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:08:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:08:02,204 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-07-09 17:08:02,205 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:08:02,205 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865429893] [2021-07-09 17:08:02,205 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865429893] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:08:02,205 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625831947] [2021-07-09 17:08:02,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:08:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:08:02,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2021-07-09 17:08:02,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:08:02,713 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-07-09 17:08:02,714 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625831947] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:08:02,714 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:08:02,714 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-07-09 17:08:02,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479079240] [2021-07-09 17:08:02,714 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-09 17:08:02,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:08:02,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-09 17:08:02,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-07-09 17:08:02,715 INFO L87 Difference]: Start difference. First operand 70406 states and 200741 transitions. Second operand has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:03,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:08:03,169 INFO L93 Difference]: Finished difference Result 70414 states and 200749 transitions. [2021-07-09 17:08:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-09 17:08:03,169 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-07-09 17:08:03,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:08:03,331 INFO L225 Difference]: With dead ends: 70414 [2021-07-09 17:08:03,331 INFO L226 Difference]: Without dead ends: 70414 [2021-07-09 17:08:03,332 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 79.4ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-07-09 17:08:04,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70414 states. [2021-07-09 17:08:05,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70414 to 70411. [2021-07-09 17:08:05,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70411 states, 70386 states have (on average 2.85207285539738) internal successors, (200746), 70410 states have internal predecessors, (200746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:06,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70411 states to 70411 states and 200746 transitions. [2021-07-09 17:08:06,037 INFO L78 Accepts]: Start accepts. Automaton has 70411 states and 200746 transitions. Word has length 103 [2021-07-09 17:08:06,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:08:06,038 INFO L482 AbstractCegarLoop]: Abstraction has 70411 states and 200746 transitions. [2021-07-09 17:08:06,038 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 70411 states and 200746 transitions. [2021-07-09 17:08:06,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-07-09 17:08:06,085 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:08:06,086 INFO L508 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:08:06,286 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-07-09 17:08:06,286 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:08:06,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:08:06,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1434955674, now seen corresponding path program 2 times [2021-07-09 17:08:06,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:08:06,287 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412783073] [2021-07-09 17:08:06,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:08:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:08:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-07-09 17:08:06,362 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:08:06,362 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412783073] [2021-07-09 17:08:06,362 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412783073] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:08:06,362 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952057550] [2021-07-09 17:08:06,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:08:06,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-07-09 17:08:06,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:08:06,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 10 conjunts are in the unsatisfiable core [2021-07-09 17:08:06,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:08:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-07-09 17:08:06,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952057550] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:08:06,608 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:08:06,609 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-07-09 17:08:06,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571373800] [2021-07-09 17:08:06,609 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-09 17:08:06,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:08:06,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-09 17:08:06,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-07-09 17:08:06,610 INFO L87 Difference]: Start difference. First operand 70411 states and 200746 transitions. Second operand has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:08:07,291 INFO L93 Difference]: Finished difference Result 70419 states and 200754 transitions. [2021-07-09 17:08:07,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-09 17:08:07,292 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-07-09 17:08:07,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:08:07,506 INFO L225 Difference]: With dead ends: 70419 [2021-07-09 17:08:07,506 INFO L226 Difference]: Without dead ends: 70419 [2021-07-09 17:08:07,507 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 111.0ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-07-09 17:08:08,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70419 states. [2021-07-09 17:08:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70419 to 70416. [2021-07-09 17:08:10,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70416 states, 70391 states have (on average 2.851941299313833) internal successors, (200751), 70415 states have internal predecessors, (200751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70416 states to 70416 states and 200751 transitions. [2021-07-09 17:08:10,276 INFO L78 Accepts]: Start accepts. Automaton has 70416 states and 200751 transitions. Word has length 108 [2021-07-09 17:08:10,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:08:10,276 INFO L482 AbstractCegarLoop]: Abstraction has 70416 states and 200751 transitions. [2021-07-09 17:08:10,276 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:10,276 INFO L276 IsEmpty]: Start isEmpty. Operand 70416 states and 200751 transitions. [2021-07-09 17:08:10,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-07-09 17:08:10,330 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:08:10,330 INFO L508 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:08:10,532 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-07-09 17:08:10,533 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:08:10,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:08:10,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1642798239, now seen corresponding path program 3 times [2021-07-09 17:08:10,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:08:10,533 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424909583] [2021-07-09 17:08:10,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:08:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:08:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-07-09 17:08:10,626 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:08:10,626 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424909583] [2021-07-09 17:08:10,626 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424909583] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:08:10,626 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750154807] [2021-07-09 17:08:10,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:08:10,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-07-09 17:08:10,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:08:10,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2021-07-09 17:08:10,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:08:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-07-09 17:08:10,916 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750154807] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:08:10,916 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:08:10,916 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2021-07-09 17:08:10,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013902288] [2021-07-09 17:08:10,917 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-07-09 17:08:10,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:08:10,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-07-09 17:08:10,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-07-09 17:08:10,918 INFO L87 Difference]: Start difference. First operand 70416 states and 200751 transitions. Second operand has 18 states, 18 states have (on average 8.444444444444445) internal successors, (152), 18 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:08:11,183 INFO L93 Difference]: Finished difference Result 11406 states and 31717 transitions. [2021-07-09 17:08:11,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-07-09 17:08:11,184 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.444444444444445) internal successors, (152), 18 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2021-07-09 17:08:11,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:08:11,199 INFO L225 Difference]: With dead ends: 11406 [2021-07-09 17:08:11,199 INFO L226 Difference]: Without dead ends: 9498 [2021-07-09 17:08:11,199 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 237.8ms TimeCoverageRelationStatistics Valid=220, Invalid=772, Unknown=0, NotChecked=0, Total=992 [2021-07-09 17:08:11,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9498 states. [2021-07-09 17:08:11,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9498 to 9351. [2021-07-09 17:08:11,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9351 states, 9349 states have (on average 2.788961386244518) internal successors, (26074), 9350 states have internal predecessors, (26074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:11,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9351 states to 9351 states and 26074 transitions. [2021-07-09 17:08:11,640 INFO L78 Accepts]: Start accepts. Automaton has 9351 states and 26074 transitions. Word has length 113 [2021-07-09 17:08:11,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:08:11,640 INFO L482 AbstractCegarLoop]: Abstraction has 9351 states and 26074 transitions. [2021-07-09 17:08:11,641 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 8.444444444444445) internal successors, (152), 18 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand 9351 states and 26074 transitions. [2021-07-09 17:08:11,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-07-09 17:08:11,653 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:08:11,653 INFO L508 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:08:11,868 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-07-09 17:08:11,868 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:08:11,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:08:11,869 INFO L82 PathProgramCache]: Analyzing trace with hash 890682539, now seen corresponding path program 1 times [2021-07-09 17:08:11,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:08:11,869 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255399601] [2021-07-09 17:08:11,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:08:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:08:11,991 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:08:11,991 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:08:11,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255399601] [2021-07-09 17:08:11,992 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255399601] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:08:11,992 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784930298] [2021-07-09 17:08:11,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:08:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:08:12,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 14 conjunts are in the unsatisfiable core [2021-07-09 17:08:12,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:08:12,278 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:08:12,278 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784930298] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:08:12,278 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:08:12,279 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-07-09 17:08:12,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510537312] [2021-07-09 17:08:12,279 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-07-09 17:08:12,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:08:12,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-07-09 17:08:12,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-07-09 17:08:12,280 INFO L87 Difference]: Start difference. First operand 9351 states and 26074 transitions. Second operand has 17 states, 17 states have (on average 7.352941176470588) internal successors, (125), 17 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:08:12,471 INFO L93 Difference]: Finished difference Result 9359 states and 26082 transitions. [2021-07-09 17:08:12,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-07-09 17:08:12,471 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.352941176470588) internal successors, (125), 17 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2021-07-09 17:08:12,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:08:12,485 INFO L225 Difference]: With dead ends: 9359 [2021-07-09 17:08:12,486 INFO L226 Difference]: Without dead ends: 9359 [2021-07-09 17:08:12,486 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 184.7ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-07-09 17:08:12,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9359 states. [2021-07-09 17:08:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9359 to 9356. [2021-07-09 17:08:12,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9356 states, 9354 states have (on average 2.7880051314945478) internal successors, (26079), 9355 states have internal predecessors, (26079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9356 states to 9356 states and 26079 transitions. [2021-07-09 17:08:12,809 INFO L78 Accepts]: Start accepts. Automaton has 9356 states and 26079 transitions. Word has length 124 [2021-07-09 17:08:12,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:08:12,809 INFO L482 AbstractCegarLoop]: Abstraction has 9356 states and 26079 transitions. [2021-07-09 17:08:12,809 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 7.352941176470588) internal successors, (125), 17 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:12,809 INFO L276 IsEmpty]: Start isEmpty. Operand 9356 states and 26079 transitions. [2021-07-09 17:08:12,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-07-09 17:08:12,819 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:08:12,819 INFO L508 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:08:13,020 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-07-09 17:08:13,020 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:08:13,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:08:13,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1323926130, now seen corresponding path program 2 times [2021-07-09 17:08:13,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:08:13,021 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853701600] [2021-07-09 17:08:13,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:08:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:08:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:08:13,150 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:08:13,150 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853701600] [2021-07-09 17:08:13,150 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853701600] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:08:13,150 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511336492] [2021-07-09 17:08:13,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:08:13,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-07-09 17:08:13,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:08:13,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjunts are in the unsatisfiable core [2021-07-09 17:08:13,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:08:13,431 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:08:13,431 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511336492] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:08:13,431 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:08:13,432 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-07-09 17:08:13,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033615766] [2021-07-09 17:08:13,432 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-07-09 17:08:13,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:08:13,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-07-09 17:08:13,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-07-09 17:08:13,433 INFO L87 Difference]: Start difference. First operand 9356 states and 26079 transitions. Second operand has 19 states, 19 states have (on average 6.842105263157895) internal successors, (130), 19 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:13,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:08:13,656 INFO L93 Difference]: Finished difference Result 9364 states and 26087 transitions. [2021-07-09 17:08:13,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-07-09 17:08:13,657 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.842105263157895) internal successors, (130), 19 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2021-07-09 17:08:13,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:08:13,675 INFO L225 Difference]: With dead ends: 9364 [2021-07-09 17:08:13,675 INFO L226 Difference]: Without dead ends: 9364 [2021-07-09 17:08:13,675 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 239.7ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-07-09 17:08:13,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9364 states. [2021-07-09 17:08:13,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9364 to 9361. [2021-07-09 17:08:13,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9361 states, 9359 states have (on average 2.7870498984934287) internal successors, (26084), 9360 states have internal predecessors, (26084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9361 states to 9361 states and 26084 transitions. [2021-07-09 17:08:13,855 INFO L78 Accepts]: Start accepts. Automaton has 9361 states and 26084 transitions. Word has length 129 [2021-07-09 17:08:13,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:08:13,855 INFO L482 AbstractCegarLoop]: Abstraction has 9361 states and 26084 transitions. [2021-07-09 17:08:13,856 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 6.842105263157895) internal successors, (130), 19 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:13,856 INFO L276 IsEmpty]: Start isEmpty. Operand 9361 states and 26084 transitions. [2021-07-09 17:08:13,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-07-09 17:08:13,865 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:08:13,865 INFO L508 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:08:14,065 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:08:14,066 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:08:14,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:08:14,066 INFO L82 PathProgramCache]: Analyzing trace with hash 111034635, now seen corresponding path program 3 times [2021-07-09 17:08:14,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:08:14,066 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418370825] [2021-07-09 17:08:14,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:08:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:08:14,307 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:08:14,307 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:08:14,310 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418370825] [2021-07-09 17:08:14,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418370825] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:08:14,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651218504] [2021-07-09 17:08:14,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:08:14,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-07-09 17:08:14,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:08:14,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core [2021-07-09 17:08:14,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:08:14,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-09 17:08:14,442 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:08:14,443 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:14,444 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:08:14,444 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-09 17:08:14,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-09 17:08:14,461 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:08:14,464 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:14,465 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:08:14,465 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-09 17:08:14,578 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-09 17:08:14,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-09 17:08:14,580 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:08:14,583 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:14,584 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:08:14,584 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-09 17:08:14,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:08:14,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:08:14,632 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:08:14,637 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:14,638 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:08:14,642 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:14,643 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:08:14,643 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-09 17:08:14,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-07-09 17:08:14,706 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:08:14,710 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:14,711 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:08:14,711 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-07-09 17:08:14,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:08:14,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:08:14,781 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:08:14,785 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:14,786 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:08:14,791 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:14,793 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:08:14,793 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-07-09 17:08:14,920 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-07-09 17:08:14,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-07-09 17:08:14,922 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:08:14,925 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:14,926 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:08:14,927 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:17 [2021-07-09 17:08:15,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-07-09 17:08:15,038 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:08:15,042 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:15,045 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-09 17:08:15,045 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2021-07-09 17:08:17,073 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (not (= (* 28 c_t_funThread1of2ForFork0_~i~0) (* 28 t_funThread2of2ForFork0_~i~0))))) is different from true [2021-07-09 17:08:17,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-07-09 17:08:17,144 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:08:17,149 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:17,152 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-07-09 17:08:17,152 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:28 [2021-07-09 17:08:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-07-09 17:08:17,271 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651218504] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:08:17,271 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:08:17,271 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2021-07-09 17:08:17,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610449587] [2021-07-09 17:08:17,272 INFO L462 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-07-09 17:08:17,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:08:17,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-07-09 17:08:17,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=989, Unknown=1, NotChecked=64, Total=1190 [2021-07-09 17:08:17,273 INFO L87 Difference]: Start difference. First operand 9361 states and 26084 transitions. Second operand has 35 states, 35 states have (on average 6.142857142857143) internal successors, (215), 35 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:21,364 WARN L205 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2021-07-09 17:08:25,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:08:25,570 INFO L93 Difference]: Finished difference Result 10469 states and 29039 transitions. [2021-07-09 17:08:25,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-07-09 17:08:25,571 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.142857142857143) internal successors, (215), 35 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2021-07-09 17:08:25,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:08:25,589 INFO L225 Difference]: With dead ends: 10469 [2021-07-09 17:08:25,589 INFO L226 Difference]: Without dead ends: 10381 [2021-07-09 17:08:25,591 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 9861.1ms TimeCoverageRelationStatistics Valid=907, Invalid=5256, Unknown=3, NotChecked=154, Total=6320 [2021-07-09 17:08:25,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10381 states. [2021-07-09 17:08:25,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10381 to 10202. [2021-07-09 17:08:25,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10202 states, 10200 states have (on average 2.776764705882353) internal successors, (28323), 10201 states have internal predecessors, (28323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10202 states to 10202 states and 28323 transitions. [2021-07-09 17:08:25,777 INFO L78 Accepts]: Start accepts. Automaton has 10202 states and 28323 transitions. Word has length 134 [2021-07-09 17:08:25,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:08:25,777 INFO L482 AbstractCegarLoop]: Abstraction has 10202 states and 28323 transitions. [2021-07-09 17:08:25,777 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 6.142857142857143) internal successors, (215), 35 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:25,777 INFO L276 IsEmpty]: Start isEmpty. Operand 10202 states and 28323 transitions. [2021-07-09 17:08:25,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-07-09 17:08:25,788 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:08:25,788 INFO L508 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:08:25,988 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:08:25,989 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:08:25,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:08:25,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1100044920, now seen corresponding path program 4 times [2021-07-09 17:08:25,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:08:25,989 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603554959] [2021-07-09 17:08:25,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:08:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:08:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:08:26,272 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:08:26,272 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603554959] [2021-07-09 17:08:26,272 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603554959] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:08:26,272 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879579656] [2021-07-09 17:08:26,272 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:08:26,371 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-07-09 17:08:26,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:08:26,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 20 conjunts are in the unsatisfiable core [2021-07-09 17:08:26,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:08:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-07-09 17:08:26,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879579656] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:08:26,562 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:08:26,562 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-07-09 17:08:26,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518977081] [2021-07-09 17:08:26,562 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-07-09 17:08:26,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:08:26,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-07-09 17:08:26,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-07-09 17:08:26,563 INFO L87 Difference]: Start difference. First operand 10202 states and 28323 transitions. Second operand has 23 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:08:26,839 INFO L93 Difference]: Finished difference Result 10207 states and 28328 transitions. [2021-07-09 17:08:26,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-07-09 17:08:26,839 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2021-07-09 17:08:26,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:08:26,855 INFO L225 Difference]: With dead ends: 10207 [2021-07-09 17:08:26,855 INFO L226 Difference]: Without dead ends: 10207 [2021-07-09 17:08:26,856 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 437.8ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-07-09 17:08:26,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10207 states. [2021-07-09 17:08:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10207 to 10207. [2021-07-09 17:08:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10207 states, 10205 states have (on average 2.7758941695247428) internal successors, (28328), 10206 states have internal predecessors, (28328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:27,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10207 states to 10207 states and 28328 transitions. [2021-07-09 17:08:27,031 INFO L78 Accepts]: Start accepts. Automaton has 10207 states and 28328 transitions. Word has length 139 [2021-07-09 17:08:27,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:08:27,031 INFO L482 AbstractCegarLoop]: Abstraction has 10207 states and 28328 transitions. [2021-07-09 17:08:27,032 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:08:27,032 INFO L276 IsEmpty]: Start isEmpty. Operand 10207 states and 28328 transitions. [2021-07-09 17:08:27,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-07-09 17:08:27,044 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:08:27,044 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:08:27,249 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:08:27,249 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:08:27,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:08:27,249 INFO L82 PathProgramCache]: Analyzing trace with hash 511490273, now seen corresponding path program 5 times [2021-07-09 17:08:27,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:08:27,249 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531135318] [2021-07-09 17:08:27,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:08:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:08:27,687 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2021-07-09 17:08:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-09 17:08:28,051 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:08:28,051 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531135318] [2021-07-09 17:08:28,051 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531135318] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:08:28,051 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784267623] [2021-07-09 17:08:28,051 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:08:28,211 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-07-09 17:08:28,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:08:28,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 31 conjunts are in the unsatisfiable core [2021-07-09 17:08:28,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:08:28,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-09 17:08:28,239 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:08:28,240 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:28,241 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:08:28,241 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-09 17:08:28,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-09 17:08:28,249 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:08:28,252 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:28,253 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:08:28,253 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-09 17:08:28,365 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-09 17:08:28,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-09 17:08:28,367 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:08:28,371 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:28,372 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:08:28,372 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-09 17:08:28,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:08:28,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:08:28,395 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:08:28,399 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:28,400 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:08:28,405 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:28,407 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:08:28,407 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-09 17:08:28,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-07-09 17:08:28,473 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:08:28,478 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:28,479 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:08:28,479 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-07-09 17:08:28,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:08:28,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:08:28,549 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:08:28,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:28,555 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:08:28,562 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:28,564 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:08:28,564 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-07-09 17:08:28,724 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-07-09 17:08:28,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-07-09 17:08:28,727 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:08:28,731 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:28,732 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:08:28,732 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:17 [2021-07-09 17:08:28,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-07-09 17:08:28,869 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:08:28,874 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:28,876 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-09 17:08:28,877 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2021-07-09 17:08:30,906 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (not (= (* 28 c_t_funThread1of2ForFork0_~i~0) (* 28 t_funThread2of2ForFork0_~i~0))))) is different from true [2021-07-09 17:08:30,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-07-09 17:08:30,970 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:08:30,975 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:08:30,978 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-07-09 17:08:30,978 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:28 [2021-07-09 17:08:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-09 17:08:31,945 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784267623] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:08:31,945 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:08:31,945 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 35 [2021-07-09 17:08:31,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094732230] [2021-07-09 17:08:31,945 INFO L462 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-07-09 17:08:31,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:08:31,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-07-09 17:08:31,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1006, Unknown=2, NotChecked=64, Total=1190 [2021-07-09 17:08:31,946 INFO L87 Difference]: Start difference. First operand 10207 states and 28328 transitions. Second operand has 35 states, 35 states have (on average 4.485714285714286) internal successors, (157), 35 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:12:03,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:12:03,449 INFO L93 Difference]: Finished difference Result 12789 states and 35189 transitions. [2021-07-09 17:12:03,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-07-09 17:12:03,458 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.485714285714286) internal successors, (157), 35 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-07-09 17:12:03,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:12:03,477 INFO L225 Difference]: With dead ends: 12789 [2021-07-09 17:12:03,477 INFO L226 Difference]: Without dead ends: 11737 [2021-07-09 17:12:03,479 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1619 ImplicationChecksByTransitivity, 46764.2ms TimeCoverageRelationStatistics Valid=796, Invalid=5341, Unknown=29, NotChecked=154, Total=6320 [2021-07-09 17:12:03,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11737 states. [2021-07-09 17:12:03,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11737 to 10994. [2021-07-09 17:12:03,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10994 states, 10992 states have (on average 2.7736535662299855) internal successors, (30488), 10993 states have internal predecessors, (30488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:12:03,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10994 states to 10994 states and 30488 transitions. [2021-07-09 17:12:03,670 INFO L78 Accepts]: Start accepts. Automaton has 10994 states and 30488 transitions. Word has length 144 [2021-07-09 17:12:03,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:12:03,670 INFO L482 AbstractCegarLoop]: Abstraction has 10994 states and 30488 transitions. [2021-07-09 17:12:03,670 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 4.485714285714286) internal successors, (157), 35 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:12:03,671 INFO L276 IsEmpty]: Start isEmpty. Operand 10994 states and 30488 transitions. [2021-07-09 17:12:03,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-07-09 17:12:03,685 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:12:03,685 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:12:03,885 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-07-09 17:12:03,886 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:12:03,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:12:03,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1093189177, now seen corresponding path program 6 times [2021-07-09 17:12:03,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:12:03,886 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493932099] [2021-07-09 17:12:03,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:12:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:12:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-09 17:12:04,233 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:12:04,233 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493932099] [2021-07-09 17:12:04,233 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493932099] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:12:04,233 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856493619] [2021-07-09 17:12:04,233 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:12:04,320 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-07-09 17:12:04,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:12:04,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 31 conjunts are in the unsatisfiable core [2021-07-09 17:12:04,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:12:04,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-09 17:12:04,353 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:04,354 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:04,355 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:04,355 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-09 17:12:04,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-09 17:12:04,363 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:04,366 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:04,367 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:04,367 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-09 17:12:04,506 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-09 17:12:04,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-09 17:12:04,509 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:04,513 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:04,514 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:04,514 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-09 17:12:04,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:12:04,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:12:04,537 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:04,541 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:04,542 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:04,548 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:04,550 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:04,550 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-09 17:12:04,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-07-09 17:12:04,592 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:04,601 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:04,603 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-09 17:12:04,603 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2021-07-09 17:12:04,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:12:04,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:12:04,655 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:04,660 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:04,660 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:04,668 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:04,670 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:04,670 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-07-09 17:12:04,730 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-07-09 17:12:04,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-07-09 17:12:04,732 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:04,736 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:04,737 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:04,737 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2021-07-09 17:12:04,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-07-09 17:12:04,819 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:04,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-07-09 17:12:04,824 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:04,835 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:04,839 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-07-09 17:12:04,840 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:41 [2021-07-09 17:12:05,653 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (<= (+ |c_t_funThread1of2ForFork0_#t~post35| 2) t_funThread2of2ForFork0_~i~0))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* v_prenex_1 28) |c_~#a~0.offset|) (+ v_prenex_2 1))) (<= v_prenex_1 |c_t_funThread1of2ForFork0_#t~post35|)))) is different from true [2021-07-09 17:12:06,454 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (<= (+ c_t_funThread1of2ForFork0_~i~0 1) t_funThread2of2ForFork0_~i~0))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* v_prenex_1 28) |c_~#a~0.offset|) (+ v_prenex_2 1))) (<= (+ v_prenex_1 1) c_t_funThread1of2ForFork0_~i~0)))) is different from true [2021-07-09 17:12:06,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-07-09 17:12:06,585 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:06,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-07-09 17:12:06,590 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:06,603 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:06,608 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2021-07-09 17:12:06,608 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:65, output treesize:51 [2021-07-09 17:12:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-09 17:12:06,699 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856493619] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:12:06,699 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:12:06,699 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 23 [2021-07-09 17:12:06,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240671573] [2021-07-09 17:12:06,699 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-07-09 17:12:06,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:12:06,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-07-09 17:12:06,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=354, Unknown=2, NotChecked=78, Total=506 [2021-07-09 17:12:06,700 INFO L87 Difference]: Start difference. First operand 10994 states and 30488 transitions. Second operand has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:12:11,658 WARN L205 SmtUtils]: Spent 3.69 s on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2021-07-09 17:12:21,964 WARN L205 SmtUtils]: Spent 8.03 s on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-07-09 17:12:31,210 WARN L205 SmtUtils]: Spent 6.50 s on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2021-07-09 17:12:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:12:34,512 INFO L93 Difference]: Finished difference Result 12759 states and 35346 transitions. [2021-07-09 17:12:34,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-07-09 17:12:34,513 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-07-09 17:12:34,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:12:34,544 INFO L225 Difference]: With dead ends: 12759 [2021-07-09 17:12:34,545 INFO L226 Difference]: Without dead ends: 12643 [2021-07-09 17:12:34,546 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 137 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 28997.0ms TimeCoverageRelationStatistics Valid=600, Invalid=2153, Unknown=11, NotChecked=206, Total=2970 [2021-07-09 17:12:34,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12643 states. [2021-07-09 17:12:34,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12643 to 11478. [2021-07-09 17:12:34,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11478 states, 11476 states have (on average 2.776141512722203) internal successors, (31859), 11477 states have internal predecessors, (31859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:12:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11478 states to 11478 states and 31859 transitions. [2021-07-09 17:12:34,813 INFO L78 Accepts]: Start accepts. Automaton has 11478 states and 31859 transitions. Word has length 144 [2021-07-09 17:12:34,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:12:34,814 INFO L482 AbstractCegarLoop]: Abstraction has 11478 states and 31859 transitions. [2021-07-09 17:12:34,814 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:12:34,814 INFO L276 IsEmpty]: Start isEmpty. Operand 11478 states and 31859 transitions. [2021-07-09 17:12:34,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-07-09 17:12:34,828 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:12:34,828 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:12:35,044 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-07-09 17:12:35,045 INFO L430 AbstractCegarLoop]: === Iteration 16 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:12:35,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:12:35,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1416498105, now seen corresponding path program 7 times [2021-07-09 17:12:35,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:12:35,045 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534113079] [2021-07-09 17:12:35,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:12:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:12:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-09 17:12:35,349 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:12:35,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534113079] [2021-07-09 17:12:35,349 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534113079] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:12:35,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269315350] [2021-07-09 17:12:35,349 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:12:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:12:35,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 31 conjunts are in the unsatisfiable core [2021-07-09 17:12:35,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:12:35,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-09 17:12:35,457 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:35,458 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:35,459 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:35,459 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-09 17:12:35,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-09 17:12:35,465 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:35,468 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:35,468 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:35,469 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-09 17:12:35,581 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-09 17:12:35,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-09 17:12:35,583 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:35,587 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:35,588 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:35,588 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-09 17:12:35,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:12:35,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:12:35,609 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:35,614 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:35,614 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:35,620 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:35,621 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:35,621 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-09 17:12:35,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-07-09 17:12:35,662 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:35,672 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:35,674 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-09 17:12:35,674 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2021-07-09 17:12:35,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:12:35,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:12:35,722 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:35,727 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:35,728 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:35,736 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:35,737 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:35,737 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-07-09 17:12:35,798 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-07-09 17:12:35,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-07-09 17:12:35,800 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:35,805 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:35,805 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:35,806 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2021-07-09 17:12:35,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-07-09 17:12:35,895 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:35,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-07-09 17:12:35,900 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:35,911 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:35,915 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-07-09 17:12:35,915 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:43 [2021-07-09 17:12:36,683 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (<= (+ c_t_funThread1of2ForFork0_~i~0 1) t_funThread2of2ForFork0_~i~0))) (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (and (= (store ((as const (Array Int Int)) 0) (+ (* v_prenex_5 28) |c_~#a~0.offset|) (+ v_prenex_6 1)) (select |c_#memory_int| |c_~#a~0.base|)) (<= (+ v_prenex_5 1) c_t_funThread1of2ForFork0_~i~0)))) is different from true [2021-07-09 17:12:36,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-07-09 17:12:36,817 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:36,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-07-09 17:12:36,822 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:36,835 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:36,839 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2021-07-09 17:12:36,839 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:65, output treesize:51 [2021-07-09 17:12:36,929 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-09 17:12:36,929 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269315350] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:12:36,929 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:12:36,930 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 23 [2021-07-09 17:12:36,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612411923] [2021-07-09 17:12:36,930 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-07-09 17:12:36,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:12:36,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-07-09 17:12:36,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=400, Unknown=1, NotChecked=40, Total=506 [2021-07-09 17:12:36,931 INFO L87 Difference]: Start difference. First operand 11478 states and 31859 transitions. Second operand has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:12:43,498 WARN L205 SmtUtils]: Spent 5.27 s on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2021-07-09 17:12:46,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:12:46,911 INFO L93 Difference]: Finished difference Result 14397 states and 39688 transitions. [2021-07-09 17:12:46,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-07-09 17:12:46,911 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-07-09 17:12:46,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:12:46,934 INFO L225 Difference]: With dead ends: 14397 [2021-07-09 17:12:46,934 INFO L226 Difference]: Without dead ends: 13581 [2021-07-09 17:12:46,935 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 137 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 10379.4ms TimeCoverageRelationStatistics Valid=483, Invalid=2272, Unknown=5, NotChecked=102, Total=2862 [2021-07-09 17:12:46,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13581 states. [2021-07-09 17:12:47,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13581 to 12846. [2021-07-09 17:12:47,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12846 states, 12844 states have (on average 2.776315789473684) internal successors, (35659), 12845 states have internal predecessors, (35659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:12:47,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12846 states to 12846 states and 35659 transitions. [2021-07-09 17:12:47,159 INFO L78 Accepts]: Start accepts. Automaton has 12846 states and 35659 transitions. Word has length 144 [2021-07-09 17:12:47,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:12:47,160 INFO L482 AbstractCegarLoop]: Abstraction has 12846 states and 35659 transitions. [2021-07-09 17:12:47,160 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:12:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand 12846 states and 35659 transitions. [2021-07-09 17:12:47,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-07-09 17:12:47,171 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:12:47,172 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:12:47,372 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-07-09 17:12:47,372 INFO L430 AbstractCegarLoop]: === Iteration 17 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:12:47,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:12:47,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1457767975, now seen corresponding path program 8 times [2021-07-09 17:12:47,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:12:47,373 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804959463] [2021-07-09 17:12:47,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:12:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:12:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-09 17:12:47,694 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:12:47,694 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804959463] [2021-07-09 17:12:47,695 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804959463] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:12:47,695 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126325091] [2021-07-09 17:12:47,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:12:47,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-07-09 17:12:47,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:12:47,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 31 conjunts are in the unsatisfiable core [2021-07-09 17:12:47,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:12:47,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-09 17:12:47,848 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:47,850 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:47,850 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:47,850 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-09 17:12:47,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-09 17:12:47,858 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:47,862 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:47,863 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:47,863 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-09 17:12:47,963 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-09 17:12:47,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-09 17:12:47,966 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:47,970 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:47,970 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:47,970 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-09 17:12:47,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:12:47,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:12:47,992 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:47,996 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:47,997 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:48,003 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:48,004 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:48,004 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-09 17:12:48,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-07-09 17:12:48,041 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:48,050 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:48,052 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-09 17:12:48,052 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2021-07-09 17:12:48,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:12:48,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:12:48,102 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:48,107 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:48,108 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:48,115 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:48,122 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:48,122 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-07-09 17:12:48,189 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-07-09 17:12:48,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-07-09 17:12:48,191 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:48,196 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:48,197 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:12:48,197 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2021-07-09 17:12:48,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-07-09 17:12:48,302 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:48,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-07-09 17:12:48,307 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:48,319 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:48,323 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-07-09 17:12:48,323 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:43 [2021-07-09 17:12:49,155 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (<= (+ c_t_funThread1of2ForFork0_~i~0 1) t_funThread2of2ForFork0_~i~0))) (exists ((v_prenex_10 Int) (v_prenex_9 Int)) (and (= (store ((as const (Array Int Int)) 0) (+ |c_~#a~0.offset| (* v_prenex_9 28)) (+ v_prenex_10 1)) (select |c_#memory_int| |c_~#a~0.base|)) (<= (+ v_prenex_9 1) c_t_funThread1of2ForFork0_~i~0)))) is different from true [2021-07-09 17:12:49,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-07-09 17:12:49,280 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:49,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-07-09 17:12:49,285 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:12:49,297 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:12:49,301 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2021-07-09 17:12:49,301 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:65, output treesize:51 [2021-07-09 17:12:49,385 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-09 17:12:49,386 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126325091] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:12:49,386 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:12:49,386 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2021-07-09 17:12:49,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84958051] [2021-07-09 17:12:49,387 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-07-09 17:12:49,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:12:49,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-07-09 17:12:49,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=440, Unknown=1, NotChecked=42, Total=552 [2021-07-09 17:12:49,387 INFO L87 Difference]: Start difference. First operand 12846 states and 35659 transitions. Second operand has 24 states, 24 states have (on average 5.291666666666667) internal successors, (127), 24 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:12:57,247 WARN L205 SmtUtils]: Spent 6.53 s on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2021-07-09 17:13:00,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:13:00,668 INFO L93 Difference]: Finished difference Result 15721 states and 43349 transitions. [2021-07-09 17:13:00,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-07-09 17:13:00,668 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.291666666666667) internal successors, (127), 24 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-07-09 17:13:00,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:13:00,692 INFO L225 Difference]: With dead ends: 15721 [2021-07-09 17:13:00,693 INFO L226 Difference]: Without dead ends: 14895 [2021-07-09 17:13:00,694 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 136 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 11756.3ms TimeCoverageRelationStatistics Valid=522, Invalid=2557, Unknown=5, NotChecked=108, Total=3192 [2021-07-09 17:13:00,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14895 states. [2021-07-09 17:13:00,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14895 to 12891. [2021-07-09 17:13:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12891 states, 12889 states have (on average 2.775855380557064) internal successors, (35778), 12890 states have internal predecessors, (35778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:13:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12891 states to 12891 states and 35778 transitions. [2021-07-09 17:13:00,929 INFO L78 Accepts]: Start accepts. Automaton has 12891 states and 35778 transitions. Word has length 144 [2021-07-09 17:13:00,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:13:00,929 INFO L482 AbstractCegarLoop]: Abstraction has 12891 states and 35778 transitions. [2021-07-09 17:13:00,929 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 5.291666666666667) internal successors, (127), 24 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:13:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 12891 states and 35778 transitions. [2021-07-09 17:13:00,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-07-09 17:13:00,941 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:13:00,941 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:13:01,142 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:13:01,142 INFO L430 AbstractCegarLoop]: === Iteration 18 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:13:01,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:13:01,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1729739729, now seen corresponding path program 9 times [2021-07-09 17:13:01,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:13:01,143 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888628627] [2021-07-09 17:13:01,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:13:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:13:01,459 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-09 17:13:01,459 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:13:01,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888628627] [2021-07-09 17:13:01,459 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888628627] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:13:01,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793695572] [2021-07-09 17:13:01,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:13:01,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-07-09 17:13:01,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:13:01,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core [2021-07-09 17:13:01,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:13:01,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-09 17:13:01,572 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:13:01,574 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:01,575 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:13:01,575 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-09 17:13:01,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-09 17:13:01,582 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:13:01,585 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:01,586 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:13:01,586 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-09 17:13:01,694 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-09 17:13:01,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-09 17:13:01,696 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:13:01,699 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:01,700 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:13:01,700 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-09 17:13:01,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:13:01,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:13:01,719 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:13:01,723 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:01,724 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:13:01,729 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:01,730 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:13:01,730 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-09 17:13:01,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-07-09 17:13:01,764 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:13:01,772 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:01,774 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-09 17:13:01,774 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2021-07-09 17:13:01,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:13:01,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:13:01,825 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:13:01,830 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:01,831 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:13:01,840 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:01,842 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:13:01,842 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-07-09 17:13:01,901 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-07-09 17:13:01,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-07-09 17:13:01,903 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:13:01,906 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:01,907 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:13:01,907 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2021-07-09 17:13:02,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-07-09 17:13:02,063 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:13:02,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-07-09 17:13:02,070 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:13:02,083 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:02,087 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-07-09 17:13:02,087 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:43 [2021-07-09 17:13:02,869 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (<= (+ c_t_funThread1of2ForFork0_~i~0 1) t_funThread2of2ForFork0_~i~0))) (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* v_prenex_13 28) |c_~#a~0.offset|) (+ v_prenex_14 1))) (<= (+ v_prenex_13 1) c_t_funThread1of2ForFork0_~i~0)))) is different from true [2021-07-09 17:13:03,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-07-09 17:13:03,010 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:13:03,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-07-09 17:13:03,015 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:13:03,026 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:03,032 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2021-07-09 17:13:03,032 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:65, output treesize:51 [2021-07-09 17:13:03,106 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-09 17:13:03,106 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793695572] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:13:03,106 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:13:03,106 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 25 [2021-07-09 17:13:03,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026695514] [2021-07-09 17:13:03,107 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-07-09 17:13:03,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:13:03,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-07-09 17:13:03,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=482, Unknown=1, NotChecked=44, Total=600 [2021-07-09 17:13:03,108 INFO L87 Difference]: Start difference. First operand 12891 states and 35778 transitions. Second operand has 25 states, 25 states have (on average 5.12) internal successors, (128), 25 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:13:08,700 WARN L205 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2021-07-09 17:13:12,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:13:12,171 INFO L93 Difference]: Finished difference Result 15865 states and 43734 transitions. [2021-07-09 17:13:12,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-07-09 17:13:12,172 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.12) internal successors, (128), 25 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-07-09 17:13:12,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:13:12,196 INFO L225 Difference]: With dead ends: 15865 [2021-07-09 17:13:12,197 INFO L226 Difference]: Without dead ends: 15019 [2021-07-09 17:13:12,198 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 135 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 9498.0ms TimeCoverageRelationStatistics Valid=456, Invalid=2405, Unknown=5, NotChecked=104, Total=2970 [2021-07-09 17:13:12,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15019 states. [2021-07-09 17:13:12,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15019 to 12981. [2021-07-09 17:13:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12981 states, 12979 states have (on average 2.7749441405347097) internal successors, (36016), 12980 states have internal predecessors, (36016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:13:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12981 states to 12981 states and 36016 transitions. [2021-07-09 17:13:12,484 INFO L78 Accepts]: Start accepts. Automaton has 12981 states and 36016 transitions. Word has length 144 [2021-07-09 17:13:12,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:13:12,484 INFO L482 AbstractCegarLoop]: Abstraction has 12981 states and 36016 transitions. [2021-07-09 17:13:12,484 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 5.12) internal successors, (128), 25 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:13:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 12981 states and 36016 transitions. [2021-07-09 17:13:12,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-07-09 17:13:12,499 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:13:12,500 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:13:12,700 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-07-09 17:13:12,700 INFO L430 AbstractCegarLoop]: === Iteration 19 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:13:12,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:13:12,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1237782157, now seen corresponding path program 10 times [2021-07-09 17:13:12,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:13:12,701 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753675135] [2021-07-09 17:13:12,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:13:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:13:15,317 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 233 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-07-09 17:13:15,317 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:13:15,317 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753675135] [2021-07-09 17:13:15,318 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753675135] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:13:15,318 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456757740] [2021-07-09 17:13:15,318 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:13:15,439 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-07-09 17:13:15,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:13:15,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 31 conjunts are in the unsatisfiable core [2021-07-09 17:13:15,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:13:15,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-09 17:13:15,471 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:13:15,473 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:15,474 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:13:15,474 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-09 17:13:15,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-09 17:13:15,497 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:13:15,502 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:15,503 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:13:15,503 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-09 17:13:15,695 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2021-07-09 17:13:15,749 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-09 17:13:15,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-09 17:13:15,751 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:13:15,755 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:15,756 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:13:15,756 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-09 17:13:15,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:13:15,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:13:15,798 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:13:15,801 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:15,802 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:13:15,806 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:15,807 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:13:15,807 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-09 17:13:15,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-07-09 17:13:15,868 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:13:15,873 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:15,876 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:13:15,876 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-07-09 17:13:15,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:13:15,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:13:15,937 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:13:15,941 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:15,942 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:13:15,948 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:15,949 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:13:15,949 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-07-09 17:13:16,103 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-07-09 17:13:16,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-07-09 17:13:16,105 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:13:16,109 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:16,109 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:13:16,109 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:17 [2021-07-09 17:13:16,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-07-09 17:13:16,233 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:13:16,239 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:16,241 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-09 17:13:16,241 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2021-07-09 17:13:18,262 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (not (= (* 28 c_t_funThread1of2ForFork0_~i~0) (* 28 t_funThread2of2ForFork0_~i~0))))) is different from true [2021-07-09 17:13:18,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-07-09 17:13:18,335 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:13:18,340 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:13:18,343 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-07-09 17:13:18,343 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:28 [2021-07-09 17:13:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-09 17:13:19,410 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456757740] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:13:19,411 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:13:19,411 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 18] total 56 [2021-07-09 17:13:19,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158308280] [2021-07-09 17:13:19,411 INFO L462 AbstractCegarLoop]: Interpolant automaton has 56 states [2021-07-09 17:13:19,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:13:19,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-07-09 17:13:19,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=2649, Unknown=2, NotChecked=106, Total=3080 [2021-07-09 17:13:19,413 INFO L87 Difference]: Start difference. First operand 12981 states and 36016 transitions. Second operand has 56 states, 56 states have (on average 4.160714285714286) internal successors, (233), 56 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:15:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:15:19,719 INFO L93 Difference]: Finished difference Result 15756 states and 43361 transitions. [2021-07-09 17:15:19,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-07-09 17:15:19,719 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 4.160714285714286) internal successors, (233), 56 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-07-09 17:15:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:15:19,746 INFO L225 Difference]: With dead ends: 15756 [2021-07-09 17:15:19,746 INFO L226 Difference]: Without dead ends: 14804 [2021-07-09 17:15:19,749 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 132 SyntacticMatches, 4 SemanticMatches, 107 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3289 ImplicationChecksByTransitivity, 38323.9ms TimeCoverageRelationStatistics Valid=1218, Invalid=10319, Unknown=23, NotChecked=212, Total=11772 [2021-07-09 17:15:19,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14804 states. [2021-07-09 17:15:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14804 to 13026. [2021-07-09 17:15:19,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13026 states, 13024 states have (on average 2.7744932432432434) internal successors, (36135), 13025 states have internal predecessors, (36135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:15:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13026 states to 13026 states and 36135 transitions. [2021-07-09 17:15:19,996 INFO L78 Accepts]: Start accepts. Automaton has 13026 states and 36135 transitions. Word has length 144 [2021-07-09 17:15:19,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:15:19,997 INFO L482 AbstractCegarLoop]: Abstraction has 13026 states and 36135 transitions. [2021-07-09 17:15:19,997 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 56 states, 56 states have (on average 4.160714285714286) internal successors, (233), 56 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:15:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 13026 states and 36135 transitions. [2021-07-09 17:15:20,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-07-09 17:15:20,011 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:15:20,011 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:15:20,211 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:15:20,211 INFO L430 AbstractCegarLoop]: === Iteration 20 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:15:20,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:15:20,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1451804471, now seen corresponding path program 11 times [2021-07-09 17:15:20,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:15:20,212 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216545337] [2021-07-09 17:15:20,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:15:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:15:22,982 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 233 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-07-09 17:15:22,982 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:15:22,982 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216545337] [2021-07-09 17:15:22,982 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216545337] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:15:22,982 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225668547] [2021-07-09 17:15:22,982 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:15:23,099 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-07-09 17:15:23,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:15:23,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 31 conjunts are in the unsatisfiable core [2021-07-09 17:15:23,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:15:23,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-09 17:15:23,128 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:15:23,129 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:23,129 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:15:23,129 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-09 17:15:23,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-09 17:15:23,150 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:15:23,153 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:23,154 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:15:23,154 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-09 17:15:23,257 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-09 17:15:23,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-09 17:15:23,259 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:15:23,262 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:23,262 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:15:23,262 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-09 17:15:23,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:15:23,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:15:23,309 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:15:23,314 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:23,314 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:15:23,320 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:23,322 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:15:23,322 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-09 17:15:23,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-07-09 17:15:23,381 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:15:23,385 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:23,386 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:15:23,386 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-07-09 17:15:23,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:15:23,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:15:23,444 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:15:23,448 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:23,449 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:15:23,455 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:23,456 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:15:23,456 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-07-09 17:15:23,558 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-07-09 17:15:23,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-07-09 17:15:23,559 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:15:23,563 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:23,564 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:15:23,564 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2021-07-09 17:15:23,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-07-09 17:15:23,693 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:15:23,697 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:23,699 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-09 17:15:23,699 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:26 [2021-07-09 17:15:24,201 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (not (= (* 28 t_funThread2of2ForFork0_~i~0) (+ (* 28 c_t_funThread1of2ForFork0_~i~0) 28))))) is different from true [2021-07-09 17:15:24,750 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (not (= (* 28 t_funThread2of2ForFork0_~i~0) (+ (* 28 |c_t_funThread1of2ForFork0_#t~post35|) 28))) (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))))) is different from true [2021-07-09 17:15:26,777 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (not (= (* 28 c_t_funThread1of2ForFork0_~i~0) (* 28 t_funThread2of2ForFork0_~i~0))))) is different from true [2021-07-09 17:15:26,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-07-09 17:15:26,838 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:15:26,843 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:26,846 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-07-09 17:15:26,846 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:28 [2021-07-09 17:15:28,043 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-09 17:15:28,043 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225668547] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:15:28,043 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:15:28,043 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 18] total 58 [2021-07-09 17:15:28,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546420361] [2021-07-09 17:15:28,044 INFO L462 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-07-09 17:15:28,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:15:28,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-07-09 17:15:28,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2604, Unknown=4, NotChecked=324, Total=3306 [2021-07-09 17:15:28,045 INFO L87 Difference]: Start difference. First operand 13026 states and 36135 transitions. Second operand has 58 states, 58 states have (on average 4.017241379310345) internal successors, (233), 58 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:15:32,796 WARN L205 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 53 DAG size of output: 30 [2021-07-09 17:15:35,434 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2021-07-09 17:15:40,783 WARN L205 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2021-07-09 17:15:46,214 WARN L205 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2021-07-09 17:16:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:16:33,135 INFO L93 Difference]: Finished difference Result 15018 states and 41630 transitions. [2021-07-09 17:16:33,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-07-09 17:16:33,135 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 4.017241379310345) internal successors, (233), 58 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-07-09 17:16:33,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:16:33,159 INFO L225 Difference]: With dead ends: 15018 [2021-07-09 17:16:33,160 INFO L226 Difference]: Without dead ends: 14820 [2021-07-09 17:16:33,161 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3484 ImplicationChecksByTransitivity, 36634.8ms TimeCoverageRelationStatistics Valid=1516, Invalid=9186, Unknown=22, NotChecked=618, Total=11342 [2021-07-09 17:16:33,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14820 states. [2021-07-09 17:16:33,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14820 to 13914. [2021-07-09 17:16:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13914 states, 13912 states have (on average 2.779470960322024) internal successors, (38668), 13913 states have internal predecessors, (38668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:16:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13914 states to 13914 states and 38668 transitions. [2021-07-09 17:16:33,411 INFO L78 Accepts]: Start accepts. Automaton has 13914 states and 38668 transitions. Word has length 144 [2021-07-09 17:16:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:16:33,412 INFO L482 AbstractCegarLoop]: Abstraction has 13914 states and 38668 transitions. [2021-07-09 17:16:33,413 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 58 states, 58 states have (on average 4.017241379310345) internal successors, (233), 58 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:16:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 13914 states and 38668 transitions. [2021-07-09 17:16:33,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-07-09 17:16:33,427 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:16:33,427 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:16:33,628 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:16:33,628 INFO L430 AbstractCegarLoop]: === Iteration 21 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:16:33,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:16:33,628 INFO L82 PathProgramCache]: Analyzing trace with hash 561925277, now seen corresponding path program 12 times [2021-07-09 17:16:33,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:16:33,628 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214227802] [2021-07-09 17:16:33,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:16:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:16:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 233 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-07-09 17:16:36,167 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:16:36,167 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214227802] [2021-07-09 17:16:36,167 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214227802] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:16:36,167 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749556652] [2021-07-09 17:16:36,167 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:16:36,257 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-07-09 17:16:36,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:16:36,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 31 conjunts are in the unsatisfiable core [2021-07-09 17:16:36,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:16:36,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-09 17:16:36,280 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:16:36,281 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:36,282 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:16:36,282 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-09 17:16:36,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-09 17:16:36,303 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:16:36,306 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:36,307 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:16:36,307 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-09 17:16:36,421 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-09 17:16:36,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-09 17:16:36,423 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:16:36,426 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:36,427 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:16:36,427 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-09 17:16:36,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:16:36,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:16:36,471 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:16:36,475 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:36,475 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:16:36,480 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:36,481 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:16:36,481 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-09 17:16:36,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-07-09 17:16:36,537 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:16:36,542 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:36,542 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:16:36,542 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-07-09 17:16:36,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:16:36,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:16:36,601 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:16:36,605 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:36,606 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:16:36,612 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:36,613 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:16:36,613 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-07-09 17:16:36,706 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-07-09 17:16:36,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-07-09 17:16:36,708 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:16:36,711 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:36,712 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:16:36,712 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2021-07-09 17:16:36,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-07-09 17:16:36,887 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:16:36,891 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:36,894 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-09 17:16:36,894 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:26 [2021-07-09 17:16:37,418 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (not (= (* 28 t_funThread2of2ForFork0_~i~0) (+ (* 28 |c_t_funThread1of2ForFork0_#t~post35|) 28))) (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))))) is different from true [2021-07-09 17:16:39,450 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (not (= (* 28 c_t_funThread1of2ForFork0_~i~0) (* 28 t_funThread2of2ForFork0_~i~0))))) is different from true [2021-07-09 17:16:39,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-07-09 17:16:39,509 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:16:39,514 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:39,516 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-07-09 17:16:39,517 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:28 [2021-07-09 17:16:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-09 17:16:40,567 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749556652] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:16:40,567 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:16:40,567 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 18] total 58 [2021-07-09 17:16:40,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655811195] [2021-07-09 17:16:40,567 INFO L462 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-07-09 17:16:40,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:16:40,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-07-09 17:16:40,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=2736, Unknown=3, NotChecked=218, Total=3306 [2021-07-09 17:16:40,568 INFO L87 Difference]: Start difference. First operand 13914 states and 38668 transitions. Second operand has 58 states, 58 states have (on average 4.017241379310345) internal successors, (233), 58 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:16:45,906 WARN L205 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 53 DAG size of output: 30 [2021-07-09 17:16:51,305 WARN L205 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2021-07-09 17:16:53,761 WARN L205 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2021-07-09 17:16:58,724 WARN L205 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2021-07-09 17:19:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:19:13,886 INFO L93 Difference]: Finished difference Result 15881 states and 43982 transitions. [2021-07-09 17:19:13,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-07-09 17:19:13,896 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 4.017241379310345) internal successors, (233), 58 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-07-09 17:19:13,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:19:13,923 INFO L225 Difference]: With dead ends: 15881 [2021-07-09 17:19:13,923 INFO L226 Difference]: Without dead ends: 15665 [2021-07-09 17:19:13,925 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3686 ImplicationChecksByTransitivity, 61893.3ms TimeCoverageRelationStatistics Valid=1649, Invalid=10312, Unknown=37, NotChecked=434, Total=12432 [2021-07-09 17:19:13,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15665 states. [2021-07-09 17:19:14,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15665 to 14574. [2021-07-09 17:19:14,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14574 states, 14572 states have (on average 2.777793027724403) internal successors, (40478), 14573 states have internal predecessors, (40478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:19:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14574 states to 14574 states and 40478 transitions. [2021-07-09 17:19:14,188 INFO L78 Accepts]: Start accepts. Automaton has 14574 states and 40478 transitions. Word has length 144 [2021-07-09 17:19:14,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:19:14,188 INFO L482 AbstractCegarLoop]: Abstraction has 14574 states and 40478 transitions. [2021-07-09 17:19:14,188 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 58 states, 58 states have (on average 4.017241379310345) internal successors, (233), 58 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:19:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand 14574 states and 40478 transitions. [2021-07-09 17:19:14,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-07-09 17:19:14,204 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:19:14,204 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:19:14,404 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2021-07-09 17:19:14,405 INFO L430 AbstractCegarLoop]: === Iteration 22 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:19:14,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:19:14,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1272475267, now seen corresponding path program 13 times [2021-07-09 17:19:14,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:19:14,405 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915371543] [2021-07-09 17:19:14,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:19:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:19:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 233 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-07-09 17:19:16,950 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:19:16,950 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915371543] [2021-07-09 17:19:16,950 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915371543] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:19:16,950 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836447241] [2021-07-09 17:19:16,950 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:19:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:19:17,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 31 conjunts are in the unsatisfiable core [2021-07-09 17:19:17,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:19:17,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-09 17:19:17,092 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:19:17,093 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:19:17,094 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:19:17,094 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-09 17:19:17,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-09 17:19:17,113 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:19:17,116 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:19:17,117 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:19:17,117 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-09 17:19:17,217 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-09 17:19:17,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-07-09 17:19:17,219 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:19:17,222 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:19:17,223 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:19:17,223 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-09 17:19:17,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:19:17,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:19:17,265 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:19:17,269 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:19:17,269 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:19:17,274 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:19:17,275 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:19:17,275 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-09 17:19:17,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-07-09 17:19:17,329 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:19:17,334 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:19:17,335 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:19:17,335 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-07-09 17:19:17,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-09 17:19:17,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:19:17,393 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:19:17,397 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:19:17,397 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:19:17,404 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:19:17,405 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:19:17,405 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-07-09 17:19:17,493 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-07-09 17:19:17,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-07-09 17:19:17,495 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:19:17,499 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:19:17,499 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:19:17,499 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2021-07-09 17:19:17,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-07-09 17:19:17,653 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:19:17,657 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:19:17,658 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-09 17:19:17,658 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:26 [2021-07-09 17:19:18,188 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (not (= (* 28 t_funThread2of2ForFork0_~i~0) (+ (* 28 |c_t_funThread1of2ForFork0_#t~post35|) 28))) (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))))) is different from true [2021-07-09 17:19:20,228 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (not (= (* 28 c_t_funThread1of2ForFork0_~i~0) (* 28 t_funThread2of2ForFork0_~i~0))))) is different from true [2021-07-09 17:19:20,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-07-09 17:19:20,278 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:19:20,283 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:19:20,284 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-07-09 17:19:20,285 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:28 [2021-07-09 17:19:21,343 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-09 17:19:21,343 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836447241] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:19:21,343 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:19:21,343 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 18] total 58 [2021-07-09 17:19:21,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759544889] [2021-07-09 17:19:21,344 INFO L462 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-07-09 17:19:21,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:19:21,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-07-09 17:19:21,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=2718, Unknown=3, NotChecked=218, Total=3306 [2021-07-09 17:19:21,345 INFO L87 Difference]: Start difference. First operand 14574 states and 40478 transitions. Second operand has 58 states, 58 states have (on average 4.017241379310345) internal successors, (233), 58 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:19:26,517 WARN L205 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 53 DAG size of output: 30 [2021-07-09 17:19:32,045 WARN L205 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2021-07-09 17:19:34,555 WARN L205 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2021-07-09 17:19:39,572 WARN L205 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 33 DAG size of output: 29 Received shutdown request... [2021-07-09 17:21:10,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-07-09 17:21:10,757 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2021-07-09 17:21:10,757 WARN L547 AbstractCegarLoop]: Verification canceled [2021-07-09 17:21:10,757 INFO L301 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was TIMEOUT (1/3) [2021-07-09 17:21:10,758 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-07-09 17:21:10,758 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 17:21:10,758 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 17:21:10,758 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 17:21:10,759 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 17:21:10,759 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 17:21:10,759 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 17:21:10,759 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 17:21:10,759 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-09 17:21:10,760 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 217 places, 257 transitions, 532 flow [2021-07-09 17:21:10,761 WARN L547 AbstractCegarLoop]: Verification canceled [2021-07-09 17:21:10,761 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was TIMEOUT (2/3) [2021-07-09 17:21:10,761 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-09 17:21:10,762 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 17:21:10,762 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 17:21:10,762 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 17:21:10,762 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 17:21:10,762 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 17:21:10,762 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 17:21:10,762 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 17:21:10,762 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t_funThread2of2ForFork0======== [2021-07-09 17:21:10,763 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 217 places, 257 transitions, 532 flow [2021-07-09 17:21:10,764 WARN L547 AbstractCegarLoop]: Verification canceled [2021-07-09 17:21:10,764 INFO L301 ceAbstractionStarter]: Result for error location t_funThread2of2ForFork0 was TIMEOUT (3/3) [2021-07-09 17:21:10,764 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2021-07-09 17:21:10,766 WARN L196 ceAbstractionStarter]: Timeout [2021-07-09 17:21:10,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.07 05:21:10 BasicIcfg [2021-07-09 17:21:10,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-09 17:21:10,767 INFO L168 Benchmark]: Toolchain (without parser) took 839970.92 ms. Allocated memory was 185.6 MB in the beginning and 7.8 GB in the end (delta: 7.7 GB). Free memory was 147.2 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 5.1 GB. Max. memory is 8.0 GB. [2021-07-09 17:21:10,767 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 185.6 MB. Free memory is still 165.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-09 17:21:10,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 661.88 ms. Allocated memory is still 185.6 MB. Free memory was 147.0 MB in the beginning and 149.4 MB in the end (delta: -2.4 MB). Peak memory consumption was 17.6 MB. Max. memory is 8.0 GB. [2021-07-09 17:21:10,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.05 ms. Allocated memory is still 185.6 MB. Free memory was 149.4 MB in the beginning and 146.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-09 17:21:10,768 INFO L168 Benchmark]: Boogie Preprocessor took 48.38 ms. Allocated memory is still 185.6 MB. Free memory was 146.7 MB in the beginning and 144.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-09 17:21:10,768 INFO L168 Benchmark]: RCFGBuilder took 617.06 ms. Allocated memory is still 185.6 MB. Free memory was 144.6 MB in the beginning and 107.4 MB in the end (delta: 37.2 MB). Peak memory consumption was 37.7 MB. Max. memory is 8.0 GB. [2021-07-09 17:21:10,768 INFO L168 Benchmark]: TraceAbstraction took 838559.82 ms. Allocated memory was 185.6 MB in the beginning and 7.8 GB in the end (delta: 7.7 GB). Free memory was 106.9 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 5.0 GB. Max. memory is 8.0 GB. [2021-07-09 17:21:10,768 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.17 ms. Allocated memory is still 185.6 MB. Free memory is still 165.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 661.88 ms. Allocated memory is still 185.6 MB. Free memory was 147.0 MB in the beginning and 149.4 MB in the end (delta: -2.4 MB). Peak memory consumption was 17.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 76.05 ms. Allocated memory is still 185.6 MB. Free memory was 149.4 MB in the beginning and 146.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 48.38 ms. Allocated memory is still 185.6 MB. Free memory was 146.7 MB in the beginning and 144.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 617.06 ms. Allocated memory is still 185.6 MB. Free memory was 144.6 MB in the beginning and 107.4 MB in the end (delta: 37.2 MB). Peak memory consumption was 37.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 838559.82 ms. Allocated memory was 185.6 MB in the beginning and 7.8 GB in the end (delta: 7.7 GB). Free memory was 106.9 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 5.0 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (14574states) and FLOYD_HOARE automaton (currently 72 states, 58 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 116 known predicates. - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 217 places, 257 transitions, 532 flow. Already constructed 2 states. Currently 1 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 213 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3542.7ms, OverallIterations: 5, TraceHistogramMax: 2, EmptinessCheckTime: 34.9ms, AutomataDifference: 777.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 98.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 714 SDtfs, 592 SDslu, 1481 SDs, 0 SdLazy, 324 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 223.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 407.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2220occurred in iteration=0, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 215.4ms AutomataMinimizationTime, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 86.7ms SsaConstructionTime, 215.9ms SatisfiabilityAnalysisTime, 1101.0ms InterpolantComputationTime, 548 NumberOfCodeBlocks, 538 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 540 ConstructedInterpolants, 1 QuantifiedInterpolants, 1049 SizeOfPredicates, 16 NumberOfNonLiveVariables, 483 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 15/32 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 2 thread instances CFG has 4 procedures, 270 locations, 5 error locations. Started 0 CEGAR loops. No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 213 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7537.1ms, OverallIterations: 13, TraceHistogramMax: 10, EmptinessCheckTime: 16.4ms, AutomataDifference: 1617.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 42.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1353 SDtfs, 292 SDslu, 4343 SDs, 0 SdLazy, 510 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 354.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 866 GetRequests, 654 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 1657.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2985occurred in iteration=0, InterpolantAutomatonStates: 170, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 355.4ms AutomataMinimizationTime, 12 MinimizatonAttempts, 27 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 141.6ms SsaConstructionTime, 402.5ms SatisfiabilityAnalysisTime, 2127.6ms InterpolantComputationTime, 1495 NumberOfCodeBlocks, 1481 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1380 ConstructedInterpolants, 0 QuantifiedInterpolants, 2332 SizeOfPredicates, 90 NumberOfNonLiveVariables, 1348 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 22 InterpolantComputations, 3 PerfectInterpolantSequences, 91/1382 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 2 thread instances CFG has 4 procedures, 270 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 2.7ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of2ForFork0 with 1 thread instances CFG has 4 procedures, 270 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 827293.7ms, OverallIterations: 22, TraceHistogramMax: 10, EmptinessCheckTime: 728.6ms, AutomataDifference: 736835.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4302.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 6013 SDtfs, 12631 SDslu, 83865 SDs, 0 SdLazy, 25810 SolverSat, 991 SolverUnsat, 214 SolverUnknown, 0 SolverNotchecked, 441235.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3382 GetRequests, 2329 SyntacticMatches, 36 SemanticMatches, 1016 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 21575 ImplicationChecksByTransitivity, 313898.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=193105occurred in iteration=0, InterpolantAutomatonStates: 609, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 31995.8ms AutomataMinimizationTime, 21 MinimizatonAttempts, 14791 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 663.6ms SsaConstructionTime, 1206.5ms SatisfiabilityAnalysisTime, 46178.8ms InterpolantComputationTime, 5016 NumberOfCodeBlocks, 4803 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 4974 ConstructedInterpolants, 105 QuantifiedInterpolants, 47537 SizeOfPredicates, 298 NumberOfNonLiveVariables, 4625 ConjunctsInSsa, 406 ConjunctsInUnsatCore, 42 InterpolantComputations, 4 PerfectInterpolantSequences, 3706/5754 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread2of2ForFork0 with 1 thread instances CFG has 4 procedures, 270 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 2.0ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown