/usr/bin/java -Xmx16000000000 -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-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 12:10:22,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 12:10:22,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 12:10:22,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 12:10:22,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 12:10:22,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 12:10:22,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 12:10:22,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 12:10:22,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 12:10:22,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 12:10:22,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 12:10:22,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 12:10:22,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 12:10:22,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 12:10:22,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 12:10:22,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 12:10:22,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 12:10:22,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 12:10:22,914 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 12:10:22,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 12:10:22,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 12:10:22,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 12:10:22,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 12:10:22,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 12:10:22,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 12:10:22,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 12:10:22,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 12:10:22,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 12:10:22,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 12:10:22,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 12:10:22,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 12:10:22,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 12:10:22,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 12:10:22,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 12:10:22,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 12:10:22,936 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 12:10:22,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 12:10:22,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 12:10:22,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 12:10:22,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 12:10:22,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 12:10:22,938 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-Separate.epf [2021-06-05 12:10:22,972 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 12:10:22,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 12:10:22,973 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 12:10:22,973 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 12:10:22,975 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 12:10:22,975 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 12:10:22,975 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 12:10:22,976 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 12:10:22,976 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 12:10:22,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 12:10:22,977 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 12:10:22,977 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 12:10:22,977 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 12:10:22,977 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 12:10:22,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 12:10:22,978 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 12:10:22,978 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 12:10:22,978 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 12:10:22,978 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 12:10:22,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 12:10:22,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 12:10:22,979 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 12:10:22,979 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 12:10:22,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 12:10:22,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 12:10:22,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 12:10:22,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 12:10:22,980 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 12:10:22,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 12:10:22,980 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 12:10:22,980 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 12:10:22,980 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 12:10:22,981 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-06-05 12:10:23,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 12:10:23,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 12:10:23,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 12:10:23,329 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 12:10:23,330 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 12:10:23,331 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2021-06-05 12:10:23,395 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5403077c0/f6503f947e1e45cdae6ccda353894916/FLAGc78ac49b7 [2021-06-05 12:10:23,875 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 12:10:23,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2021-06-05 12:10:23,890 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5403077c0/f6503f947e1e45cdae6ccda353894916/FLAGc78ac49b7 [2021-06-05 12:10:24,355 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5403077c0/f6503f947e1e45cdae6ccda353894916 [2021-06-05 12:10:24,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 12:10:24,358 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 12:10:24,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 12:10:24,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 12:10:24,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 12:10:24,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:10:24" (1/1) ... [2021-06-05 12:10:24,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca288cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:24, skipping insertion in model container [2021-06-05 12:10:24,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:10:24" (1/1) ... [2021-06-05 12:10:24,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 12:10:24,439 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 12:10:24,856 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_71-funloop_racing.i[41060,41073] [2021-06-05 12:10:24,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 12:10:24,909 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 12:10:24,951 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_71-funloop_racing.i[41060,41073] [2021-06-05 12:10:24,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 12:10:25,098 INFO L208 MainTranslator]: Completed translation [2021-06-05 12:10:25,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:25 WrapperNode [2021-06-05 12:10:25,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 12:10:25,100 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 12:10:25,100 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 12:10:25,100 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 12:10:25,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:25" (1/1) ... [2021-06-05 12:10:25,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:25" (1/1) ... [2021-06-05 12:10:25,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 12:10:25,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 12:10:25,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 12:10:25,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 12:10:25,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:25" (1/1) ... [2021-06-05 12:10:25,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:25" (1/1) ... [2021-06-05 12:10:25,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:25" (1/1) ... [2021-06-05 12:10:25,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:25" (1/1) ... [2021-06-05 12:10:25,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:25" (1/1) ... [2021-06-05 12:10:25,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:25" (1/1) ... [2021-06-05 12:10:25,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:25" (1/1) ... [2021-06-05 12:10:25,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 12:10:25,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 12:10:25,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 12:10:25,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 12:10:25,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:25" (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-06-05 12:10:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 12:10:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 12:10:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 12:10:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 12:10:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-05 12:10:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-06-05 12:10:25,309 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-06-05 12:10:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 12:10:25,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 12:10:25,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 12:10:25,311 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 12:10:25,858 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 12:10:25,859 INFO L299 CfgBuilder]: Removed 49 assume(true) statements. [2021-06-05 12:10:25,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:10:25 BoogieIcfgContainer [2021-06-05 12:10:25,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 12:10:25,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 12:10:25,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 12:10:25,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 12:10:25,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 12:10:24" (1/3) ... [2021-06-05 12:10:25,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a43b206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:10:25, skipping insertion in model container [2021-06-05 12:10:25,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:25" (2/3) ... [2021-06-05 12:10:25,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a43b206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:10:25, skipping insertion in model container [2021-06-05 12:10:25,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:10:25" (3/3) ... [2021-06-05 12:10:25,867 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2021-06-05 12:10:25,872 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 12:10:25,872 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 12:10:25,873 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-06-05 12:10:25,873 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 12:10:25,913 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,914 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,914 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,914 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,914 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,914 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,914 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,914 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,915 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,915 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,915 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,915 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,915 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,915 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,915 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,916 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,916 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,916 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,916 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,916 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,916 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,916 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,916 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,917 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,917 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,917 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,918 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,918 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,918 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,918 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,918 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,918 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,918 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,919 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,919 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,919 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,919 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,919 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,920 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,920 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,920 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,920 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,920 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,920 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,920 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,920 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,920 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,921 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,921 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,921 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,921 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,921 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,921 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,921 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,921 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,921 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,922 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,922 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,922 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,922 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,923 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,923 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,923 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,923 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,923 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,923 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,924 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,924 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,924 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,924 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,924 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,924 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,924 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,924 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,925 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,925 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,925 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,925 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,925 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,925 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,925 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,926 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,926 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,926 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,927 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,927 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,927 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,927 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,928 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,928 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,928 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,928 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,928 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,928 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,929 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,929 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,929 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,930 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,930 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,931 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,933 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,933 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,934 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,934 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,940 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,940 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,940 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,940 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,940 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,940 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,941 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,941 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,941 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,941 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,941 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,941 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,941 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,941 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,942 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,942 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,942 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,942 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,942 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,942 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,942 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,942 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,942 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,943 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,943 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,943 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,943 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,943 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,943 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,943 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,943 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,943 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,944 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,944 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,944 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,944 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,944 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,944 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,944 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,944 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,944 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,945 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,945 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,945 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,945 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,945 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,945 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,945 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,945 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,947 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,947 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,947 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,947 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,947 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,947 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,952 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,953 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,953 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,953 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,953 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,955 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,955 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,955 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,955 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,955 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,956 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,956 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,956 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,956 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,956 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,956 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,957 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,957 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,957 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,957 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,957 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,957 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,957 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,958 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,958 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,958 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,958 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:25,964 INFO L149 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-06-05 12:10:25,983 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 12:10:25,998 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:10:25,998 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:10:25,999 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:10:25,999 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:10:25,999 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:10:25,999 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:10:25,999 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:10:25,999 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 12:10:26,011 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 194 places, 236 transitions, 480 flow [2021-06-05 12:10:26,239 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5964 states, 5951 states have (on average 2.468324651319106) internal successors, (14689), 5963 states have internal predecessors, (14689), 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-06-05 12:10:26,256 INFO L276 IsEmpty]: Start isEmpty. Operand has 5964 states, 5951 states have (on average 2.468324651319106) internal successors, (14689), 5963 states have internal predecessors, (14689), 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-06-05 12:10:26,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-06-05 12:10:26,264 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:26,265 INFO L521 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] [2021-06-05 12:10:26,265 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:26,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:26,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1371058688, now seen corresponding path program 1 times [2021-06-05 12:10:26,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:26,277 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031584485] [2021-06-05 12:10:26,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:10:26,447 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:26,448 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031584485] [2021-06-05 12:10:26,448 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031584485] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:10:26,448 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:10:26,448 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:10:26,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512674960] [2021-06-05 12:10:26,452 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:10:26,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:26,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:10:26,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:10:26,494 INFO L87 Difference]: Start difference. First operand has 5964 states, 5951 states have (on average 2.468324651319106) internal successors, (14689), 5963 states have internal predecessors, (14689), 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 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-06-05 12:10:26,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:26,563 INFO L93 Difference]: Finished difference Result 5748 states and 11583 transitions. [2021-06-05 12:10:26,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:10:26,564 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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 36 [2021-06-05 12:10:26,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:26,599 INFO L225 Difference]: With dead ends: 5748 [2021-06-05 12:10:26,599 INFO L226 Difference]: Without dead ends: 5589 [2021-06-05 12:10:26,601 INFO L777 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-06-05 12:10:26,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5589 states. [2021-06-05 12:10:26,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5589 to 5589. [2021-06-05 12:10:26,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5589 states, 5580 states have (on average 2.024910394265233) internal successors, (11299), 5588 states have internal predecessors, (11299), 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-06-05 12:10:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5589 states to 5589 states and 11299 transitions. [2021-06-05 12:10:26,826 INFO L78 Accepts]: Start accepts. Automaton has 5589 states and 11299 transitions. Word has length 36 [2021-06-05 12:10:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:26,826 INFO L482 AbstractCegarLoop]: Abstraction has 5589 states and 11299 transitions. [2021-06-05 12:10:26,827 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-06-05 12:10:26,827 INFO L276 IsEmpty]: Start isEmpty. Operand 5589 states and 11299 transitions. [2021-06-05 12:10:26,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-06-05 12:10:26,828 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:26,828 INFO L521 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] [2021-06-05 12:10:26,829 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 12:10:26,829 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:26,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:26,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1550360349, now seen corresponding path program 1 times [2021-06-05 12:10:26,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:26,830 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495545984] [2021-06-05 12:10:26,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:26,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:10:26,883 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:26,883 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495545984] [2021-06-05 12:10:26,884 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495545984] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:10:26,884 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:10:26,884 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:10:26,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143832387] [2021-06-05 12:10:26,885 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:10:26,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:26,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:10:26,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:10:26,886 INFO L87 Difference]: Start difference. First operand 5589 states and 11299 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-06-05 12:10:26,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:26,932 INFO L93 Difference]: Finished difference Result 5593 states and 11303 transitions. [2021-06-05 12:10:26,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:10:26,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2021-06-05 12:10:26,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:26,954 INFO L225 Difference]: With dead ends: 5593 [2021-06-05 12:10:26,955 INFO L226 Difference]: Without dead ends: 5593 [2021-06-05 12:10:26,955 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:10:26,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5593 states. [2021-06-05 12:10:27,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5593 to 5590. [2021-06-05 12:10:27,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5590 states, 5581 states have (on average 2.0247267514782297) internal successors, (11300), 5589 states have internal predecessors, (11300), 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-06-05 12:10:27,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5590 states to 5590 states and 11300 transitions. [2021-06-05 12:10:27,101 INFO L78 Accepts]: Start accepts. Automaton has 5590 states and 11300 transitions. Word has length 36 [2021-06-05 12:10:27,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:27,101 INFO L482 AbstractCegarLoop]: Abstraction has 5590 states and 11300 transitions. [2021-06-05 12:10:27,102 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-06-05 12:10:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand 5590 states and 11300 transitions. [2021-06-05 12:10:27,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-06-05 12:10:27,103 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:27,103 INFO L521 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] [2021-06-05 12:10:27,103 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 12:10:27,104 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:27,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:27,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1318270532, now seen corresponding path program 1 times [2021-06-05 12:10:27,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:27,105 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543827395] [2021-06-05 12:10:27,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:27,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:10:27,243 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:27,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543827395] [2021-06-05 12:10:27,244 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543827395] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:27,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662875070] [2021-06-05 12:10:27,244 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-06-05 12:10:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:27,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-05 12:10:27,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:27,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:10:27,536 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662875070] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:10:27,536 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:10:27,536 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-05 12:10:27,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861504956] [2021-06-05 12:10:27,537 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:10:27,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:27,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:10:27,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:10:27,538 INFO L87 Difference]: Start difference. First operand 5590 states and 11300 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-06-05 12:10:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:27,576 INFO L93 Difference]: Finished difference Result 5530 states and 11238 transitions. [2021-06-05 12:10:27,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:10:27,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 41 [2021-06-05 12:10:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:27,596 INFO L225 Difference]: With dead ends: 5530 [2021-06-05 12:10:27,597 INFO L226 Difference]: Without dead ends: 5530 [2021-06-05 12:10:27,597 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 16.9ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:10:27,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5530 states. [2021-06-05 12:10:27,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5530 to 5530. [2021-06-05 12:10:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5530 states, 5523 states have (on average 2.0347637153720806) internal successors, (11238), 5529 states have internal predecessors, (11238), 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-06-05 12:10:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5530 states to 5530 states and 11238 transitions. [2021-06-05 12:10:27,747 INFO L78 Accepts]: Start accepts. Automaton has 5530 states and 11238 transitions. Word has length 41 [2021-06-05 12:10:27,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:27,747 INFO L482 AbstractCegarLoop]: Abstraction has 5530 states and 11238 transitions. [2021-06-05 12:10:27,747 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-06-05 12:10:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 5530 states and 11238 transitions. [2021-06-05 12:10:27,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-06-05 12:10:27,750 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:27,750 INFO L521 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] [2021-06-05 12:10:27,964 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-06-05 12:10:27,965 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:27,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:27,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1235089326, now seen corresponding path program 1 times [2021-06-05 12:10:27,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:27,965 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418495931] [2021-06-05 12:10:27,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:10:28,028 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:28,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418495931] [2021-06-05 12:10:28,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418495931] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:28,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320311317] [2021-06-05 12:10:28,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-06-05 12:10:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:28,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-05 12:10:28,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 12:10:28,217 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320311317] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:10:28,217 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:10:28,217 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-05 12:10:28,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114349417] [2021-06-05 12:10:28,217 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:10:28,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:28,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:10:28,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:10:28,218 INFO L87 Difference]: Start difference. First operand 5530 states and 11238 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-06-05 12:10:28,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:28,260 INFO L93 Difference]: Finished difference Result 7968 states and 16213 transitions. [2021-06-05 12:10:28,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:10:28,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 51 [2021-06-05 12:10:28,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:28,288 INFO L225 Difference]: With dead ends: 7968 [2021-06-05 12:10:28,288 INFO L226 Difference]: Without dead ends: 7968 [2021-06-05 12:10:28,288 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 18.4ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:10:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7968 states. [2021-06-05 12:10:28,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7968 to 5583. [2021-06-05 12:10:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5583 states, 5576 states have (on average 2.03461262553802) internal successors, (11345), 5582 states have internal predecessors, (11345), 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-06-05 12:10:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5583 states to 5583 states and 11345 transitions. [2021-06-05 12:10:28,481 INFO L78 Accepts]: Start accepts. Automaton has 5583 states and 11345 transitions. Word has length 51 [2021-06-05 12:10:28,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:28,483 INFO L482 AbstractCegarLoop]: Abstraction has 5583 states and 11345 transitions. [2021-06-05 12:10:28,483 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-06-05 12:10:28,483 INFO L276 IsEmpty]: Start isEmpty. Operand 5583 states and 11345 transitions. [2021-06-05 12:10:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-06-05 12:10:28,487 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:28,487 INFO L521 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] [2021-06-05 12:10:28,700 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:10:28,701 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:28,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:28,701 INFO L82 PathProgramCache]: Analyzing trace with hash -2115124251, now seen corresponding path program 1 times [2021-06-05 12:10:28,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:28,701 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707432061] [2021-06-05 12:10:28,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:10:28,775 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:28,775 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707432061] [2021-06-05 12:10:28,775 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707432061] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:28,775 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828314606] [2021-06-05 12:10:28,775 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-06-05 12:10:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:28,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:10:28,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:29,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:10:29,001 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828314606] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:29,001 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:10:29,001 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:10:29,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560217903] [2021-06-05 12:10:29,001 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:10:29,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:29,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:10:29,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:10:29,002 INFO L87 Difference]: Start difference. First operand 5583 states and 11345 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-06-05 12:10:29,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:29,056 INFO L93 Difference]: Finished difference Result 5591 states and 11353 transitions. [2021-06-05 12:10:29,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:10:29,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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 52 [2021-06-05 12:10:29,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:29,076 INFO L225 Difference]: With dead ends: 5591 [2021-06-05 12:10:29,076 INFO L226 Difference]: Without dead ends: 5591 [2021-06-05 12:10:29,076 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 33.0ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:10:29,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5591 states. [2021-06-05 12:10:29,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5591 to 5588. [2021-06-05 12:10:29,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5588 states, 5581 states have (on average 2.0336857194051245) internal successors, (11350), 5587 states have internal predecessors, (11350), 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-06-05 12:10:29,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5588 states to 5588 states and 11350 transitions. [2021-06-05 12:10:29,237 INFO L78 Accepts]: Start accepts. Automaton has 5588 states and 11350 transitions. Word has length 52 [2021-06-05 12:10:29,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:29,238 INFO L482 AbstractCegarLoop]: Abstraction has 5588 states and 11350 transitions. [2021-06-05 12:10:29,238 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-06-05 12:10:29,238 INFO L276 IsEmpty]: Start isEmpty. Operand 5588 states and 11350 transitions. [2021-06-05 12:10:29,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 12:10:29,239 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:29,239 INFO L521 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] [2021-06-05 12:10:29,456 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:10:29,457 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:29,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:29,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1189007492, now seen corresponding path program 2 times [2021-06-05 12:10:29,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:29,458 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479125383] [2021-06-05 12:10:29,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:10:29,555 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:29,555 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479125383] [2021-06-05 12:10:29,555 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479125383] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:29,555 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015180496] [2021-06-05 12:10:29,555 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 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-06-05 12:10:29,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 12:10:29,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:10:29,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:10:29,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:29,704 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-06-05 12:10:29,705 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:29,707 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:29,707 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:29,707 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:10:29,724 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-06-05 12:10:29,725 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:29,729 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:29,731 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:29,731 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:10:29,812 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:10:29,813 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-06-05 12:10:29,816 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:29,852 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:29,853 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:29,854 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:10:29,899 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-06-05 12:10:29,905 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-06-05 12:10:29,906 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:29,911 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:29,913 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:29,920 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:29,922 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:29,923 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:10:30,000 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 14 treesize of output 10 [2021-06-05 12:10:30,001 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:30,003 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:30,004 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:10:30,005 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:10:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:10:30,063 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015180496] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:10:30,064 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:10:30,064 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2021-06-05 12:10:30,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096284940] [2021-06-05 12:10:30,064 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:10:30,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:30,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:10:30,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 12:10:30,065 INFO L87 Difference]: Start difference. First operand 5588 states and 11350 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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-06-05 12:10:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:31,286 INFO L93 Difference]: Finished difference Result 16021 states and 32556 transitions. [2021-06-05 12:10:31,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 12:10:31,287 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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 57 [2021-06-05 12:10:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:31,320 INFO L225 Difference]: With dead ends: 16021 [2021-06-05 12:10:31,320 INFO L226 Difference]: Without dead ends: 16021 [2021-06-05 12:10:31,321 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 598.9ms TimeCoverageRelationStatistics Valid=389, Invalid=1503, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 12:10:31,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16021 states. [2021-06-05 12:10:31,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16021 to 8086. [2021-06-05 12:10:31,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8086 states, 8079 states have (on average 2.046045302636465) internal successors, (16530), 8085 states have internal predecessors, (16530), 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-06-05 12:10:31,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8086 states to 8086 states and 16530 transitions. [2021-06-05 12:10:31,534 INFO L78 Accepts]: Start accepts. Automaton has 8086 states and 16530 transitions. Word has length 57 [2021-06-05 12:10:31,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:31,535 INFO L482 AbstractCegarLoop]: Abstraction has 8086 states and 16530 transitions. [2021-06-05 12:10:31,535 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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-06-05 12:10:31,535 INFO L276 IsEmpty]: Start isEmpty. Operand 8086 states and 16530 transitions. [2021-06-05 12:10:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:10:31,537 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:31,537 INFO L521 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] [2021-06-05 12:10:31,752 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:10:31,753 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:31,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:31,753 INFO L82 PathProgramCache]: Analyzing trace with hash -895577044, now seen corresponding path program 1 times [2021-06-05 12:10:31,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:31,753 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410673116] [2021-06-05 12:10:31,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:10:31,802 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:31,802 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410673116] [2021-06-05 12:10:31,802 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410673116] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:31,802 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146132818] [2021-06-05 12:10:31,802 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-06-05 12:10:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:31,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:10:31,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:32,013 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:10:32,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146132818] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:32,014 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:10:32,014 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2021-06-05 12:10:32,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778089037] [2021-06-05 12:10:32,015 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 12:10:32,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:32,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 12:10:32,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 12:10:32,015 INFO L87 Difference]: Start difference. First operand 8086 states and 16530 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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-06-05 12:10:32,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:32,114 INFO L93 Difference]: Finished difference Result 905 states and 1707 transitions. [2021-06-05 12:10:32,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 12:10:32,115 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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 61 [2021-06-05 12:10:32,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:32,117 INFO L225 Difference]: With dead ends: 905 [2021-06-05 12:10:32,117 INFO L226 Difference]: Without dead ends: 887 [2021-06-05 12:10:32,117 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 85.0ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-06-05 12:10:32,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2021-06-05 12:10:32,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 884. [2021-06-05 12:10:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 1.8856172140430352) internal successors, (1665), 883 states have internal predecessors, (1665), 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-06-05 12:10:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1665 transitions. [2021-06-05 12:10:32,132 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1665 transitions. Word has length 61 [2021-06-05 12:10:32,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:32,133 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 1665 transitions. [2021-06-05 12:10:32,133 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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-06-05 12:10:32,133 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1665 transitions. [2021-06-05 12:10:32,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 12:10:32,134 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:32,134 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:10:32,356 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-06-05 12:10:32,357 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:32,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:32,357 INFO L82 PathProgramCache]: Analyzing trace with hash -219589387, now seen corresponding path program 1 times [2021-06-05 12:10:32,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:32,357 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182994850] [2021-06-05 12:10:32,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:32,452 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:10:32,453 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:32,453 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182994850] [2021-06-05 12:10:32,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182994850] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:32,453 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32572413] [2021-06-05 12:10:32,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-06-05 12:10:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:32,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 12:10:32,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:10:32,655 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32572413] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:32,655 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:10:32,655 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 12:10:32,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954293584] [2021-06-05 12:10:32,656 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:10:32,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:32,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:10:32,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:10:32,656 INFO L87 Difference]: Start difference. First operand 884 states and 1665 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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-06-05 12:10:32,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:32,737 INFO L93 Difference]: Finished difference Result 892 states and 1673 transitions. [2021-06-05 12:10:32,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:10:32,738 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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 71 [2021-06-05 12:10:32,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:32,739 INFO L225 Difference]: With dead ends: 892 [2021-06-05 12:10:32,740 INFO L226 Difference]: Without dead ends: 892 [2021-06-05 12:10:32,740 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 78.3ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:10:32,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2021-06-05 12:10:32,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 889. [2021-06-05 12:10:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 1.8806306306306306) internal successors, (1670), 888 states have internal predecessors, (1670), 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-06-05 12:10:32,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1670 transitions. [2021-06-05 12:10:32,751 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1670 transitions. Word has length 71 [2021-06-05 12:10:32,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:32,752 INFO L482 AbstractCegarLoop]: Abstraction has 889 states and 1670 transitions. [2021-06-05 12:10:32,752 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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-06-05 12:10:32,752 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1670 transitions. [2021-06-05 12:10:32,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 12:10:32,753 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:32,753 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:10:32,968 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:10:32,969 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:32,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:32,969 INFO L82 PathProgramCache]: Analyzing trace with hash -236392970, now seen corresponding path program 2 times [2021-06-05 12:10:32,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:32,969 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371921885] [2021-06-05 12:10:32,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:33,050 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:10:33,050 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:33,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371921885] [2021-06-05 12:10:33,051 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371921885] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:33,051 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437235326] [2021-06-05 12:10:33,051 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 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-06-05 12:10:33,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:10:33,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:10:33,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:10:33,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:10:33,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437235326] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:33,292 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:10:33,292 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 12:10:33,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408289773] [2021-06-05 12:10:33,295 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:10:33,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:33,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:10:33,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:10:33,296 INFO L87 Difference]: Start difference. First operand 889 states and 1670 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 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-06-05 12:10:33,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:33,408 INFO L93 Difference]: Finished difference Result 897 states and 1678 transitions. [2021-06-05 12:10:33,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:10:33,408 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 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 76 [2021-06-05 12:10:33,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:33,410 INFO L225 Difference]: With dead ends: 897 [2021-06-05 12:10:33,410 INFO L226 Difference]: Without dead ends: 897 [2021-06-05 12:10:33,411 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 124.0ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:10:33,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2021-06-05 12:10:33,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 894. [2021-06-05 12:10:33,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.8756998880179172) internal successors, (1675), 893 states have internal predecessors, (1675), 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-06-05 12:10:33,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1675 transitions. [2021-06-05 12:10:33,422 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1675 transitions. Word has length 76 [2021-06-05 12:10:33,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:33,423 INFO L482 AbstractCegarLoop]: Abstraction has 894 states and 1675 transitions. [2021-06-05 12:10:33,424 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 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-06-05 12:10:33,424 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1675 transitions. [2021-06-05 12:10:33,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-05 12:10:33,429 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:33,429 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:10:33,644 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:10:33,645 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:33,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:33,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1854550635, now seen corresponding path program 3 times [2021-06-05 12:10:33,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:33,646 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311508458] [2021-06-05 12:10:33,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:10:33,745 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:33,745 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311508458] [2021-06-05 12:10:33,745 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311508458] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:33,745 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978950834] [2021-06-05 12:10:33,745 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 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-06-05 12:10:33,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:10:33,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:10:33,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-05 12:10:33,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:33,843 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-06-05 12:10:33,844 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:33,846 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:33,846 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:33,846 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:10:33,861 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-06-05 12:10:33,862 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:33,866 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:33,866 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:33,866 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:10:33,939 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:10:33,939 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-06-05 12:10:33,941 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:33,948 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:33,949 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:33,949 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:10:33,987 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-06-05 12:10:33,993 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-06-05 12:10:33,993 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:33,997 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:33,998 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:34,003 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:34,005 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:34,005 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:10:34,105 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-06-05 12:10:34,110 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-06-05 12:10:34,111 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:34,116 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:34,117 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:34,122 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:34,124 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:34,124 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:10:34,144 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 14 treesize of output 10 [2021-06-05 12:10:34,145 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:34,147 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:34,148 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:10:34,148 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:10:34,204 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-05 12:10:34,204 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978950834] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:34,204 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:10:34,204 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2021-06-05 12:10:34,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500981776] [2021-06-05 12:10:34,205 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 12:10:34,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:34,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 12:10:34,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2021-06-05 12:10:34,205 INFO L87 Difference]: Start difference. First operand 894 states and 1675 transitions. Second operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 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-06-05 12:10:34,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:34,981 INFO L93 Difference]: Finished difference Result 1674 states and 3169 transitions. [2021-06-05 12:10:34,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:10:34,981 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 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 81 [2021-06-05 12:10:34,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:34,984 INFO L225 Difference]: With dead ends: 1674 [2021-06-05 12:10:34,984 INFO L226 Difference]: Without dead ends: 1674 [2021-06-05 12:10:34,985 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 651.8ms TimeCoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2021-06-05 12:10:34,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2021-06-05 12:10:34,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 871. [2021-06-05 12:10:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 1.8781609195402298) internal successors, (1634), 870 states have internal predecessors, (1634), 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-06-05 12:10:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1634 transitions. [2021-06-05 12:10:35,000 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1634 transitions. Word has length 81 [2021-06-05 12:10:35,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:35,000 INFO L482 AbstractCegarLoop]: Abstraction has 871 states and 1634 transitions. [2021-06-05 12:10:35,000 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 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-06-05 12:10:35,000 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1634 transitions. [2021-06-05 12:10:35,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-05 12:10:35,002 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:35,002 INFO L521 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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] [2021-06-05 12:10:35,224 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-06-05 12:10:35,227 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:35,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:35,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1506381164, now seen corresponding path program 1 times [2021-06-05 12:10:35,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:35,227 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677474534] [2021-06-05 12:10:35,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:10:35,380 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:35,381 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677474534] [2021-06-05 12:10:35,381 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677474534] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:35,381 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927223166] [2021-06-05 12:10:35,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-06-05 12:10:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:35,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:10:35,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:35,649 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:10:35,649 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927223166] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:35,649 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:10:35,649 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-06-05 12:10:35,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466545193] [2021-06-05 12:10:35,650 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 12:10:35,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:35,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 12:10:35,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:10:35,650 INFO L87 Difference]: Start difference. First operand 871 states and 1634 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 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-06-05 12:10:35,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:35,836 INFO L93 Difference]: Finished difference Result 879 states and 1642 transitions. [2021-06-05 12:10:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:10:35,837 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 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 111 [2021-06-05 12:10:35,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:35,838 INFO L225 Difference]: With dead ends: 879 [2021-06-05 12:10:35,838 INFO L226 Difference]: Without dead ends: 879 [2021-06-05 12:10:35,839 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 190.9ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:10:35,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2021-06-05 12:10:35,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 876. [2021-06-05 12:10:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 875 states have (on average 1.8731428571428572) internal successors, (1639), 875 states have internal predecessors, (1639), 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-06-05 12:10:35,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1639 transitions. [2021-06-05 12:10:35,851 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1639 transitions. Word has length 111 [2021-06-05 12:10:35,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:35,851 INFO L482 AbstractCegarLoop]: Abstraction has 876 states and 1639 transitions. [2021-06-05 12:10:35,851 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 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-06-05 12:10:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1639 transitions. [2021-06-05 12:10:35,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-06-05 12:10:35,853 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:35,853 INFO L521 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 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] [2021-06-05 12:10:36,068 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:10:36,069 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:36,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:36,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1064749419, now seen corresponding path program 2 times [2021-06-05 12:10:36,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:36,069 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844978208] [2021-06-05 12:10:36,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:10:36,215 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:36,215 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844978208] [2021-06-05 12:10:36,215 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844978208] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:36,216 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903825100] [2021-06-05 12:10:36,216 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 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-06-05 12:10:36,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:10:36,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:10:36,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:10:36,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:36,454 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:10:36,455 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903825100] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:36,455 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:10:36,455 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-05 12:10:36,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767483798] [2021-06-05 12:10:36,455 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 12:10:36,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:36,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 12:10:36,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-05 12:10:36,456 INFO L87 Difference]: Start difference. First operand 876 states and 1639 transitions. Second operand has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 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-06-05 12:10:36,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:36,659 INFO L93 Difference]: Finished difference Result 884 states and 1647 transitions. [2021-06-05 12:10:36,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 12:10:36,660 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 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 116 [2021-06-05 12:10:36,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:36,661 INFO L225 Difference]: With dead ends: 884 [2021-06-05 12:10:36,661 INFO L226 Difference]: Without dead ends: 884 [2021-06-05 12:10:36,662 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 246.3ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 12:10:36,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2021-06-05 12:10:36,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 881. [2021-06-05 12:10:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 1.8681818181818182) internal successors, (1644), 880 states have internal predecessors, (1644), 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-06-05 12:10:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1644 transitions. [2021-06-05 12:10:36,674 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1644 transitions. Word has length 116 [2021-06-05 12:10:36,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:36,674 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 1644 transitions. [2021-06-05 12:10:36,675 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 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-06-05 12:10:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1644 transitions. [2021-06-05 12:10:36,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-06-05 12:10:36,677 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:36,677 INFO L521 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 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] [2021-06-05 12:10:36,901 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:10:36,902 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:36,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:36,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1056584908, now seen corresponding path program 3 times [2021-06-05 12:10:36,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:36,902 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227348592] [2021-06-05 12:10:36,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:10:37,079 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:37,079 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227348592] [2021-06-05 12:10:37,079 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227348592] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:37,079 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432549543] [2021-06-05 12:10:37,080 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 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-06-05 12:10:37,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:10:37,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:10:37,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 12:10:37,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:37,193 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-06-05 12:10:37,194 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:37,196 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:37,196 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:37,196 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:10:37,214 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-06-05 12:10:37,215 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:37,218 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:37,219 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:37,219 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:10:37,314 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:10:37,315 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-06-05 12:10:37,318 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:37,322 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:37,323 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:37,323 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:10:37,365 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-06-05 12:10:37,370 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-06-05 12:10:37,371 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:37,374 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:37,375 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:37,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:37,382 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:37,382 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:10:37,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2021-06-05 12:10:37,508 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:37,512 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:37,513 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:37,513 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:18 [2021-06-05 12:10:37,607 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 32 treesize of output 25 [2021-06-05 12:10:37,608 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:37,609 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:37,611 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-06-05 12:10:37,611 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:12 [2021-06-05 12:10:37,695 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 14 treesize of output 10 [2021-06-05 12:10:37,697 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:37,698 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:37,699 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:10:37,699 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:10:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-06-05 12:10:37,766 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432549543] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:37,766 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:10:37,766 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2021-06-05 12:10:37,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675916400] [2021-06-05 12:10:37,767 INFO L462 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-06-05 12:10:37,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:37,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-06-05 12:10:37,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1044, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 12:10:37,768 INFO L87 Difference]: Start difference. First operand 881 states and 1644 transitions. Second operand has 35 states, 35 states have (on average 5.285714285714286) internal successors, (185), 35 states have internal predecessors, (185), 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-06-05 12:10:39,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:39,626 INFO L93 Difference]: Finished difference Result 1884 states and 3499 transitions. [2021-06-05 12:10:39,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-06-05 12:10:39,627 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 5.285714285714286) internal successors, (185), 35 states have internal predecessors, (185), 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 121 [2021-06-05 12:10:39,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:39,629 INFO L225 Difference]: With dead ends: 1884 [2021-06-05 12:10:39,629 INFO L226 Difference]: Without dead ends: 1590 [2021-06-05 12:10:39,632 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2426 ImplicationChecksByTransitivity, 1700.2ms TimeCoverageRelationStatistics Valid=1233, Invalid=7887, Unknown=0, NotChecked=0, Total=9120 [2021-06-05 12:10:39,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2021-06-05 12:10:39,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 885. [2021-06-05 12:10:39,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.8484162895927603) internal successors, (1634), 884 states have internal predecessors, (1634), 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-06-05 12:10:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1634 transitions. [2021-06-05 12:10:39,648 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1634 transitions. Word has length 121 [2021-06-05 12:10:39,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:39,649 INFO L482 AbstractCegarLoop]: Abstraction has 885 states and 1634 transitions. [2021-06-05 12:10:39,649 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 5.285714285714286) internal successors, (185), 35 states have internal predecessors, (185), 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-06-05 12:10:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1634 transitions. [2021-06-05 12:10:39,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-06-05 12:10:39,651 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:39,651 INFO L521 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 2, 2, 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] [2021-06-05 12:10:39,864 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-06-05 12:10:39,865 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:39,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:39,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1911745701, now seen corresponding path program 1 times [2021-06-05 12:10:39,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:39,865 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917923590] [2021-06-05 12:10:39,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:40,108 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:10:40,109 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:40,109 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917923590] [2021-06-05 12:10:40,109 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917923590] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:40,109 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13229015] [2021-06-05 12:10:40,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-06-05 12:10:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:40,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 12:10:40,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:10:40,404 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13229015] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:40,404 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:10:40,405 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-06-05 12:10:40,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670750219] [2021-06-05 12:10:40,405 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 12:10:40,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:40,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 12:10:40,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-06-05 12:10:40,406 INFO L87 Difference]: Start difference. First operand 885 states and 1634 transitions. Second operand has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 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-06-05 12:10:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:40,684 INFO L93 Difference]: Finished difference Result 890 states and 1639 transitions. [2021-06-05 12:10:40,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:10:40,685 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 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 135 [2021-06-05 12:10:40,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:40,686 INFO L225 Difference]: With dead ends: 890 [2021-06-05 12:10:40,686 INFO L226 Difference]: Without dead ends: 890 [2021-06-05 12:10:40,687 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 383.1ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 12:10:40,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2021-06-05 12:10:40,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2021-06-05 12:10:40,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 1.843644544431946) internal successors, (1639), 889 states have internal predecessors, (1639), 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-06-05 12:10:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1639 transitions. [2021-06-05 12:10:40,699 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1639 transitions. Word has length 135 [2021-06-05 12:10:40,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:40,699 INFO L482 AbstractCegarLoop]: Abstraction has 890 states and 1639 transitions. [2021-06-05 12:10:40,699 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 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-06-05 12:10:40,699 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1639 transitions. [2021-06-05 12:10:40,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-06-05 12:10:40,701 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:40,701 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 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] [2021-06-05 12:10:40,916 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-06-05 12:10:40,917 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:40,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:40,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1251344986, now seen corresponding path program 2 times [2021-06-05 12:10:40,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:40,917 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912272130] [2021-06-05 12:10:40,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:41,447 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:10:41,447 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:41,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912272130] [2021-06-05 12:10:41,447 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912272130] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:41,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087793837] [2021-06-05 12:10:41,448 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 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-06-05 12:10:41,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:10:41,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:10:41,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 12:10:41,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:41,574 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-06-05 12:10:41,575 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:41,576 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:41,576 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:41,577 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:10:41,583 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-06-05 12:10:41,583 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:41,587 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:41,587 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:41,588 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:10:41,690 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:10:41,690 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-06-05 12:10:41,692 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:41,695 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:41,696 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:41,696 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:10:41,711 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-06-05 12:10:41,715 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-06-05 12:10:41,716 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:41,719 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:41,720 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:41,725 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:41,726 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:41,726 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:10:41,814 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-05 12:10:41,815 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:41,822 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:41,823 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-06-05 12:10:41,823 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2021-06-05 12:10:42,798 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-06-05 12:10:42,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2021-06-05 12:10:42,854 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:42,859 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:42,862 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-06-05 12:10:42,862 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2021-06-05 12:10:45,373 WARN L205 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-06-05 12:10:51,096 WARN L205 SmtUtils]: Spent 690.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-06-05 12:11:00,023 WARN L205 SmtUtils]: Spent 615.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-06-05 12:11:02,421 WARN L205 SmtUtils]: Spent 559.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-06-05 12:11:04,983 WARN L205 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-06-05 12:11:05,432 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 40 treesize of output 40 [2021-06-05 12:11:05,438 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-06-05 12:11:05,439 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:11:05,445 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:11:05,446 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:11:05,462 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:11:05,475 INFO L550 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2021-06-05 12:11:05,475 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:64, output treesize:45 [2021-06-05 12:11:05,992 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_div_~#cache~0.offset_103| Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| Int) (|aux_mod_~#cache~0.offset_103| Int)) (and (= (select |c_#memory_int| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.base) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* |aux_div_~#cache~0.offset_103| (- 28)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| (* |aux_mod_~#cache~0.offset_103| (- 1))) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset) (< |aux_mod_~#cache~0.offset_103| 28) (<= 0 |aux_mod_~#cache~0.offset_103|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) |aux_div_~#cache~0.offset_103|))) is different from true [2021-06-05 12:11:06,028 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 32 treesize of output 28 [2021-06-05 12:11:06,029 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:11:06,043 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:11:06,055 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2021-06-05 12:11:06,056 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:52, output treesize:45 [2021-06-05 12:11:06,147 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:11:06,147 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087793837] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:11:06,147 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:11:06,147 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 30 [2021-06-05 12:11:06,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021381040] [2021-06-05 12:11:06,148 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 12:11:06,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:11:06,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 12:11:06,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=661, Unknown=33, NotChecked=54, Total=870 [2021-06-05 12:11:06,149 INFO L87 Difference]: Start difference. First operand 890 states and 1639 transitions. Second operand has 30 states, 30 states have (on average 5.133333333333334) internal successors, (154), 30 states have internal predecessors, (154), 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-06-05 12:11:45,654 WARN L205 SmtUtils]: Spent 5.34 s on a formula simplification that was a NOOP. DAG size: 64 [2021-06-05 12:11:51,052 WARN L205 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2021-06-05 12:12:03,465 WARN L205 SmtUtils]: Spent 6.49 s on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2021-06-05 12:12:08,893 WARN L205 SmtUtils]: Spent 3.00 s on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2021-06-05 12:12:13,317 WARN L205 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2021-06-05 12:12:24,785 WARN L205 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2021-06-05 12:12:30,351 WARN L205 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2021-06-05 12:12:37,706 WARN L205 SmtUtils]: Spent 907.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-05 12:12:47,672 WARN L205 SmtUtils]: Spent 1.53 s on a formula simplification that was a NOOP. DAG size: 50 [2021-06-05 12:12:50,505 WARN L205 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2021-06-05 12:13:23,590 WARN L205 SmtUtils]: Spent 4.69 s on a formula simplification that was a NOOP. DAG size: 59 [2021-06-05 12:14:08,243 WARN L205 SmtUtils]: Spent 972.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2021-06-05 12:14:43,844 WARN L205 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2021-06-05 12:15:08,732 WARN L205 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2021-06-05 12:15:58,818 WARN L205 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2021-06-05 12:16:48,024 WARN L205 SmtUtils]: Spent 4.81 s on a formula simplification that was a NOOP. DAG size: 61 [2021-06-05 12:17:12,197 WARN L205 SmtUtils]: Spent 6.24 s on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 12:17:32,151 WARN L205 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2021-06-05 12:18:04,293 WARN L205 SmtUtils]: Spent 3.95 s on a formula simplification that was a NOOP. DAG size: 63 [2021-06-05 12:18:56,272 WARN L205 SmtUtils]: Spent 572.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-06-05 12:19:26,082 WARN L205 SmtUtils]: Spent 4.71 s on a formula simplification that was a NOOP. DAG size: 65 [2021-06-05 12:20:24,097 WARN L205 SmtUtils]: Spent 4.84 s on a formula simplification that was a NOOP. DAG size: 63 [2021-06-05 12:22:40,643 WARN L205 SmtUtils]: Spent 5.54 s on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2021-06-05 12:23:23,654 WARN L205 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2021-06-05 12:24:26,813 WARN L205 SmtUtils]: Spent 5.39 s on a formula simplification. DAG size of input: 89 DAG size of output: 79 Received shutdown request... [2021-06-05 12:25:03,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-05 12:25:04,188 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-05 12:25:04,188 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 12:25:04,189 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT (1/2) [2021-06-05 12:25:04,190 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 12:25:04,191 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:25:04,191 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:25:04,191 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:25:04,191 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:25:04,191 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:25:04,191 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:25:04,191 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:25:04,191 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 12:25:04,194 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 194 places, 236 transitions, 480 flow [2021-06-05 12:25:04,194 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 12:25:04,194 INFO L315 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2021-06-05 12:25:04,195 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 12:25:04,196 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 12:25:04,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 12:25:04 BasicIcfg [2021-06-05 12:25:04,197 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 12:25:04,197 INFO L168 Benchmark]: Toolchain (without parser) took 879839.39 ms. Allocated memory was 341.8 MB in the beginning and 692.1 MB in the end (delta: 350.2 MB). Free memory was 303.2 MB in the beginning and 386.3 MB in the end (delta: -83.0 MB). Peak memory consumption was 269.2 MB. Max. memory is 16.0 GB. [2021-06-05 12:25:04,197 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 341.8 MB. Free memory was 322.1 MB in the beginning and 322.0 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 12:25:04,197 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.73 ms. Allocated memory is still 341.8 MB. Free memory was 303.0 MB in the beginning and 278.1 MB in the end (delta: 24.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 16.0 GB. [2021-06-05 12:25:04,197 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.17 ms. Allocated memory is still 341.8 MB. Free memory was 278.1 MB in the beginning and 275.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 12:25:04,198 INFO L168 Benchmark]: Boogie Preprocessor took 46.93 ms. Allocated memory is still 341.8 MB. Free memory was 274.9 MB in the beginning and 272.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 12:25:04,198 INFO L168 Benchmark]: RCFGBuilder took 639.44 ms. Allocated memory is still 341.8 MB. Free memory was 272.8 MB in the beginning and 229.9 MB in the end (delta: 42.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.0 GB. [2021-06-05 12:25:04,198 INFO L168 Benchmark]: TraceAbstraction took 878335.14 ms. Allocated memory was 341.8 MB in the beginning and 692.1 MB in the end (delta: 350.2 MB). Free memory was 229.9 MB in the beginning and 386.3 MB in the end (delta: -156.4 MB). Peak memory consumption was 196.9 MB. Max. memory is 16.0 GB. [2021-06-05 12:25:04,198 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.14 ms. Allocated memory is still 341.8 MB. Free memory was 322.1 MB in the beginning and 322.0 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 734.73 ms. Allocated memory is still 341.8 MB. Free memory was 303.0 MB in the beginning and 278.1 MB in the end (delta: 24.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 72.17 ms. Allocated memory is still 341.8 MB. Free memory was 278.1 MB in the beginning and 275.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 46.93 ms. Allocated memory is still 341.8 MB. Free memory was 274.9 MB in the beginning and 272.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 639.44 ms. Allocated memory is still 341.8 MB. Free memory was 272.8 MB in the beginning and 229.9 MB in the end (delta: 42.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 878335.14 ms. Allocated memory was 341.8 MB in the beginning and 692.1 MB in the end (delta: 350.2 MB). Free memory was 229.9 MB in the beginning and 386.3 MB in the end (delta: -156.4 MB). Peak memory consumption was 196.9 MB. Max. memory is 16.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 (890states) and FLOYD_HOARE automaton (currently 47 states, 30 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (890states) and FLOYD_HOARE automaton (currently 47 states, 30 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (890states) and FLOYD_HOARE automaton (currently 47 states, 30 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 947]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 194 places, 236 transitions, 480 flow. Already constructed 2 states. Currently 1 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 246 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 878192.4ms, OverallIterations: 15, TraceHistogramMax: 10, EmptinessCheckTime: 52.7ms, AutomataDifference: 843138.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 240.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2717 SDtfs, 6889 SDslu, 14441 SDs, 0 SdLazy, 3058 SolverSat, 347 SolverUnsat, 503 SolverUnknown, 0 SolverNotchecked, 510502.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1488 GetRequests, 1067 SyntacticMatches, 6 SemanticMatches, 414 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5651 ImplicationChecksByTransitivity, 349362.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=8086occurred in iteration=6, InterpolantAutomatonStates: 261, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1180.4ms AutomataMinimizationTime, 14 MinimizatonAttempts, 11849 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 228.0ms SsaConstructionTime, 567.4ms SatisfiabilityAnalysisTime, 29106.2ms InterpolantComputationTime, 2298 NumberOfCodeBlocks, 2233 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2270 ConstructedInterpolants, 42 QuantifiedInterpolants, 9846 SizeOfPredicates, 130 NumberOfNonLiveVariables, 2293 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 28 InterpolantComputations, 5 PerfectInterpolantSequences, 778/1902 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 thread instance sufficiency with 1 thread instances CFG has 3 procedures, 246 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 3.6ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2.9ms, 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