/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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-770125f [2021-05-21 15:37:29,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-21 15:37:29,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-21 15:37:29,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-21 15:37:29,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-21 15:37:29,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-21 15:37:29,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-21 15:37:29,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-21 15:37:29,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-21 15:37:29,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-21 15:37:29,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-21 15:37:29,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-21 15:37:29,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-21 15:37:29,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-21 15:37:29,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-21 15:37:29,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-21 15:37:29,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-21 15:37:29,987 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-21 15:37:29,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-21 15:37:29,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-21 15:37:29,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-21 15:37:29,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-21 15:37:29,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-21 15:37:29,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-21 15:37:30,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-21 15:37:30,001 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-21 15:37:30,001 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-21 15:37:30,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-21 15:37:30,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-21 15:37:30,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-21 15:37:30,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-21 15:37:30,003 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-21 15:37:30,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-21 15:37:30,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-21 15:37:30,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-21 15:37:30,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-21 15:37:30,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-21 15:37:30,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-21 15:37:30,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-21 15:37:30,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-21 15:37:30,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-21 15:37:30,010 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-05-21 15:37:30,036 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-21 15:37:30,037 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-21 15:37:30,037 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-05-21 15:37:30,037 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-05-21 15:37:30,039 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-21 15:37:30,039 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-21 15:37:30,039 INFO L138 SettingsManager]: * Use SBE=true [2021-05-21 15:37:30,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-21 15:37:30,039 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-21 15:37:30,039 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-21 15:37:30,040 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-21 15:37:30,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-21 15:37:30,040 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-21 15:37:30,040 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-21 15:37:30,040 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-21 15:37:30,040 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-21 15:37:30,041 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-21 15:37:30,041 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-21 15:37:30,041 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-21 15:37:30,041 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-21 15:37:30,041 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-21 15:37:30,041 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-21 15:37:30,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-21 15:37:30,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-21 15:37:30,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-21 15:37:30,041 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-21 15:37:30,041 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-21 15:37:30,042 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-21 15:37:30,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-21 15:37:30,042 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-05-21 15:37:30,042 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-21 15:37:30,042 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-05-21 15:37:30,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-21 15:37:30,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-21 15:37:30,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-21 15:37:30,288 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-21 15:37:30,289 INFO L275 PluginConnector]: CDTParser initialized [2021-05-21 15:37:30,289 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2021-05-21 15:37:30,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b830d36/94a74b08fec34b1493111fee9c521c35/FLAGfe07173a4 [2021-05-21 15:37:30,731 INFO L306 CDTParser]: Found 1 translation units. [2021-05-21 15:37:30,732 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2021-05-21 15:37:30,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b830d36/94a74b08fec34b1493111fee9c521c35/FLAGfe07173a4 [2021-05-21 15:37:31,058 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b830d36/94a74b08fec34b1493111fee9c521c35 [2021-05-21 15:37:31,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-21 15:37:31,061 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-05-21 15:37:31,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-21 15:37:31,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-21 15:37:31,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-21 15:37:31,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.05 03:37:31" (1/1) ... [2021-05-21 15:37:31,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc22089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 03:37:31, skipping insertion in model container [2021-05-21 15:37:31,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.05 03:37:31" (1/1) ... [2021-05-21 15:37:31,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-21 15:37:31,127 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-21 15:37:31,228 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-05-21 15:37:31,362 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i[55547,55560] [2021-05-21 15:37:31,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-21 15:37:31,407 INFO L203 MainTranslator]: Completed pre-run [2021-05-21 15:37:31,416 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-05-21 15:37:31,431 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i[55547,55560] [2021-05-21 15:37:31,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-21 15:37:31,529 INFO L208 MainTranslator]: Completed translation [2021-05-21 15:37:31,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 03:37:31 WrapperNode [2021-05-21 15:37:31,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-21 15:37:31,530 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-05-21 15:37:31,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-05-21 15:37:31,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-05-21 15:37:31,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 03:37:31" (1/1) ... [2021-05-21 15:37:31,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 03:37:31" (1/1) ... [2021-05-21 15:37:31,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-05-21 15:37:31,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-21 15:37:31,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-21 15:37:31,556 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-21 15:37:31,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 03:37:31" (1/1) ... [2021-05-21 15:37:31,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 03:37:31" (1/1) ... [2021-05-21 15:37:31,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 03:37:31" (1/1) ... [2021-05-21 15:37:31,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 03:37:31" (1/1) ... [2021-05-21 15:37:31,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 03:37:31" (1/1) ... [2021-05-21 15:37:31,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 03:37:31" (1/1) ... [2021-05-21 15:37:31,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 03:37:31" (1/1) ... [2021-05-21 15:37:31,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-21 15:37:31,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-21 15:37:31,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-21 15:37:31,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-21 15:37:31,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 03:37:31" (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-05-21 15:37:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-05-21 15:37:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-21 15:37:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-21 15:37:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-05-21 15:37:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-21 15:37:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2021-05-21 15:37:31,625 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2021-05-21 15:37:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-05-21 15:37:31,625 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-05-21 15:37:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-05-21 15:37:31,625 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-05-21 15:37:31,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-05-21 15:37:31,628 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-05-21 15:37:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-21 15:37:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-05-21 15:37:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-21 15:37:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-21 15:37:31,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-21 15:37:31,630 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-05-21 15:37:31,984 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-21 15:37:31,984 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-05-21 15:37:31,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.05 03:37:31 BoogieIcfgContainer [2021-05-21 15:37:31,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-21 15:37:31,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-21 15:37:31,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-21 15:37:32,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-21 15:37:32,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.05 03:37:31" (1/3) ... [2021-05-21 15:37:32,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ee6e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.05 03:37:32, skipping insertion in model container [2021-05-21 15:37:32,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 03:37:31" (2/3) ... [2021-05-21 15:37:32,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ee6e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.05 03:37:32, skipping insertion in model container [2021-05-21 15:37:32,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.05 03:37:31" (3/3) ... [2021-05-21 15:37:32,004 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2021-05-21 15:37:32,007 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-05-21 15:37:32,008 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-21 15:37:32,008 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-05-21 15:37:32,008 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-05-21 15:37:32,034 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,034 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,034 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,035 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,035 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,035 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,035 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,036 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,036 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,036 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,036 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,036 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,037 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,037 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,037 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,037 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,037 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,037 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,037 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,037 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,038 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,038 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,038 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,038 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,038 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,039 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,039 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,039 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,039 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,039 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,039 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,039 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,039 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,040 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,040 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,040 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,040 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,040 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,040 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,040 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,041 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,041 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,041 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,041 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,041 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,041 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,041 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,041 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,042 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,042 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,042 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,042 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,042 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,042 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,043 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,043 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,043 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,043 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,043 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,043 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,043 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,043 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,044 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,044 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,044 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,044 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,044 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,044 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,044 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,045 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,045 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,045 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,045 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,045 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,047 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,047 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,047 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,047 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,047 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,047 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,047 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,047 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,048 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,048 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,050 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,051 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,051 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,051 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,055 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,055 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,055 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,055 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,056 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,056 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,056 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,059 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,059 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,059 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,059 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,059 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,059 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,059 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,060 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,060 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,060 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,060 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,060 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,060 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,060 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,060 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,061 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,061 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,061 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,061 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,061 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,061 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,061 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,061 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,062 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,062 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,062 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,062 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,062 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,062 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,062 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,062 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,062 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,062 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,062 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,062 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,063 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,063 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,063 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,063 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,063 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,063 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,063 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,063 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,063 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,063 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,063 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,063 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,063 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,064 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,064 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,064 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,064 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,064 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,064 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,064 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,064 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,064 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,064 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,064 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,064 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,065 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,065 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,065 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,065 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,065 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,065 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,065 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,065 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,065 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,065 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,065 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,065 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,066 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,066 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,066 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,066 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,066 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,066 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,066 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,066 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,066 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,067 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,067 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,067 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,067 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,067 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,067 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,067 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,067 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,067 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,067 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,067 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,067 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,067 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,068 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,068 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,068 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,068 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,068 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,068 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,068 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,068 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,069 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,069 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,069 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,069 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,069 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,069 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,069 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,069 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,069 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,069 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,069 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,069 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,070 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,070 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,073 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,073 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,073 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,073 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,074 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,074 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,074 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,074 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,075 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,075 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,075 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,075 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,076 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,076 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,077 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,077 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,082 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,082 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,083 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,083 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,084 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,084 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,084 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,084 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,088 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,095 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,095 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,095 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,095 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,095 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,096 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,097 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,097 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,097 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,097 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,097 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,097 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,097 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,097 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,097 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,097 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,097 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,097 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,097 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,097 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,098 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,098 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,099 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,100 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,100 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,100 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,100 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,102 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,102 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,102 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,102 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,102 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,102 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,103 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,103 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,103 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,103 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,104 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,104 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,104 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,104 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,110 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,110 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,110 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,110 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,111 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,111 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,112 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,112 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 15:37:32,214 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2021-05-21 15:37:32,240 INFO L255 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2021-05-21 15:37:32,252 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 15:37:32,252 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 15:37:32,252 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 15:37:32,252 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 15:37:32,252 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 15:37:32,252 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 15:37:32,252 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 15:37:32,252 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-21 15:37:32,260 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 197 places, 278 transitions, 936 flow [2021-05-21 15:37:37,405 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 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-05-21 15:37:37,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 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-05-21 15:37:37,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-21 15:37:37,631 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:37:37,632 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-05-21 15:37:37,632 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:37:37,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:37:37,635 INFO L82 PathProgramCache]: Analyzing trace with hash -811265628, now seen corresponding path program 1 times [2021-05-21 15:37:37,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:37:37,665 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732793974] [2021-05-21 15:37:37,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:37:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:37:38,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:37:38,041 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:37:38,041 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732793974] [2021-05-21 15:37:38,042 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732793974] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:37:38,042 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:37:38,042 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-21 15:37:38,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652148183] [2021-05-21 15:37:38,045 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-21 15:37:38,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:37:38,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-21 15:37:38,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-05-21 15:37:38,130 INFO L87 Difference]: Start difference. First operand has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 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 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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-05-21 15:37:39,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:37:39,588 INFO L93 Difference]: Finished difference Result 76010 states and 329094 transitions. [2021-05-21 15:37:39,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-21 15:37:39,589 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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-05-21 15:37:39,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:37:39,956 INFO L225 Difference]: With dead ends: 76010 [2021-05-21 15:37:39,956 INFO L226 Difference]: Without dead ends: 54772 [2021-05-21 15:37:39,957 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 396.9ms TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2021-05-21 15:37:40,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54772 states. [2021-05-21 15:37:41,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54772 to 46283. [2021-05-21 15:37:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46283 states, 46280 states have (on average 4.362337942955921) internal successors, (201889), 46282 states have internal predecessors, (201889), 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-05-21 15:37:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46283 states to 46283 states and 201889 transitions. [2021-05-21 15:37:42,215 INFO L78 Accepts]: Start accepts. Automaton has 46283 states and 201889 transitions. Word has length 41 [2021-05-21 15:37:42,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:37:42,216 INFO L482 AbstractCegarLoop]: Abstraction has 46283 states and 201889 transitions. [2021-05-21 15:37:42,217 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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-05-21 15:37:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 46283 states and 201889 transitions. [2021-05-21 15:37:42,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-21 15:37:42,222 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:37:42,222 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-05-21 15:37:42,222 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-21 15:37:42,222 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:37:42,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:37:42,223 INFO L82 PathProgramCache]: Analyzing trace with hash -589683484, now seen corresponding path program 2 times [2021-05-21 15:37:42,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:37:42,223 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19087987] [2021-05-21 15:37:42,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:37:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:37:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:37:42,560 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:37:42,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19087987] [2021-05-21 15:37:42,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19087987] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:37:42,561 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:37:42,561 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-21 15:37:42,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075108027] [2021-05-21 15:37:42,562 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-21 15:37:42,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:37:42,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-21 15:37:42,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-05-21 15:37:42,564 INFO L87 Difference]: Start difference. First operand 46283 states and 201889 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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-05-21 15:37:43,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:37:43,771 INFO L93 Difference]: Finished difference Result 54799 states and 241924 transitions. [2021-05-21 15:37:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-21 15:37:43,772 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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-05-21 15:37:43,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:37:44,148 INFO L225 Difference]: With dead ends: 54799 [2021-05-21 15:37:44,148 INFO L226 Difference]: Without dead ends: 54799 [2021-05-21 15:37:44,148 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 340.9ms TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-05-21 15:37:44,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54799 states. [2021-05-21 15:37:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54799 to 46286. [2021-05-21 15:37:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46286 states, 46283 states have (on average 4.362120000864248) internal successors, (201892), 46285 states have internal predecessors, (201892), 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-05-21 15:37:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46286 states to 46286 states and 201892 transitions. [2021-05-21 15:37:45,648 INFO L78 Accepts]: Start accepts. Automaton has 46286 states and 201892 transitions. Word has length 41 [2021-05-21 15:37:45,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:37:45,649 INFO L482 AbstractCegarLoop]: Abstraction has 46286 states and 201892 transitions. [2021-05-21 15:37:45,649 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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-05-21 15:37:45,649 INFO L276 IsEmpty]: Start isEmpty. Operand 46286 states and 201892 transitions. [2021-05-21 15:37:45,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-21 15:37:45,650 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:37:45,650 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-05-21 15:37:45,650 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-21 15:37:45,650 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:37:45,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:37:45,650 INFO L82 PathProgramCache]: Analyzing trace with hash 325896192, now seen corresponding path program 3 times [2021-05-21 15:37:45,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:37:45,650 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343722297] [2021-05-21 15:37:45,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:37:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:37:45,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:37:45,849 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:37:45,849 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343722297] [2021-05-21 15:37:45,849 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343722297] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:37:45,849 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:37:45,849 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-21 15:37:45,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997575640] [2021-05-21 15:37:45,849 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-21 15:37:45,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:37:45,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-21 15:37:45,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-05-21 15:37:45,850 INFO L87 Difference]: Start difference. First operand 46286 states and 201892 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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-05-21 15:37:46,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:37:46,603 INFO L93 Difference]: Finished difference Result 54743 states and 241824 transitions. [2021-05-21 15:37:46,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-21 15:37:46,603 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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-05-21 15:37:46,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:37:46,809 INFO L225 Difference]: With dead ends: 54743 [2021-05-21 15:37:46,809 INFO L226 Difference]: Without dead ends: 54743 [2021-05-21 15:37:46,810 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 181.2ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-05-21 15:37:46,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54743 states. [2021-05-21 15:37:48,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54743 to 46227. [2021-05-21 15:37:48,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46227 states, 46225 states have (on average 4.365365062195782) internal successors, (201789), 46226 states have internal predecessors, (201789), 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-05-21 15:37:48,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46227 states to 46227 states and 201789 transitions. [2021-05-21 15:37:48,302 INFO L78 Accepts]: Start accepts. Automaton has 46227 states and 201789 transitions. Word has length 41 [2021-05-21 15:37:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:37:48,302 INFO L482 AbstractCegarLoop]: Abstraction has 46227 states and 201789 transitions. [2021-05-21 15:37:48,302 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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-05-21 15:37:48,303 INFO L276 IsEmpty]: Start isEmpty. Operand 46227 states and 201789 transitions. [2021-05-21 15:37:48,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-05-21 15:37:48,304 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:37:48,304 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, 1, 1] [2021-05-21 15:37:48,305 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-21 15:37:48,305 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:37:48,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:37:48,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2119961237, now seen corresponding path program 1 times [2021-05-21 15:37:48,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:37:48,305 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396775574] [2021-05-21 15:37:48,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:37:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:37:48,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:37:48,345 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:37:48,345 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396775574] [2021-05-21 15:37:48,345 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396775574] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:37:48,345 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:37:48,345 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 15:37:48,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134719974] [2021-05-21 15:37:48,346 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 15:37:48,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:37:48,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 15:37:48,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-21 15:37:48,346 INFO L87 Difference]: Start difference. First operand 46227 states and 201789 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:37:49,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:37:49,184 INFO L93 Difference]: Finished difference Result 96773 states and 411557 transitions. [2021-05-21 15:37:49,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-21 15:37:49,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-05-21 15:37:49,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:37:49,394 INFO L225 Difference]: With dead ends: 96773 [2021-05-21 15:37:49,395 INFO L226 Difference]: Without dead ends: 61407 [2021-05-21 15:37:49,395 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 35.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-21 15:37:49,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61407 states. [2021-05-21 15:37:50,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61407 to 49089. [2021-05-21 15:37:50,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49089 states, 49087 states have (on average 4.207203536577913) internal successors, (206519), 49088 states have internal predecessors, (206519), 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-05-21 15:37:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49089 states to 49089 states and 206519 transitions. [2021-05-21 15:37:50,993 INFO L78 Accepts]: Start accepts. Automaton has 49089 states and 206519 transitions. Word has length 54 [2021-05-21 15:37:50,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:37:50,994 INFO L482 AbstractCegarLoop]: Abstraction has 49089 states and 206519 transitions. [2021-05-21 15:37:50,994 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:37:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 49089 states and 206519 transitions. [2021-05-21 15:37:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-21 15:37:51,001 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:37:51,001 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, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:37:51,001 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-21 15:37:51,002 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:37:51,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:37:51,002 INFO L82 PathProgramCache]: Analyzing trace with hash 319566966, now seen corresponding path program 1 times [2021-05-21 15:37:51,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:37:51,002 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12961493] [2021-05-21 15:37:51,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:37:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:37:51,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:37:51,078 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:37:51,078 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12961493] [2021-05-21 15:37:51,079 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12961493] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:37:51,079 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:37:51,079 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-21 15:37:51,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065738292] [2021-05-21 15:37:51,079 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-21 15:37:51,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:37:51,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-21 15:37:51,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-05-21 15:37:51,080 INFO L87 Difference]: Start difference. First operand 49089 states and 206519 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:37:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:37:51,624 INFO L93 Difference]: Finished difference Result 67425 states and 276590 transitions. [2021-05-21 15:37:51,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-21 15:37:51,626 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-05-21 15:37:51,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:37:52,089 INFO L225 Difference]: With dead ends: 67425 [2021-05-21 15:37:52,089 INFO L226 Difference]: Without dead ends: 61341 [2021-05-21 15:37:52,090 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 110.4ms TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2021-05-21 15:37:52,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61341 states. [2021-05-21 15:37:53,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61341 to 48869. [2021-05-21 15:37:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48869 states, 48867 states have (on average 4.211697055272475) internal successors, (205813), 48868 states have internal predecessors, (205813), 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-05-21 15:37:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48869 states to 48869 states and 205813 transitions. [2021-05-21 15:37:53,310 INFO L78 Accepts]: Start accepts. Automaton has 48869 states and 205813 transitions. Word has length 59 [2021-05-21 15:37:53,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:37:53,310 INFO L482 AbstractCegarLoop]: Abstraction has 48869 states and 205813 transitions. [2021-05-21 15:37:53,310 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:37:53,310 INFO L276 IsEmpty]: Start isEmpty. Operand 48869 states and 205813 transitions. [2021-05-21 15:37:53,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-05-21 15:37:53,317 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:37:53,317 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:37:53,317 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-21 15:37:53,318 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:37:53,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:37:53,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1864004856, now seen corresponding path program 1 times [2021-05-21 15:37:53,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:37:53,318 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785852327] [2021-05-21 15:37:53,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:37:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:37:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:37:53,828 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:37:53,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785852327] [2021-05-21 15:37:53,828 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785852327] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:37:53,828 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:37:53,828 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-21 15:37:53,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621311983] [2021-05-21 15:37:53,829 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-21 15:37:53,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:37:53,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-21 15:37:53,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-05-21 15:37:53,829 INFO L87 Difference]: Start difference. First operand 48869 states and 205813 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 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-05-21 15:37:55,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:37:55,534 INFO L93 Difference]: Finished difference Result 57826 states and 244284 transitions. [2021-05-21 15:37:55,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-21 15:37:55,535 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 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 60 [2021-05-21 15:37:55,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:37:55,688 INFO L225 Difference]: With dead ends: 57826 [2021-05-21 15:37:55,688 INFO L226 Difference]: Without dead ends: 57556 [2021-05-21 15:37:55,689 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 872.2ms TimeCoverageRelationStatistics Valid=174, Invalid=1158, Unknown=0, NotChecked=0, Total=1332 [2021-05-21 15:37:55,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57556 states. [2021-05-21 15:37:56,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57556 to 54249. [2021-05-21 15:37:56,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54249 states, 54247 states have (on average 4.2520139362545395) internal successors, (230659), 54248 states have internal predecessors, (230659), 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-05-21 15:37:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54249 states to 54249 states and 230659 transitions. [2021-05-21 15:37:57,328 INFO L78 Accepts]: Start accepts. Automaton has 54249 states and 230659 transitions. Word has length 60 [2021-05-21 15:37:57,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:37:57,329 INFO L482 AbstractCegarLoop]: Abstraction has 54249 states and 230659 transitions. [2021-05-21 15:37:57,329 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 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-05-21 15:37:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 54249 states and 230659 transitions. [2021-05-21 15:37:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-05-21 15:37:57,338 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:37:57,338 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:37:57,339 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-21 15:37:57,339 INFO L430 AbstractCegarLoop]: === Iteration 7 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:37:57,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:37:57,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1211952212, now seen corresponding path program 2 times [2021-05-21 15:37:57,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:37:57,339 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109764125] [2021-05-21 15:37:57,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:37:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:37:57,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:37:57,676 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:37:57,677 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109764125] [2021-05-21 15:37:57,677 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109764125] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:37:57,677 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:37:57,677 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-21 15:37:57,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638264958] [2021-05-21 15:37:57,677 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-21 15:37:57,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:37:57,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-21 15:37:57,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-05-21 15:37:57,678 INFO L87 Difference]: Start difference. First operand 54249 states and 230659 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 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-05-21 15:37:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:37:59,174 INFO L93 Difference]: Finished difference Result 63262 states and 269281 transitions. [2021-05-21 15:37:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-21 15:37:59,175 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 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 60 [2021-05-21 15:37:59,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:37:59,364 INFO L225 Difference]: With dead ends: 63262 [2021-05-21 15:37:59,364 INFO L226 Difference]: Without dead ends: 62992 [2021-05-21 15:37:59,364 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 565.2ms TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2021-05-21 15:37:59,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62992 states. [2021-05-21 15:38:00,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62992 to 54264. [2021-05-21 15:38:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54264 states, 54262 states have (on average 4.2514466846043275) internal successors, (230692), 54263 states have internal predecessors, (230692), 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-05-21 15:38:00,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54264 states to 54264 states and 230692 transitions. [2021-05-21 15:38:00,744 INFO L78 Accepts]: Start accepts. Automaton has 54264 states and 230692 transitions. Word has length 60 [2021-05-21 15:38:00,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:38:00,744 INFO L482 AbstractCegarLoop]: Abstraction has 54264 states and 230692 transitions. [2021-05-21 15:38:00,744 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 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-05-21 15:38:00,744 INFO L276 IsEmpty]: Start isEmpty. Operand 54264 states and 230692 transitions. [2021-05-21 15:38:00,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-05-21 15:38:00,752 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:38:00,752 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:38:00,752 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-21 15:38:00,752 INFO L430 AbstractCegarLoop]: === Iteration 8 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:38:00,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:38:00,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1520073798, now seen corresponding path program 3 times [2021-05-21 15:38:00,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:38:00,753 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356802702] [2021-05-21 15:38:00,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:38:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:38:01,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:38:01,040 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:38:01,040 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356802702] [2021-05-21 15:38:01,040 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356802702] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:38:01,040 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:38:01,040 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-21 15:38:01,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707591792] [2021-05-21 15:38:01,041 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-21 15:38:01,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:38:01,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-21 15:38:01,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-05-21 15:38:01,041 INFO L87 Difference]: Start difference. First operand 54264 states and 230692 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 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-05-21 15:38:01,672 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-05-21 15:38:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:38:02,351 INFO L93 Difference]: Finished difference Result 63260 states and 269245 transitions. [2021-05-21 15:38:02,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-21 15:38:02,352 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 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 60 [2021-05-21 15:38:02,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:38:02,527 INFO L225 Difference]: With dead ends: 63260 [2021-05-21 15:38:02,527 INFO L226 Difference]: Without dead ends: 62990 [2021-05-21 15:38:02,527 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 735.6ms TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2021-05-21 15:38:02,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62990 states. [2021-05-21 15:38:03,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62990 to 54281. [2021-05-21 15:38:03,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54281 states, 54279 states have (on average 4.250759962416404) internal successors, (230727), 54280 states have internal predecessors, (230727), 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-05-21 15:38:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54281 states to 54281 states and 230727 transitions. [2021-05-21 15:38:04,313 INFO L78 Accepts]: Start accepts. Automaton has 54281 states and 230727 transitions. Word has length 60 [2021-05-21 15:38:04,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:38:04,327 INFO L482 AbstractCegarLoop]: Abstraction has 54281 states and 230727 transitions. [2021-05-21 15:38:04,331 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 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-05-21 15:38:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 54281 states and 230727 transitions. [2021-05-21 15:38:04,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-05-21 15:38:04,341 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:38:04,341 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:38:04,341 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-21 15:38:04,341 INFO L430 AbstractCegarLoop]: === Iteration 9 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:38:04,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:38:04,342 INFO L82 PathProgramCache]: Analyzing trace with hash -181639794, now seen corresponding path program 4 times [2021-05-21 15:38:04,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:38:04,343 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738905352] [2021-05-21 15:38:04,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:38:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:38:04,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:38:04,591 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:38:04,591 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738905352] [2021-05-21 15:38:04,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738905352] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:38:04,591 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:38:04,591 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-21 15:38:04,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688836890] [2021-05-21 15:38:04,592 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-21 15:38:04,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:38:04,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-21 15:38:04,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-05-21 15:38:04,592 INFO L87 Difference]: Start difference. First operand 54281 states and 230727 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 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-05-21 15:38:05,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:38:05,469 INFO L93 Difference]: Finished difference Result 63305 states and 269323 transitions. [2021-05-21 15:38:05,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-21 15:38:05,469 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 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 60 [2021-05-21 15:38:05,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:38:05,653 INFO L225 Difference]: With dead ends: 63305 [2021-05-21 15:38:05,653 INFO L226 Difference]: Without dead ends: 63035 [2021-05-21 15:38:05,653 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 351.3ms TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2021-05-21 15:38:06,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63035 states. [2021-05-21 15:38:06,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63035 to 54310. [2021-05-21 15:38:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54310 states, 54308 states have (on average 4.249318700743905) internal successors, (230772), 54309 states have internal predecessors, (230772), 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-05-21 15:38:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54310 states to 54310 states and 230772 transitions. [2021-05-21 15:38:07,420 INFO L78 Accepts]: Start accepts. Automaton has 54310 states and 230772 transitions. Word has length 60 [2021-05-21 15:38:07,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:38:07,420 INFO L482 AbstractCegarLoop]: Abstraction has 54310 states and 230772 transitions. [2021-05-21 15:38:07,420 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 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-05-21 15:38:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 54310 states and 230772 transitions. [2021-05-21 15:38:07,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-05-21 15:38:07,429 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:38:07,429 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:38:07,429 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-21 15:38:07,429 INFO L430 AbstractCegarLoop]: === Iteration 10 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:38:07,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:38:07,429 INFO L82 PathProgramCache]: Analyzing trace with hash -994232682, now seen corresponding path program 5 times [2021-05-21 15:38:07,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:38:07,429 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657815574] [2021-05-21 15:38:07,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:38:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:38:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:38:07,635 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:38:07,635 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657815574] [2021-05-21 15:38:07,635 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657815574] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:38:07,635 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:38:07,635 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-21 15:38:07,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711599568] [2021-05-21 15:38:07,635 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-21 15:38:07,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:38:07,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-21 15:38:07,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-05-21 15:38:07,636 INFO L87 Difference]: Start difference. First operand 54310 states and 230772 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 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-05-21 15:38:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:38:08,205 INFO L93 Difference]: Finished difference Result 63086 states and 268677 transitions. [2021-05-21 15:38:08,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-21 15:38:08,205 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 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 60 [2021-05-21 15:38:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:38:08,370 INFO L225 Difference]: With dead ends: 63086 [2021-05-21 15:38:08,370 INFO L226 Difference]: Without dead ends: 62816 [2021-05-21 15:38:08,371 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 204.7ms TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-05-21 15:38:08,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62816 states. [2021-05-21 15:38:09,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62816 to 54062. [2021-05-21 15:38:09,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54062 states, 54060 states have (on average 4.256030336662967) internal successors, (230081), 54061 states have internal predecessors, (230081), 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-05-21 15:38:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54062 states to 54062 states and 230081 transitions. [2021-05-21 15:38:10,056 INFO L78 Accepts]: Start accepts. Automaton has 54062 states and 230081 transitions. Word has length 60 [2021-05-21 15:38:10,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:38:10,056 INFO L482 AbstractCegarLoop]: Abstraction has 54062 states and 230081 transitions. [2021-05-21 15:38:10,057 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 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-05-21 15:38:10,057 INFO L276 IsEmpty]: Start isEmpty. Operand 54062 states and 230081 transitions. [2021-05-21 15:38:10,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-21 15:38:10,067 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:38:10,068 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:38:10,068 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-21 15:38:10,068 INFO L430 AbstractCegarLoop]: === Iteration 11 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:38:10,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:38:10,068 INFO L82 PathProgramCache]: Analyzing trace with hash -114684342, now seen corresponding path program 1 times [2021-05-21 15:38:10,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:38:10,068 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703756367] [2021-05-21 15:38:10,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:38:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:38:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:38:10,511 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:38:10,511 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703756367] [2021-05-21 15:38:10,511 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703756367] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:38:10,511 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:38:10,511 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-21 15:38:10,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655235760] [2021-05-21 15:38:10,512 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-21 15:38:10,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:38:10,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-21 15:38:10,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-05-21 15:38:10,514 INFO L87 Difference]: Start difference. First operand 54062 states and 230081 transitions. Second operand has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 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-05-21 15:38:12,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:38:12,102 INFO L93 Difference]: Finished difference Result 65701 states and 278957 transitions. [2021-05-21 15:38:12,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-21 15:38:12,103 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 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 62 [2021-05-21 15:38:12,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:38:12,288 INFO L225 Difference]: With dead ends: 65701 [2021-05-21 15:38:12,288 INFO L226 Difference]: Without dead ends: 65359 [2021-05-21 15:38:12,289 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 797.5ms TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2021-05-21 15:38:12,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65359 states. [2021-05-21 15:38:13,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65359 to 60588. [2021-05-21 15:38:13,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60588 states, 60586 states have (on average 4.283184233981448) internal successors, (259501), 60587 states have internal predecessors, (259501), 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-05-21 15:38:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60588 states to 60588 states and 259501 transitions. [2021-05-21 15:38:13,731 INFO L78 Accepts]: Start accepts. Automaton has 60588 states and 259501 transitions. Word has length 62 [2021-05-21 15:38:13,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:38:13,732 INFO L482 AbstractCegarLoop]: Abstraction has 60588 states and 259501 transitions. [2021-05-21 15:38:13,732 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 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-05-21 15:38:13,732 INFO L276 IsEmpty]: Start isEmpty. Operand 60588 states and 259501 transitions. [2021-05-21 15:38:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-21 15:38:13,746 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:38:13,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:38:13,746 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-21 15:38:13,746 INFO L430 AbstractCegarLoop]: === Iteration 12 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:38:13,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:38:13,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1301917267, now seen corresponding path program 1 times [2021-05-21 15:38:13,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:38:13,746 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047179565] [2021-05-21 15:38:13,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:38:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:38:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:38:14,217 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:38:14,218 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047179565] [2021-05-21 15:38:14,218 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047179565] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:38:14,218 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:38:14,218 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-21 15:38:14,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331340258] [2021-05-21 15:38:14,218 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-21 15:38:14,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:38:14,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-21 15:38:14,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2021-05-21 15:38:14,219 INFO L87 Difference]: Start difference. First operand 60588 states and 259501 transitions. Second operand has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 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-05-21 15:38:15,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:38:15,941 INFO L93 Difference]: Finished difference Result 71076 states and 302873 transitions. [2021-05-21 15:38:15,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-21 15:38:15,942 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 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 62 [2021-05-21 15:38:15,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:38:16,125 INFO L225 Difference]: With dead ends: 71076 [2021-05-21 15:38:16,125 INFO L226 Difference]: Without dead ends: 70734 [2021-05-21 15:38:16,126 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 802.4ms TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2021-05-21 15:38:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70734 states. [2021-05-21 15:38:17,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70734 to 60588. [2021-05-21 15:38:17,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60588 states, 60586 states have (on average 4.283184233981448) internal successors, (259501), 60587 states have internal predecessors, (259501), 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-05-21 15:38:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60588 states to 60588 states and 259501 transitions. [2021-05-21 15:38:17,976 INFO L78 Accepts]: Start accepts. Automaton has 60588 states and 259501 transitions. Word has length 62 [2021-05-21 15:38:17,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:38:17,976 INFO L482 AbstractCegarLoop]: Abstraction has 60588 states and 259501 transitions. [2021-05-21 15:38:17,976 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 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-05-21 15:38:17,976 INFO L276 IsEmpty]: Start isEmpty. Operand 60588 states and 259501 transitions. [2021-05-21 15:38:17,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-21 15:38:17,989 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:38:17,989 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:38:17,989 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-21 15:38:17,989 INFO L430 AbstractCegarLoop]: === Iteration 13 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:38:17,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:38:17,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1765911259, now seen corresponding path program 2 times [2021-05-21 15:38:17,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:38:17,989 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60919906] [2021-05-21 15:38:17,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:38:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:38:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:38:18,313 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:38:18,313 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60919906] [2021-05-21 15:38:18,313 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60919906] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:38:18,313 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:38:18,313 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 15:38:18,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703185625] [2021-05-21 15:38:18,313 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 15:38:18,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:38:18,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 15:38:18,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-05-21 15:38:18,314 INFO L87 Difference]: Start difference. First operand 60588 states and 259501 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 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-05-21 15:38:19,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:38:19,732 INFO L93 Difference]: Finished difference Result 73658 states and 314685 transitions. [2021-05-21 15:38:19,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-21 15:38:19,732 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 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 62 [2021-05-21 15:38:19,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:38:19,940 INFO L225 Difference]: With dead ends: 73658 [2021-05-21 15:38:19,940 INFO L226 Difference]: Without dead ends: 73316 [2021-05-21 15:38:19,941 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 559.1ms TimeCoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2021-05-21 15:38:20,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73316 states. [2021-05-21 15:38:21,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73316 to 57618. [2021-05-21 15:38:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57618 states, 57616 states have (on average 4.267998472646487) internal successors, (245905), 57617 states have internal predecessors, (245905), 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-05-21 15:38:21,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57618 states to 57618 states and 245905 transitions. [2021-05-21 15:38:21,381 INFO L78 Accepts]: Start accepts. Automaton has 57618 states and 245905 transitions. Word has length 62 [2021-05-21 15:38:21,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:38:21,381 INFO L482 AbstractCegarLoop]: Abstraction has 57618 states and 245905 transitions. [2021-05-21 15:38:21,381 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 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-05-21 15:38:21,382 INFO L276 IsEmpty]: Start isEmpty. Operand 57618 states and 245905 transitions. [2021-05-21 15:38:21,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-21 15:38:21,394 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:38:21,394 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:38:21,394 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-21 15:38:21,394 INFO L430 AbstractCegarLoop]: === Iteration 14 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:38:21,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:38:21,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1261621970, now seen corresponding path program 2 times [2021-05-21 15:38:21,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:38:21,394 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84846774] [2021-05-21 15:38:21,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:38:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:38:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:38:21,608 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:38:21,608 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84846774] [2021-05-21 15:38:21,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84846774] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:38:21,608 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:38:21,608 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-21 15:38:21,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542134504] [2021-05-21 15:38:21,608 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-21 15:38:21,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:38:21,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-21 15:38:21,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-05-21 15:38:21,609 INFO L87 Difference]: Start difference. First operand 57618 states and 245905 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 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-05-21 15:38:22,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:38:22,918 INFO L93 Difference]: Finished difference Result 65384 states and 277429 transitions. [2021-05-21 15:38:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-21 15:38:22,918 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 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 62 [2021-05-21 15:38:22,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:38:23,089 INFO L225 Difference]: With dead ends: 65384 [2021-05-21 15:38:23,089 INFO L226 Difference]: Without dead ends: 65042 [2021-05-21 15:38:23,089 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 393.9ms TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2021-05-21 15:38:23,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65042 states. [2021-05-21 15:38:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65042 to 57621. [2021-05-21 15:38:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57621 states, 57619 states have (on average 4.267828320519273) internal successors, (245908), 57620 states have internal predecessors, (245908), 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-05-21 15:38:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57621 states to 57621 states and 245908 transitions. [2021-05-21 15:38:24,571 INFO L78 Accepts]: Start accepts. Automaton has 57621 states and 245908 transitions. Word has length 62 [2021-05-21 15:38:24,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:38:24,571 INFO L482 AbstractCegarLoop]: Abstraction has 57621 states and 245908 transitions. [2021-05-21 15:38:24,571 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 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-05-21 15:38:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 57621 states and 245908 transitions. [2021-05-21 15:38:24,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-21 15:38:24,584 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:38:24,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:38:24,584 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-21 15:38:24,584 INFO L430 AbstractCegarLoop]: === Iteration 15 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:38:24,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:38:24,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1971465376, now seen corresponding path program 3 times [2021-05-21 15:38:24,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:38:24,584 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304420826] [2021-05-21 15:38:24,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:38:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:38:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:38:24,768 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:38:24,768 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304420826] [2021-05-21 15:38:24,768 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304420826] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:38:24,768 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:38:24,768 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-21 15:38:24,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291333080] [2021-05-21 15:38:24,769 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-21 15:38:24,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:38:24,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-21 15:38:24,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-05-21 15:38:24,769 INFO L87 Difference]: Start difference. First operand 57621 states and 245908 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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-05-21 15:38:25,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:38:25,879 INFO L93 Difference]: Finished difference Result 65409 states and 277466 transitions. [2021-05-21 15:38:25,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-21 15:38:25,879 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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 62 [2021-05-21 15:38:25,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:38:26,049 INFO L225 Difference]: With dead ends: 65409 [2021-05-21 15:38:26,050 INFO L226 Difference]: Without dead ends: 65067 [2021-05-21 15:38:26,050 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 665.3ms TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-05-21 15:38:26,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65067 states. [2021-05-21 15:38:27,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65067 to 57649. [2021-05-21 15:38:27,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57649 states, 57647 states have (on average 4.266518639304734) internal successors, (245952), 57648 states have internal predecessors, (245952), 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-05-21 15:38:27,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57649 states to 57649 states and 245952 transitions. [2021-05-21 15:38:27,520 INFO L78 Accepts]: Start accepts. Automaton has 57649 states and 245952 transitions. Word has length 62 [2021-05-21 15:38:27,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:38:27,521 INFO L482 AbstractCegarLoop]: Abstraction has 57649 states and 245952 transitions. [2021-05-21 15:38:27,521 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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-05-21 15:38:27,521 INFO L276 IsEmpty]: Start isEmpty. Operand 57649 states and 245952 transitions. [2021-05-21 15:38:27,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-21 15:38:27,533 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:38:27,533 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:38:27,533 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-21 15:38:27,533 INFO L430 AbstractCegarLoop]: === Iteration 16 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:38:27,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:38:27,534 INFO L82 PathProgramCache]: Analyzing trace with hash 116713492, now seen corresponding path program 4 times [2021-05-21 15:38:27,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:38:27,534 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557874087] [2021-05-21 15:38:27,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:38:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:38:27,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:38:27,705 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:38:27,705 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557874087] [2021-05-21 15:38:27,705 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557874087] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:38:27,705 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:38:27,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-21 15:38:27,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753164846] [2021-05-21 15:38:27,706 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-21 15:38:27,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:38:27,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-21 15:38:27,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-05-21 15:38:27,706 INFO L87 Difference]: Start difference. First operand 57649 states and 245952 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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-05-21 15:38:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:38:28,600 INFO L93 Difference]: Finished difference Result 60948 states and 256662 transitions. [2021-05-21 15:38:28,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-21 15:38:28,600 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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 62 [2021-05-21 15:38:28,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:38:28,772 INFO L225 Difference]: With dead ends: 60948 [2021-05-21 15:38:28,772 INFO L226 Difference]: Without dead ends: 60606 [2021-05-21 15:38:28,772 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 186.1ms TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-05-21 15:38:28,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60606 states. [2021-05-21 15:38:29,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60606 to 53160. [2021-05-21 15:38:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53160 states, 53158 states have (on average 4.234621317581549) internal successors, (225104), 53159 states have internal predecessors, (225104), 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-05-21 15:38:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53160 states to 53160 states and 225104 transitions. [2021-05-21 15:38:30,176 INFO L78 Accepts]: Start accepts. Automaton has 53160 states and 225104 transitions. Word has length 62 [2021-05-21 15:38:30,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:38:30,176 INFO L482 AbstractCegarLoop]: Abstraction has 53160 states and 225104 transitions. [2021-05-21 15:38:30,176 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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-05-21 15:38:30,176 INFO L276 IsEmpty]: Start isEmpty. Operand 53160 states and 225104 transitions. [2021-05-21 15:38:30,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-21 15:38:30,192 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:38:30,192 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:38:30,192 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-21 15:38:30,192 INFO L430 AbstractCegarLoop]: === Iteration 17 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:38:30,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:38:30,192 INFO L82 PathProgramCache]: Analyzing trace with hash -27681967, now seen corresponding path program 1 times [2021-05-21 15:38:30,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:38:30,192 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245175508] [2021-05-21 15:38:30,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:38:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:38:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:38:30,611 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:38:30,611 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245175508] [2021-05-21 15:38:30,611 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245175508] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:38:30,611 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:38:30,611 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-21 15:38:30,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773979383] [2021-05-21 15:38:30,611 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-21 15:38:30,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:38:30,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-21 15:38:30,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-05-21 15:38:30,612 INFO L87 Difference]: Start difference. First operand 53160 states and 225104 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 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-05-21 15:38:31,286 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2021-05-21 15:38:32,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:38:32,523 INFO L93 Difference]: Finished difference Result 64389 states and 274500 transitions. [2021-05-21 15:38:32,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-21 15:38:32,524 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 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 65 [2021-05-21 15:38:32,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:38:32,690 INFO L225 Difference]: With dead ends: 64389 [2021-05-21 15:38:32,690 INFO L226 Difference]: Without dead ends: 64119 [2021-05-21 15:38:32,690 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1159.5ms TimeCoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2021-05-21 15:38:32,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64119 states. [2021-05-21 15:38:33,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64119 to 54940. [2021-05-21 15:38:33,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54940 states, 54938 states have (on average 4.293439877680294) internal successors, (235873), 54939 states have internal predecessors, (235873), 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-05-21 15:38:34,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54940 states to 54940 states and 235873 transitions. [2021-05-21 15:38:34,459 INFO L78 Accepts]: Start accepts. Automaton has 54940 states and 235873 transitions. Word has length 65 [2021-05-21 15:38:34,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:38:34,459 INFO L482 AbstractCegarLoop]: Abstraction has 54940 states and 235873 transitions. [2021-05-21 15:38:34,459 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 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-05-21 15:38:34,459 INFO L276 IsEmpty]: Start isEmpty. Operand 54940 states and 235873 transitions. [2021-05-21 15:38:34,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-21 15:38:34,515 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:38:34,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:38:34,515 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-21 15:38:34,515 INFO L430 AbstractCegarLoop]: === Iteration 18 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:38:34,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:38:34,537 INFO L82 PathProgramCache]: Analyzing trace with hash 225742194, now seen corresponding path program 1 times [2021-05-21 15:38:34,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:38:34,537 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739527656] [2021-05-21 15:38:34,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:38:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:38:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:38:34,626 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:38:34,626 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739527656] [2021-05-21 15:38:34,626 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739527656] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:38:34,626 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:38:34,626 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-21 15:38:34,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070462976] [2021-05-21 15:38:34,628 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-21 15:38:34,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:38:34,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-21 15:38:34,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-05-21 15:38:34,628 INFO L87 Difference]: Start difference. First operand 54940 states and 235873 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 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-05-21 15:38:35,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:38:35,472 INFO L93 Difference]: Finished difference Result 74107 states and 309485 transitions. [2021-05-21 15:38:35,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-21 15:38:35,472 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 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 65 [2021-05-21 15:38:35,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:38:35,707 INFO L225 Difference]: With dead ends: 74107 [2021-05-21 15:38:35,708 INFO L226 Difference]: Without dead ends: 67995 [2021-05-21 15:38:35,709 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 121.1ms TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2021-05-21 15:38:35,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67995 states. [2021-05-21 15:38:37,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67995 to 55174. [2021-05-21 15:38:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55174 states, 55172 states have (on average 4.289802798520989) internal successors, (236677), 55173 states have internal predecessors, (236677), 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-05-21 15:38:37,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55174 states to 55174 states and 236677 transitions. [2021-05-21 15:38:37,490 INFO L78 Accepts]: Start accepts. Automaton has 55174 states and 236677 transitions. Word has length 65 [2021-05-21 15:38:37,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:38:37,490 INFO L482 AbstractCegarLoop]: Abstraction has 55174 states and 236677 transitions. [2021-05-21 15:38:37,490 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 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-05-21 15:38:37,491 INFO L276 IsEmpty]: Start isEmpty. Operand 55174 states and 236677 transitions. [2021-05-21 15:38:37,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-21 15:38:37,513 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:38:37,513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:38:37,513 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-21 15:38:37,513 INFO L430 AbstractCegarLoop]: === Iteration 19 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:38:37,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:38:37,515 INFO L82 PathProgramCache]: Analyzing trace with hash -405027412, now seen corresponding path program 2 times [2021-05-21 15:38:37,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:38:37,515 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501907121] [2021-05-21 15:38:37,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:38:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:38:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:38:37,598 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:38:37,598 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501907121] [2021-05-21 15:38:37,598 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501907121] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:38:37,598 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:38:37,598 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-21 15:38:37,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047585287] [2021-05-21 15:38:37,599 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-21 15:38:37,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:38:37,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-21 15:38:37,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-05-21 15:38:37,599 INFO L87 Difference]: Start difference. First operand 55174 states and 236677 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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-05-21 15:38:37,990 WARN L205 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2021-05-21 15:38:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:38:38,604 INFO L93 Difference]: Finished difference Result 72794 states and 304360 transitions. [2021-05-21 15:38:38,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-21 15:38:38,605 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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 65 [2021-05-21 15:38:38,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:38:38,790 INFO L225 Difference]: With dead ends: 72794 [2021-05-21 15:38:38,791 INFO L226 Difference]: Without dead ends: 66814 [2021-05-21 15:38:38,791 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 520.5ms TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2021-05-21 15:38:38,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66814 states. [2021-05-21 15:38:40,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66814 to 54455. [2021-05-21 15:38:40,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54455 states, 54453 states have (on average 4.294363946889979) internal successors, (233841), 54454 states have internal predecessors, (233841), 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-05-21 15:38:40,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54455 states to 54455 states and 233841 transitions. [2021-05-21 15:38:40,289 INFO L78 Accepts]: Start accepts. Automaton has 54455 states and 233841 transitions. Word has length 65 [2021-05-21 15:38:40,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:38:40,290 INFO L482 AbstractCegarLoop]: Abstraction has 54455 states and 233841 transitions. [2021-05-21 15:38:40,290 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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-05-21 15:38:40,290 INFO L276 IsEmpty]: Start isEmpty. Operand 54455 states and 233841 transitions. [2021-05-21 15:38:40,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-21 15:38:40,314 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:38:40,314 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:38:40,314 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-21 15:38:40,314 INFO L430 AbstractCegarLoop]: === Iteration 20 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:38:40,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:38:40,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1600315377, now seen corresponding path program 1 times [2021-05-21 15:38:40,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:38:40,315 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760083600] [2021-05-21 15:38:40,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:38:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:38:41,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:38:41,067 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:38:41,068 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760083600] [2021-05-21 15:38:41,068 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760083600] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:38:41,068 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:38:41,068 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-21 15:38:41,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044200284] [2021-05-21 15:38:41,068 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-21 15:38:41,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:38:41,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-21 15:38:41,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2021-05-21 15:38:41,069 INFO L87 Difference]: Start difference. First operand 54455 states and 233841 transitions. Second operand has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 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-05-21 15:38:42,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:38:42,469 INFO L93 Difference]: Finished difference Result 60956 states and 259147 transitions. [2021-05-21 15:38:42,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-21 15:38:42,469 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 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 67 [2021-05-21 15:38:42,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:38:42,628 INFO L225 Difference]: With dead ends: 60956 [2021-05-21 15:38:42,628 INFO L226 Difference]: Without dead ends: 60614 [2021-05-21 15:38:42,628 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1194.7ms TimeCoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2021-05-21 15:38:42,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60614 states. [2021-05-21 15:38:43,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60614 to 49129. [2021-05-21 15:38:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49129 states, 49127 states have (on average 4.269749832067905) internal successors, (209760), 49128 states have internal predecessors, (209760), 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-05-21 15:38:43,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49129 states to 49129 states and 209760 transitions. [2021-05-21 15:38:43,895 INFO L78 Accepts]: Start accepts. Automaton has 49129 states and 209760 transitions. Word has length 67 [2021-05-21 15:38:43,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:38:43,895 INFO L482 AbstractCegarLoop]: Abstraction has 49129 states and 209760 transitions. [2021-05-21 15:38:43,896 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 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-05-21 15:38:43,896 INFO L276 IsEmpty]: Start isEmpty. Operand 49129 states and 209760 transitions. [2021-05-21 15:38:43,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-21 15:38:43,921 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:38:43,921 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:38:43,921 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-21 15:38:43,921 INFO L430 AbstractCegarLoop]: === Iteration 21 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:38:43,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:38:43,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1860189259, now seen corresponding path program 1 times [2021-05-21 15:38:43,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:38:43,922 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738360579] [2021-05-21 15:38:43,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:38:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:38:44,221 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2021-05-21 15:38:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:38:44,642 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:38:44,642 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738360579] [2021-05-21 15:38:44,642 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738360579] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:38:44,642 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:38:44,642 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-21 15:38:44,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860740223] [2021-05-21 15:38:44,642 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-21 15:38:44,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:38:44,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-21 15:38:44,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2021-05-21 15:38:44,643 INFO L87 Difference]: Start difference. First operand 49129 states and 209760 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:38:46,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:38:46,152 INFO L93 Difference]: Finished difference Result 55018 states and 232303 transitions. [2021-05-21 15:38:46,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-21 15:38:46,152 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-05-21 15:38:46,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:38:46,301 INFO L225 Difference]: With dead ends: 55018 [2021-05-21 15:38:46,301 INFO L226 Difference]: Without dead ends: 53779 [2021-05-21 15:38:46,302 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1176.0ms TimeCoverageRelationStatistics Valid=213, Invalid=1593, Unknown=0, NotChecked=0, Total=1806 [2021-05-21 15:38:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53779 states. [2021-05-21 15:38:47,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53779 to 51011. [2021-05-21 15:38:47,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51011 states, 51009 states have (on average 4.255660765747221) internal successors, (217077), 51010 states have internal predecessors, (217077), 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-05-21 15:38:47,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51011 states to 51011 states and 217077 transitions. [2021-05-21 15:38:47,811 INFO L78 Accepts]: Start accepts. Automaton has 51011 states and 217077 transitions. Word has length 68 [2021-05-21 15:38:47,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:38:47,811 INFO L482 AbstractCegarLoop]: Abstraction has 51011 states and 217077 transitions. [2021-05-21 15:38:47,811 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:38:47,811 INFO L276 IsEmpty]: Start isEmpty. Operand 51011 states and 217077 transitions. [2021-05-21 15:38:47,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-21 15:38:47,840 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:38:47,840 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:38:47,840 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-21 15:38:47,840 INFO L430 AbstractCegarLoop]: === Iteration 22 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:38:47,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:38:47,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1722827065, now seen corresponding path program 2 times [2021-05-21 15:38:47,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:38:47,841 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43332424] [2021-05-21 15:38:47,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:38:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:38:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:38:48,192 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:38:48,192 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43332424] [2021-05-21 15:38:48,192 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43332424] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:38:48,192 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:38:48,192 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-21 15:38:48,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708727517] [2021-05-21 15:38:48,192 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-21 15:38:48,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:38:48,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-21 15:38:48,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-05-21 15:38:48,193 INFO L87 Difference]: Start difference. First operand 51011 states and 217077 transitions. Second operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:38:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:38:49,525 INFO L93 Difference]: Finished difference Result 57059 states and 240069 transitions. [2021-05-21 15:38:49,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-21 15:38:49,525 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-05-21 15:38:49,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:38:49,918 INFO L225 Difference]: With dead ends: 57059 [2021-05-21 15:38:49,918 INFO L226 Difference]: Without dead ends: 55775 [2021-05-21 15:38:49,919 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 694.4ms TimeCoverageRelationStatistics Valid=190, Invalid=1216, Unknown=0, NotChecked=0, Total=1406 [2021-05-21 15:38:50,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55775 states. [2021-05-21 15:38:50,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55775 to 51041. [2021-05-21 15:38:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51041 states, 51039 states have (on average 4.254511256098278) internal successors, (217146), 51040 states have internal predecessors, (217146), 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-05-21 15:38:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51041 states to 51041 states and 217146 transitions. [2021-05-21 15:38:51,172 INFO L78 Accepts]: Start accepts. Automaton has 51041 states and 217146 transitions. Word has length 68 [2021-05-21 15:38:51,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:38:51,173 INFO L482 AbstractCegarLoop]: Abstraction has 51041 states and 217146 transitions. [2021-05-21 15:38:51,173 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:38:51,173 INFO L276 IsEmpty]: Start isEmpty. Operand 51041 states and 217146 transitions. [2021-05-21 15:38:51,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-21 15:38:51,198 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:38:51,199 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:38:51,199 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-21 15:38:51,199 INFO L430 AbstractCegarLoop]: === Iteration 23 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:38:51,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:38:51,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1587679323, now seen corresponding path program 3 times [2021-05-21 15:38:51,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:38:51,199 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806323324] [2021-05-21 15:38:51,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:38:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:38:51,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:38:51,530 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:38:51,530 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806323324] [2021-05-21 15:38:51,531 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806323324] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:38:51,531 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:38:51,531 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 15:38:51,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066814458] [2021-05-21 15:38:51,531 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 15:38:51,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:38:51,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 15:38:51,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-05-21 15:38:51,531 INFO L87 Difference]: Start difference. First operand 51041 states and 217146 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:38:52,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:38:52,656 INFO L93 Difference]: Finished difference Result 57090 states and 240097 transitions. [2021-05-21 15:38:52,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-21 15:38:52,656 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-05-21 15:38:52,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:38:52,802 INFO L225 Difference]: With dead ends: 57090 [2021-05-21 15:38:52,802 INFO L226 Difference]: Without dead ends: 55761 [2021-05-21 15:38:52,802 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 600.9ms TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2021-05-21 15:38:53,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55761 states. [2021-05-21 15:38:53,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55761 to 51081. [2021-05-21 15:38:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51081 states, 51079 states have (on average 4.252882789404648) internal successors, (217233), 51080 states have internal predecessors, (217233), 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-05-21 15:38:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51081 states to 51081 states and 217233 transitions. [2021-05-21 15:38:54,354 INFO L78 Accepts]: Start accepts. Automaton has 51081 states and 217233 transitions. Word has length 68 [2021-05-21 15:38:54,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:38:54,354 INFO L482 AbstractCegarLoop]: Abstraction has 51081 states and 217233 transitions. [2021-05-21 15:38:54,354 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:38:54,354 INFO L276 IsEmpty]: Start isEmpty. Operand 51081 states and 217233 transitions. [2021-05-21 15:38:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-21 15:38:54,383 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:38:54,384 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:38:54,384 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-21 15:38:54,384 INFO L430 AbstractCegarLoop]: === Iteration 24 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:38:54,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:38:54,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1285672051, now seen corresponding path program 4 times [2021-05-21 15:38:54,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:38:54,384 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918930253] [2021-05-21 15:38:54,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:38:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:38:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:38:54,833 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:38:54,833 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918930253] [2021-05-21 15:38:54,833 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918930253] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:38:54,833 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:38:54,833 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 15:38:54,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928955620] [2021-05-21 15:38:54,834 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 15:38:54,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:38:54,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 15:38:54,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-05-21 15:38:54,834 INFO L87 Difference]: Start difference. First operand 51081 states and 217233 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:38:56,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:38:56,704 INFO L93 Difference]: Finished difference Result 57180 states and 240266 transitions. [2021-05-21 15:38:56,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-21 15:38:56,704 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-05-21 15:38:56,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:38:56,863 INFO L225 Difference]: With dead ends: 57180 [2021-05-21 15:38:56,863 INFO L226 Difference]: Without dead ends: 55851 [2021-05-21 15:38:56,864 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1116.0ms TimeCoverageRelationStatistics Valid=220, Invalid=1420, Unknown=0, NotChecked=0, Total=1640 [2021-05-21 15:38:57,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55851 states. [2021-05-21 15:38:57,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55851 to 51102. [2021-05-21 15:38:57,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51102 states, 51100 states have (on average 4.251859099804305) internal successors, (217270), 51101 states have internal predecessors, (217270), 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-05-21 15:38:58,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51102 states to 51102 states and 217270 transitions. [2021-05-21 15:38:58,123 INFO L78 Accepts]: Start accepts. Automaton has 51102 states and 217270 transitions. Word has length 68 [2021-05-21 15:38:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:38:58,124 INFO L482 AbstractCegarLoop]: Abstraction has 51102 states and 217270 transitions. [2021-05-21 15:38:58,124 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:38:58,124 INFO L276 IsEmpty]: Start isEmpty. Operand 51102 states and 217270 transitions. [2021-05-21 15:38:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-21 15:38:58,149 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:38:58,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:38:58,149 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-21 15:38:58,149 INFO L430 AbstractCegarLoop]: === Iteration 25 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:38:58,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:38:58,149 INFO L82 PathProgramCache]: Analyzing trace with hash -747687525, now seen corresponding path program 5 times [2021-05-21 15:38:58,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:38:58,149 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125846674] [2021-05-21 15:38:58,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:38:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:38:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:38:58,370 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:38:58,370 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125846674] [2021-05-21 15:38:58,370 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125846674] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:38:58,370 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:38:58,370 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-21 15:38:58,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793102562] [2021-05-21 15:38:58,370 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-21 15:38:58,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:38:58,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-21 15:38:58,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-05-21 15:38:58,371 INFO L87 Difference]: Start difference. First operand 51102 states and 217270 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:38:59,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:38:59,134 INFO L93 Difference]: Finished difference Result 57173 states and 240259 transitions. [2021-05-21 15:38:59,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-21 15:38:59,134 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-05-21 15:38:59,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:38:59,285 INFO L225 Difference]: With dead ends: 57173 [2021-05-21 15:38:59,285 INFO L226 Difference]: Without dead ends: 55844 [2021-05-21 15:38:59,285 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 364.1ms TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2021-05-21 15:38:59,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55844 states. [2021-05-21 15:39:00,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55844 to 51103. [2021-05-21 15:39:00,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51103 states, 51101 states have (on average 4.251795463885247) internal successors, (217271), 51102 states have internal predecessors, (217271), 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-05-21 15:39:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51103 states to 51103 states and 217271 transitions. [2021-05-21 15:39:00,963 INFO L78 Accepts]: Start accepts. Automaton has 51103 states and 217271 transitions. Word has length 68 [2021-05-21 15:39:00,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:00,963 INFO L482 AbstractCegarLoop]: Abstraction has 51103 states and 217271 transitions. [2021-05-21 15:39:00,963 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:00,963 INFO L276 IsEmpty]: Start isEmpty. Operand 51103 states and 217271 transitions. [2021-05-21 15:39:00,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-21 15:39:00,993 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:00,993 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:00,993 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-21 15:39:00,993 INFO L430 AbstractCegarLoop]: === Iteration 26 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:00,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:00,994 INFO L82 PathProgramCache]: Analyzing trace with hash 229412969, now seen corresponding path program 6 times [2021-05-21 15:39:00,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:00,994 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900211478] [2021-05-21 15:39:00,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:01,245 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:01,245 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900211478] [2021-05-21 15:39:01,245 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900211478] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:01,245 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:01,246 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-21 15:39:01,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104732391] [2021-05-21 15:39:01,246 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-21 15:39:01,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:01,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-21 15:39:01,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-05-21 15:39:01,246 INFO L87 Difference]: Start difference. First operand 51103 states and 217271 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:02,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:02,018 INFO L93 Difference]: Finished difference Result 57203 states and 240305 transitions. [2021-05-21 15:39:02,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-21 15:39:02,018 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-05-21 15:39:02,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:02,167 INFO L225 Difference]: With dead ends: 57203 [2021-05-21 15:39:02,168 INFO L226 Difference]: Without dead ends: 55874 [2021-05-21 15:39:02,168 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 375.8ms TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2021-05-21 15:39:02,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55874 states. [2021-05-21 15:39:03,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55874 to 51132. [2021-05-21 15:39:03,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51132 states, 51130 states have (on average 4.250264032857422) internal successors, (217316), 51131 states have internal predecessors, (217316), 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-05-21 15:39:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51132 states to 51132 states and 217316 transitions. [2021-05-21 15:39:03,457 INFO L78 Accepts]: Start accepts. Automaton has 51132 states and 217316 transitions. Word has length 68 [2021-05-21 15:39:03,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:03,458 INFO L482 AbstractCegarLoop]: Abstraction has 51132 states and 217316 transitions. [2021-05-21 15:39:03,458 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:03,458 INFO L276 IsEmpty]: Start isEmpty. Operand 51132 states and 217316 transitions. [2021-05-21 15:39:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-21 15:39:03,485 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:03,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:03,485 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-05-21 15:39:03,485 INFO L430 AbstractCegarLoop]: === Iteration 27 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:03,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:03,487 INFO L82 PathProgramCache]: Analyzing trace with hash -838870671, now seen corresponding path program 7 times [2021-05-21 15:39:03,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:03,487 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962667733] [2021-05-21 15:39:03,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:03,674 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:03,674 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962667733] [2021-05-21 15:39:03,674 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962667733] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:03,674 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:03,674 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-21 15:39:03,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485541319] [2021-05-21 15:39:03,675 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-21 15:39:03,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:03,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-21 15:39:03,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-05-21 15:39:03,675 INFO L87 Difference]: Start difference. First operand 51132 states and 217316 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:04,482 INFO L93 Difference]: Finished difference Result 55837 states and 234184 transitions. [2021-05-21 15:39:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-21 15:39:04,482 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-05-21 15:39:04,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:04,629 INFO L225 Difference]: With dead ends: 55837 [2021-05-21 15:39:04,629 INFO L226 Difference]: Without dead ends: 54508 [2021-05-21 15:39:04,629 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 481.9ms TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-05-21 15:39:04,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54508 states. [2021-05-21 15:39:05,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54508 to 49737. [2021-05-21 15:39:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49737 states, 49735 states have (on average 4.245501156127475) internal successors, (211150), 49736 states have internal predecessors, (211150), 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-05-21 15:39:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49737 states to 49737 states and 211150 transitions. [2021-05-21 15:39:05,884 INFO L78 Accepts]: Start accepts. Automaton has 49737 states and 211150 transitions. Word has length 68 [2021-05-21 15:39:05,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:05,884 INFO L482 AbstractCegarLoop]: Abstraction has 49737 states and 211150 transitions. [2021-05-21 15:39:05,884 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 49737 states and 211150 transitions. [2021-05-21 15:39:05,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-21 15:39:05,915 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:05,915 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:05,915 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-21 15:39:05,915 INFO L430 AbstractCegarLoop]: === Iteration 28 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:05,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:05,916 INFO L82 PathProgramCache]: Analyzing trace with hash 834173378, now seen corresponding path program 1 times [2021-05-21 15:39:05,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:05,916 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451670942] [2021-05-21 15:39:05,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:06,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:06,394 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:06,394 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451670942] [2021-05-21 15:39:06,394 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451670942] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:06,395 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:06,395 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-21 15:39:06,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103246352] [2021-05-21 15:39:06,395 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-21 15:39:06,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:06,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-21 15:39:06,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2021-05-21 15:39:06,395 INFO L87 Difference]: Start difference. First operand 49737 states and 211150 transitions. Second operand has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 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-05-21 15:39:08,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:08,337 INFO L93 Difference]: Finished difference Result 57256 states and 239996 transitions. [2021-05-21 15:39:08,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-21 15:39:08,337 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 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 70 [2021-05-21 15:39:08,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:08,483 INFO L225 Difference]: With dead ends: 57256 [2021-05-21 15:39:08,484 INFO L226 Difference]: Without dead ends: 56134 [2021-05-21 15:39:08,484 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 960.5ms TimeCoverageRelationStatistics Valid=213, Invalid=1509, Unknown=0, NotChecked=0, Total=1722 [2021-05-21 15:39:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56134 states. [2021-05-21 15:39:09,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56134 to 49737. [2021-05-21 15:39:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49737 states, 49735 states have (on average 4.244596360711772) internal successors, (211105), 49736 states have internal predecessors, (211105), 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-05-21 15:39:09,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49737 states to 49737 states and 211105 transitions. [2021-05-21 15:39:09,724 INFO L78 Accepts]: Start accepts. Automaton has 49737 states and 211105 transitions. Word has length 70 [2021-05-21 15:39:09,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:09,724 INFO L482 AbstractCegarLoop]: Abstraction has 49737 states and 211105 transitions. [2021-05-21 15:39:09,725 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 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-05-21 15:39:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 49737 states and 211105 transitions. [2021-05-21 15:39:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-21 15:39:09,755 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:09,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:09,755 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-05-21 15:39:09,755 INFO L430 AbstractCegarLoop]: === Iteration 29 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:09,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:09,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1768735654, now seen corresponding path program 2 times [2021-05-21 15:39:09,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:09,756 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578139717] [2021-05-21 15:39:09,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:10,153 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:10,153 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578139717] [2021-05-21 15:39:10,153 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578139717] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:10,153 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:10,153 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-21 15:39:10,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033567533] [2021-05-21 15:39:10,153 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-21 15:39:10,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:10,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-21 15:39:10,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-05-21 15:39:10,154 INFO L87 Difference]: Start difference. First operand 49737 states and 211105 transitions. Second operand has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 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-05-21 15:39:11,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:11,735 INFO L93 Difference]: Finished difference Result 56867 states and 238439 transitions. [2021-05-21 15:39:11,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-21 15:39:11,735 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 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 70 [2021-05-21 15:39:11,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:11,878 INFO L225 Difference]: With dead ends: 56867 [2021-05-21 15:39:11,878 INFO L226 Difference]: Without dead ends: 55700 [2021-05-21 15:39:11,879 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 746.8ms TimeCoverageRelationStatistics Valid=164, Invalid=1168, Unknown=0, NotChecked=0, Total=1332 [2021-05-21 15:39:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55700 states. [2021-05-21 15:39:12,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55700 to 49329. [2021-05-21 15:39:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49329 states, 49327 states have (on average 4.248768422973219) internal successors, (209579), 49328 states have internal predecessors, (209579), 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-05-21 15:39:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49329 states to 49329 states and 209579 transitions. [2021-05-21 15:39:13,139 INFO L78 Accepts]: Start accepts. Automaton has 49329 states and 209579 transitions. Word has length 70 [2021-05-21 15:39:13,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:13,140 INFO L482 AbstractCegarLoop]: Abstraction has 49329 states and 209579 transitions. [2021-05-21 15:39:13,140 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 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-05-21 15:39:13,140 INFO L276 IsEmpty]: Start isEmpty. Operand 49329 states and 209579 transitions. [2021-05-21 15:39:13,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-21 15:39:13,171 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:13,171 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:13,171 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-21 15:39:13,171 INFO L430 AbstractCegarLoop]: === Iteration 30 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:13,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:13,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1979887372, now seen corresponding path program 3 times [2021-05-21 15:39:13,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:13,172 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863351059] [2021-05-21 15:39:13,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:13,512 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:13,512 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863351059] [2021-05-21 15:39:13,512 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863351059] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:13,512 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:13,512 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-21 15:39:13,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074967222] [2021-05-21 15:39:13,513 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-21 15:39:13,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:13,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-21 15:39:13,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-05-21 15:39:13,513 INFO L87 Difference]: Start difference. First operand 49329 states and 209579 transitions. Second operand has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 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-05-21 15:39:14,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:14,897 INFO L93 Difference]: Finished difference Result 53309 states and 223950 transitions. [2021-05-21 15:39:14,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-21 15:39:14,897 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 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 70 [2021-05-21 15:39:14,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:15,036 INFO L225 Difference]: With dead ends: 53309 [2021-05-21 15:39:15,037 INFO L226 Difference]: Without dead ends: 52526 [2021-05-21 15:39:15,037 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 873.1ms TimeCoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2021-05-21 15:39:15,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52526 states. [2021-05-21 15:39:16,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52526 to 46131. [2021-05-21 15:39:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46131 states, 46129 states have (on average 4.255609269656832) internal successors, (196307), 46130 states have internal predecessors, (196307), 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-05-21 15:39:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46131 states to 46131 states and 196307 transitions. [2021-05-21 15:39:16,218 INFO L78 Accepts]: Start accepts. Automaton has 46131 states and 196307 transitions. Word has length 70 [2021-05-21 15:39:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:16,218 INFO L482 AbstractCegarLoop]: Abstraction has 46131 states and 196307 transitions. [2021-05-21 15:39:16,218 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 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-05-21 15:39:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 46131 states and 196307 transitions. [2021-05-21 15:39:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-21 15:39:16,248 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:16,248 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:16,248 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-05-21 15:39:16,248 INFO L430 AbstractCegarLoop]: === Iteration 31 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:16,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:16,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1636468715, now seen corresponding path program 1 times [2021-05-21 15:39:16,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:16,248 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526284068] [2021-05-21 15:39:16,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:16,750 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:16,750 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526284068] [2021-05-21 15:39:16,750 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526284068] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:16,750 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:16,750 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-21 15:39:16,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213402769] [2021-05-21 15:39:16,750 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-21 15:39:16,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:16,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-21 15:39:16,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2021-05-21 15:39:16,751 INFO L87 Difference]: Start difference. First operand 46131 states and 196307 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 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-05-21 15:39:17,754 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-05-21 15:39:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:18,588 INFO L93 Difference]: Finished difference Result 46335 states and 194500 transitions. [2021-05-21 15:39:18,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-21 15:39:18,588 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 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-05-21 15:39:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:18,695 INFO L225 Difference]: With dead ends: 46335 [2021-05-21 15:39:18,696 INFO L226 Difference]: Without dead ends: 45255 [2021-05-21 15:39:18,696 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1247.5ms TimeCoverageRelationStatistics Valid=243, Invalid=1649, Unknown=0, NotChecked=0, Total=1892 [2021-05-21 15:39:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45255 states. [2021-05-21 15:39:19,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45255 to 40527. [2021-05-21 15:39:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40527 states, 40525 states have (on average 4.238864898210981) internal successors, (171780), 40526 states have internal predecessors, (171780), 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-05-21 15:39:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40527 states to 40527 states and 171780 transitions. [2021-05-21 15:39:19,685 INFO L78 Accepts]: Start accepts. Automaton has 40527 states and 171780 transitions. Word has length 71 [2021-05-21 15:39:19,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:19,685 INFO L482 AbstractCegarLoop]: Abstraction has 40527 states and 171780 transitions. [2021-05-21 15:39:19,685 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 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-05-21 15:39:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand 40527 states and 171780 transitions. [2021-05-21 15:39:19,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-21 15:39:19,715 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:19,715 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:19,716 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-21 15:39:19,716 INFO L430 AbstractCegarLoop]: === Iteration 32 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:19,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:19,716 INFO L82 PathProgramCache]: Analyzing trace with hash -992111004, now seen corresponding path program 1 times [2021-05-21 15:39:19,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:19,716 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505962709] [2021-05-21 15:39:19,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:19,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:19,762 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:19,762 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505962709] [2021-05-21 15:39:19,762 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505962709] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:19,762 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:19,762 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-21 15:39:19,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547832190] [2021-05-21 15:39:19,762 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-21 15:39:19,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:19,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-21 15:39:19,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-05-21 15:39:19,762 INFO L87 Difference]: Start difference. First operand 40527 states and 171780 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-05-21 15:39:20,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:20,203 INFO L93 Difference]: Finished difference Result 62148 states and 255238 transitions. [2021-05-21 15:39:20,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-21 15:39:20,204 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-05-21 15:39:20,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:20,314 INFO L225 Difference]: With dead ends: 62148 [2021-05-21 15:39:20,314 INFO L226 Difference]: Without dead ends: 47082 [2021-05-21 15:39:20,314 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 107.0ms TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2021-05-21 15:39:20,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47082 states. [2021-05-21 15:39:21,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47082 to 37407. [2021-05-21 15:39:21,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37407 states, 37405 states have (on average 4.195535356235798) internal successors, (156934), 37406 states have internal predecessors, (156934), 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-05-21 15:39:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37407 states to 37407 states and 156934 transitions. [2021-05-21 15:39:21,465 INFO L78 Accepts]: Start accepts. Automaton has 37407 states and 156934 transitions. Word has length 71 [2021-05-21 15:39:21,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:21,465 INFO L482 AbstractCegarLoop]: Abstraction has 37407 states and 156934 transitions. [2021-05-21 15:39:21,466 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-05-21 15:39:21,466 INFO L276 IsEmpty]: Start isEmpty. Operand 37407 states and 156934 transitions. [2021-05-21 15:39:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-21 15:39:21,493 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:21,494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:21,494 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-05-21 15:39:21,494 INFO L430 AbstractCegarLoop]: === Iteration 33 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:21,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:21,494 INFO L82 PathProgramCache]: Analyzing trace with hash 617757196, now seen corresponding path program 2 times [2021-05-21 15:39:21,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:21,494 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358385729] [2021-05-21 15:39:21,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:21,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:21,572 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:21,572 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358385729] [2021-05-21 15:39:21,572 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358385729] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:21,572 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:21,572 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-21 15:39:21,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045913655] [2021-05-21 15:39:21,573 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-21 15:39:21,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:21,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-21 15:39:21,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-05-21 15:39:21,573 INFO L87 Difference]: Start difference. First operand 37407 states and 156934 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 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-05-21 15:39:22,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:22,402 INFO L93 Difference]: Finished difference Result 52101 states and 213437 transitions. [2021-05-21 15:39:22,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-21 15:39:22,402 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 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-05-21 15:39:22,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:22,517 INFO L225 Difference]: With dead ends: 52101 [2021-05-21 15:39:22,517 INFO L226 Difference]: Without dead ends: 45375 [2021-05-21 15:39:22,517 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 176.6ms TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2021-05-21 15:39:22,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45375 states. [2021-05-21 15:39:23,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45375 to 37416. [2021-05-21 15:39:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37416 states, 37414 states have (on average 4.195648687657027) internal successors, (156976), 37415 states have internal predecessors, (156976), 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-05-21 15:39:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37416 states to 37416 states and 156976 transitions. [2021-05-21 15:39:23,644 INFO L78 Accepts]: Start accepts. Automaton has 37416 states and 156976 transitions. Word has length 71 [2021-05-21 15:39:23,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:23,645 INFO L482 AbstractCegarLoop]: Abstraction has 37416 states and 156976 transitions. [2021-05-21 15:39:23,645 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 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-05-21 15:39:23,645 INFO L276 IsEmpty]: Start isEmpty. Operand 37416 states and 156976 transitions. [2021-05-21 15:39:23,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-21 15:39:23,682 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:23,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:23,683 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-21 15:39:23,683 INFO L430 AbstractCegarLoop]: === Iteration 34 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:23,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:23,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1562092050, now seen corresponding path program 3 times [2021-05-21 15:39:23,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:23,683 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99538148] [2021-05-21 15:39:23,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:23,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:23,816 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:23,816 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99538148] [2021-05-21 15:39:23,816 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99538148] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:23,816 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:23,816 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-21 15:39:23,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978514215] [2021-05-21 15:39:23,817 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-21 15:39:23,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:23,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-21 15:39:23,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-05-21 15:39:23,817 INFO L87 Difference]: Start difference. First operand 37416 states and 156976 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 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-05-21 15:39:24,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:24,337 INFO L93 Difference]: Finished difference Result 47706 states and 195499 transitions. [2021-05-21 15:39:24,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-21 15:39:24,338 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 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-05-21 15:39:24,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:24,440 INFO L225 Difference]: With dead ends: 47706 [2021-05-21 15:39:24,441 INFO L226 Difference]: Without dead ends: 42690 [2021-05-21 15:39:24,441 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 249.8ms TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2021-05-21 15:39:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42690 states. [2021-05-21 15:39:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42690 to 34959. [2021-05-21 15:39:25,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34959 states, 34957 states have (on average 4.183539777440856) internal successors, (146244), 34958 states have internal predecessors, (146244), 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-05-21 15:39:25,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34959 states to 34959 states and 146244 transitions. [2021-05-21 15:39:25,390 INFO L78 Accepts]: Start accepts. Automaton has 34959 states and 146244 transitions. Word has length 71 [2021-05-21 15:39:25,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:25,390 INFO L482 AbstractCegarLoop]: Abstraction has 34959 states and 146244 transitions. [2021-05-21 15:39:25,390 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 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-05-21 15:39:25,390 INFO L276 IsEmpty]: Start isEmpty. Operand 34959 states and 146244 transitions. [2021-05-21 15:39:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-21 15:39:25,421 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:25,421 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:25,421 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-05-21 15:39:25,421 INFO L430 AbstractCegarLoop]: === Iteration 35 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:25,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:25,421 INFO L82 PathProgramCache]: Analyzing trace with hash -450918615, now seen corresponding path program 1 times [2021-05-21 15:39:25,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:25,421 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761967400] [2021-05-21 15:39:25,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:25,895 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:25,895 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761967400] [2021-05-21 15:39:25,895 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761967400] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:25,895 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:25,895 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-21 15:39:25,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887355439] [2021-05-21 15:39:25,895 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-21 15:39:25,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:25,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-21 15:39:25,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2021-05-21 15:39:25,896 INFO L87 Difference]: Start difference. First operand 34959 states and 146244 transitions. Second operand has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 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-05-21 15:39:27,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:27,493 INFO L93 Difference]: Finished difference Result 35853 states and 147820 transitions. [2021-05-21 15:39:27,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-21 15:39:27,494 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-05-21 15:39:27,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:27,578 INFO L225 Difference]: With dead ends: 35853 [2021-05-21 15:39:27,579 INFO L226 Difference]: Without dead ends: 34053 [2021-05-21 15:39:27,579 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1058.7ms TimeCoverageRelationStatistics Valid=281, Invalid=1699, Unknown=0, NotChecked=0, Total=1980 [2021-05-21 15:39:27,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34053 states. [2021-05-21 15:39:28,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34053 to 29025. [2021-05-21 15:39:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29025 states, 29023 states have (on average 4.175447059228888) internal successors, (121184), 29024 states have internal predecessors, (121184), 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-05-21 15:39:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29025 states to 29025 states and 121184 transitions. [2021-05-21 15:39:28,160 INFO L78 Accepts]: Start accepts. Automaton has 29025 states and 121184 transitions. Word has length 73 [2021-05-21 15:39:28,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:28,160 INFO L482 AbstractCegarLoop]: Abstraction has 29025 states and 121184 transitions. [2021-05-21 15:39:28,161 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 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-05-21 15:39:28,161 INFO L276 IsEmpty]: Start isEmpty. Operand 29025 states and 121184 transitions. [2021-05-21 15:39:28,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-21 15:39:28,188 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:28,188 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:28,188 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-05-21 15:39:28,188 INFO L430 AbstractCegarLoop]: === Iteration 36 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:28,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:28,189 INFO L82 PathProgramCache]: Analyzing trace with hash 958835916, now seen corresponding path program 1 times [2021-05-21 15:39:28,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:28,189 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556891998] [2021-05-21 15:39:28,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:28,617 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-05-21 15:39:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:29,096 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:29,096 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556891998] [2021-05-21 15:39:29,096 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556891998] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:29,096 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:29,096 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-21 15:39:29,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863584594] [2021-05-21 15:39:29,096 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-21 15:39:29,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:29,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-21 15:39:29,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2021-05-21 15:39:29,097 INFO L87 Difference]: Start difference. First operand 29025 states and 121184 transitions. Second operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 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-05-21 15:39:31,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:31,703 INFO L93 Difference]: Finished difference Result 38504 states and 159667 transitions. [2021-05-21 15:39:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-21 15:39:31,704 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-05-21 15:39:31,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:31,791 INFO L225 Difference]: With dead ends: 38504 [2021-05-21 15:39:31,791 INFO L226 Difference]: Without dead ends: 34922 [2021-05-21 15:39:31,792 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1723.1ms TimeCoverageRelationStatistics Valid=254, Invalid=2296, Unknown=0, NotChecked=0, Total=2550 [2021-05-21 15:39:31,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34922 states. [2021-05-21 15:39:32,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34922 to 29592. [2021-05-21 15:39:32,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29592 states, 29590 states have (on average 4.223893207164583) internal successors, (124985), 29591 states have internal predecessors, (124985), 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-05-21 15:39:32,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29592 states to 29592 states and 124985 transitions. [2021-05-21 15:39:32,382 INFO L78 Accepts]: Start accepts. Automaton has 29592 states and 124985 transitions. Word has length 73 [2021-05-21 15:39:32,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:32,382 INFO L482 AbstractCegarLoop]: Abstraction has 29592 states and 124985 transitions. [2021-05-21 15:39:32,383 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 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-05-21 15:39:32,383 INFO L276 IsEmpty]: Start isEmpty. Operand 29592 states and 124985 transitions. [2021-05-21 15:39:32,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-21 15:39:32,411 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:32,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:32,411 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-05-21 15:39:32,411 INFO L430 AbstractCegarLoop]: === Iteration 37 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:32,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:32,412 INFO L82 PathProgramCache]: Analyzing trace with hash 937574186, now seen corresponding path program 2 times [2021-05-21 15:39:32,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:32,412 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391591077] [2021-05-21 15:39:32,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:33,182 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:33,182 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391591077] [2021-05-21 15:39:33,182 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391591077] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:33,182 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:33,182 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-21 15:39:33,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742515552] [2021-05-21 15:39:33,182 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-21 15:39:33,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:33,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-21 15:39:33,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2021-05-21 15:39:33,183 INFO L87 Difference]: Start difference. First operand 29592 states and 124985 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 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-05-21 15:39:34,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:34,770 INFO L93 Difference]: Finished difference Result 29856 states and 124699 transitions. [2021-05-21 15:39:34,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-21 15:39:34,770 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-05-21 15:39:34,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:34,838 INFO L225 Difference]: With dead ends: 29856 [2021-05-21 15:39:34,838 INFO L226 Difference]: Without dead ends: 27300 [2021-05-21 15:39:34,839 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1283.0ms TimeCoverageRelationStatistics Valid=245, Invalid=1825, Unknown=0, NotChecked=0, Total=2070 [2021-05-21 15:39:34,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27300 states. [2021-05-21 15:39:35,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27300 to 19407. [2021-05-21 15:39:35,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19407 states, 19405 states have (on average 4.1668126771450655) internal successors, (80857), 19406 states have internal predecessors, (80857), 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-05-21 15:39:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19407 states to 19407 states and 80857 transitions. [2021-05-21 15:39:35,370 INFO L78 Accepts]: Start accepts. Automaton has 19407 states and 80857 transitions. Word has length 73 [2021-05-21 15:39:35,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:35,370 INFO L482 AbstractCegarLoop]: Abstraction has 19407 states and 80857 transitions. [2021-05-21 15:39:35,370 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 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-05-21 15:39:35,370 INFO L276 IsEmpty]: Start isEmpty. Operand 19407 states and 80857 transitions. [2021-05-21 15:39:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-21 15:39:35,392 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:35,392 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:35,392 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-05-21 15:39:35,392 INFO L430 AbstractCegarLoop]: === Iteration 38 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:35,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:35,392 INFO L82 PathProgramCache]: Analyzing trace with hash 461088309, now seen corresponding path program 1 times [2021-05-21 15:39:35,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:35,393 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352152340] [2021-05-21 15:39:35,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:35,957 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:35,957 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352152340] [2021-05-21 15:39:35,957 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352152340] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:35,957 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:35,957 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-21 15:39:35,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825088575] [2021-05-21 15:39:35,958 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-21 15:39:35,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:35,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-21 15:39:35,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2021-05-21 15:39:35,959 INFO L87 Difference]: Start difference. First operand 19407 states and 80857 transitions. Second operand has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:37,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:37,552 INFO L93 Difference]: Finished difference Result 23428 states and 95519 transitions. [2021-05-21 15:39:37,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-21 15:39:37,553 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-05-21 15:39:37,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:37,614 INFO L225 Difference]: With dead ends: 23428 [2021-05-21 15:39:37,614 INFO L226 Difference]: Without dead ends: 22564 [2021-05-21 15:39:37,614 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1043.6ms TimeCoverageRelationStatistics Valid=244, Invalid=1736, Unknown=0, NotChecked=0, Total=1980 [2021-05-21 15:39:37,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22564 states. [2021-05-21 15:39:37,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22564 to 21544. [2021-05-21 15:39:37,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21544 states, 21542 states have (on average 4.120369510723238) internal successors, (88761), 21543 states have internal predecessors, (88761), 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-05-21 15:39:38,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21544 states to 21544 states and 88761 transitions. [2021-05-21 15:39:38,068 INFO L78 Accepts]: Start accepts. Automaton has 21544 states and 88761 transitions. Word has length 74 [2021-05-21 15:39:38,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:38,068 INFO L482 AbstractCegarLoop]: Abstraction has 21544 states and 88761 transitions. [2021-05-21 15:39:38,068 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:38,068 INFO L276 IsEmpty]: Start isEmpty. Operand 21544 states and 88761 transitions. [2021-05-21 15:39:38,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-21 15:39:38,093 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:38,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:38,093 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-05-21 15:39:38,093 INFO L430 AbstractCegarLoop]: === Iteration 39 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:38,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:38,095 INFO L82 PathProgramCache]: Analyzing trace with hash 563120435, now seen corresponding path program 2 times [2021-05-21 15:39:38,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:38,095 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546880303] [2021-05-21 15:39:38,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:38,593 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:38,593 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546880303] [2021-05-21 15:39:38,593 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546880303] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:38,593 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:38,593 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-21 15:39:38,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573048806] [2021-05-21 15:39:38,594 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-21 15:39:38,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:38,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-21 15:39:38,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2021-05-21 15:39:38,594 INFO L87 Difference]: Start difference. First operand 21544 states and 88761 transitions. Second operand has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:40,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:40,050 INFO L93 Difference]: Finished difference Result 24815 states and 100343 transitions. [2021-05-21 15:39:40,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-21 15:39:40,050 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-05-21 15:39:40,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:40,103 INFO L225 Difference]: With dead ends: 24815 [2021-05-21 15:39:40,103 INFO L226 Difference]: Without dead ends: 23951 [2021-05-21 15:39:40,104 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 908.9ms TimeCoverageRelationStatistics Valid=231, Invalid=1661, Unknown=0, NotChecked=0, Total=1892 [2021-05-21 15:39:40,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23951 states. [2021-05-21 15:39:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23951 to 21544. [2021-05-21 15:39:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21544 states, 21542 states have (on average 4.120369510723238) internal successors, (88761), 21543 states have internal predecessors, (88761), 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-05-21 15:39:40,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21544 states to 21544 states and 88761 transitions. [2021-05-21 15:39:40,497 INFO L78 Accepts]: Start accepts. Automaton has 21544 states and 88761 transitions. Word has length 74 [2021-05-21 15:39:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:40,497 INFO L482 AbstractCegarLoop]: Abstraction has 21544 states and 88761 transitions. [2021-05-21 15:39:40,498 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 21544 states and 88761 transitions. [2021-05-21 15:39:40,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-21 15:39:40,521 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:40,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:40,522 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-21 15:39:40,522 INFO L430 AbstractCegarLoop]: === Iteration 40 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:40,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:40,522 INFO L82 PathProgramCache]: Analyzing trace with hash -374211371, now seen corresponding path program 3 times [2021-05-21 15:39:40,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:40,522 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011115161] [2021-05-21 15:39:40,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:41,129 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2021-05-21 15:39:41,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:41,187 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:41,187 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011115161] [2021-05-21 15:39:41,187 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011115161] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:41,187 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:41,187 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-21 15:39:41,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117502536] [2021-05-21 15:39:41,188 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-21 15:39:41,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:41,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-21 15:39:41,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-05-21 15:39:41,188 INFO L87 Difference]: Start difference. First operand 21544 states and 88761 transitions. Second operand has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:42,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:42,833 INFO L93 Difference]: Finished difference Result 26738 states and 107510 transitions. [2021-05-21 15:39:42,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-21 15:39:42,834 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-05-21 15:39:42,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:42,884 INFO L225 Difference]: With dead ends: 26738 [2021-05-21 15:39:42,884 INFO L226 Difference]: Without dead ends: 23282 [2021-05-21 15:39:42,885 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1106.8ms TimeCoverageRelationStatistics Valid=247, Invalid=2009, Unknown=0, NotChecked=0, Total=2256 [2021-05-21 15:39:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23282 states. [2021-05-21 15:39:43,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23282 to 18952. [2021-05-21 15:39:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18952 states, 18950 states have (on average 4.075092348284961) internal successors, (77223), 18951 states have internal predecessors, (77223), 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-05-21 15:39:43,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18952 states to 18952 states and 77223 transitions. [2021-05-21 15:39:43,355 INFO L78 Accepts]: Start accepts. Automaton has 18952 states and 77223 transitions. Word has length 74 [2021-05-21 15:39:43,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:43,356 INFO L482 AbstractCegarLoop]: Abstraction has 18952 states and 77223 transitions. [2021-05-21 15:39:43,356 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:43,356 INFO L276 IsEmpty]: Start isEmpty. Operand 18952 states and 77223 transitions. [2021-05-21 15:39:43,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-21 15:39:43,376 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:43,376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:43,376 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-05-21 15:39:43,376 INFO L430 AbstractCegarLoop]: === Iteration 41 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:43,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:43,377 INFO L82 PathProgramCache]: Analyzing trace with hash 447738003, now seen corresponding path program 4 times [2021-05-21 15:39:43,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:43,377 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614925214] [2021-05-21 15:39:43,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:43,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:43,774 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:43,774 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614925214] [2021-05-21 15:39:43,774 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614925214] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:43,775 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:43,775 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-21 15:39:43,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575488867] [2021-05-21 15:39:43,775 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-21 15:39:43,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:43,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-21 15:39:43,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-05-21 15:39:43,775 INFO L87 Difference]: Start difference. First operand 18952 states and 77223 transitions. Second operand has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:44,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:44,831 INFO L93 Difference]: Finished difference Result 22543 states and 89781 transitions. [2021-05-21 15:39:44,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-21 15:39:44,831 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-05-21 15:39:44,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:44,879 INFO L225 Difference]: With dead ends: 22543 [2021-05-21 15:39:44,879 INFO L226 Difference]: Without dead ends: 21679 [2021-05-21 15:39:44,879 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 788.8ms TimeCoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2021-05-21 15:39:44,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2021-05-21 15:39:45,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 19122. [2021-05-21 15:39:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19122 states, 19120 states have (on average 4.065585774058578) internal successors, (77734), 19121 states have internal predecessors, (77734), 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-05-21 15:39:45,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 77734 transitions. [2021-05-21 15:39:45,315 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 77734 transitions. Word has length 74 [2021-05-21 15:39:45,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:45,315 INFO L482 AbstractCegarLoop]: Abstraction has 19122 states and 77734 transitions. [2021-05-21 15:39:45,315 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:45,315 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 77734 transitions. [2021-05-21 15:39:45,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-21 15:39:45,335 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:45,335 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:45,335 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-05-21 15:39:45,336 INFO L430 AbstractCegarLoop]: === Iteration 42 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:45,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:45,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1081503733, now seen corresponding path program 5 times [2021-05-21 15:39:45,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:45,336 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134476809] [2021-05-21 15:39:45,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:45,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:45,679 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:45,679 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134476809] [2021-05-21 15:39:45,679 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134476809] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:45,679 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:45,679 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-21 15:39:45,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936839097] [2021-05-21 15:39:45,679 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-21 15:39:45,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:45,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-21 15:39:45,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-05-21 15:39:45,680 INFO L87 Difference]: Start difference. First operand 19122 states and 77734 transitions. Second operand has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:46,580 INFO L93 Difference]: Finished difference Result 22763 states and 90402 transitions. [2021-05-21 15:39:46,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-21 15:39:46,580 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-05-21 15:39:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:46,628 INFO L225 Difference]: With dead ends: 22763 [2021-05-21 15:39:46,628 INFO L226 Difference]: Without dead ends: 21899 [2021-05-21 15:39:46,628 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 598.5ms TimeCoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2021-05-21 15:39:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21899 states. [2021-05-21 15:39:47,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21899 to 19172. [2021-05-21 15:39:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19172 states, 19170 states have (on average 4.060719874804382) internal successors, (77844), 19171 states have internal predecessors, (77844), 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-05-21 15:39:47,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19172 states to 19172 states and 77844 transitions. [2021-05-21 15:39:47,143 INFO L78 Accepts]: Start accepts. Automaton has 19172 states and 77844 transitions. Word has length 74 [2021-05-21 15:39:47,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:47,143 INFO L482 AbstractCegarLoop]: Abstraction has 19172 states and 77844 transitions. [2021-05-21 15:39:47,143 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:47,144 INFO L276 IsEmpty]: Start isEmpty. Operand 19172 states and 77844 transitions. [2021-05-21 15:39:47,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-21 15:39:47,165 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:47,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:47,165 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-05-21 15:39:47,165 INFO L430 AbstractCegarLoop]: === Iteration 43 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:47,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:47,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1223596091, now seen corresponding path program 6 times [2021-05-21 15:39:47,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:47,166 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019556544] [2021-05-21 15:39:47,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:47,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:47,669 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:47,669 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019556544] [2021-05-21 15:39:47,669 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019556544] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:47,669 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:47,669 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-21 15:39:47,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027686300] [2021-05-21 15:39:47,669 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-21 15:39:47,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:47,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-21 15:39:47,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-05-21 15:39:47,670 INFO L87 Difference]: Start difference. First operand 19172 states and 77844 transitions. Second operand has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:49,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:49,314 INFO L93 Difference]: Finished difference Result 22885 states and 90632 transitions. [2021-05-21 15:39:49,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-21 15:39:49,315 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-05-21 15:39:49,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:49,525 INFO L225 Difference]: With dead ends: 22885 [2021-05-21 15:39:49,525 INFO L226 Difference]: Without dead ends: 22021 [2021-05-21 15:39:49,526 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1370.7ms TimeCoverageRelationStatistics Valid=253, Invalid=1817, Unknown=0, NotChecked=0, Total=2070 [2021-05-21 15:39:49,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22021 states. [2021-05-21 15:39:49,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22021 to 19193. [2021-05-21 15:39:49,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19193 states, 19191 states have (on average 4.058204366630191) internal successors, (77881), 19192 states have internal predecessors, (77881), 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-05-21 15:39:49,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19193 states to 19193 states and 77881 transitions. [2021-05-21 15:39:49,851 INFO L78 Accepts]: Start accepts. Automaton has 19193 states and 77881 transitions. Word has length 74 [2021-05-21 15:39:49,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:49,851 INFO L482 AbstractCegarLoop]: Abstraction has 19193 states and 77881 transitions. [2021-05-21 15:39:49,852 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:49,852 INFO L276 IsEmpty]: Start isEmpty. Operand 19193 states and 77881 transitions. [2021-05-21 15:39:49,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-21 15:39:49,872 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:49,872 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:49,872 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-05-21 15:39:49,873 INFO L430 AbstractCegarLoop]: === Iteration 44 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:49,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:49,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1885361097, now seen corresponding path program 7 times [2021-05-21 15:39:49,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:49,873 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314774260] [2021-05-21 15:39:49,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:50,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:50,104 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:50,104 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314774260] [2021-05-21 15:39:50,104 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314774260] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:50,104 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:50,104 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-21 15:39:50,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549297681] [2021-05-21 15:39:50,104 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-21 15:39:50,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:50,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-21 15:39:50,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-05-21 15:39:50,105 INFO L87 Difference]: Start difference. First operand 19193 states and 77881 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:50,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:50,810 INFO L93 Difference]: Finished difference Result 22856 states and 90587 transitions. [2021-05-21 15:39:50,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-21 15:39:50,811 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-05-21 15:39:50,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:50,871 INFO L225 Difference]: With dead ends: 22856 [2021-05-21 15:39:50,871 INFO L226 Difference]: Without dead ends: 21992 [2021-05-21 15:39:50,871 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 418.0ms TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2021-05-21 15:39:50,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21992 states. [2021-05-21 15:39:51,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21992 to 19194. [2021-05-21 15:39:51,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19194 states, 19192 states have (on average 4.058045018757816) internal successors, (77882), 19193 states have internal predecessors, (77882), 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-05-21 15:39:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19194 states to 19194 states and 77882 transitions. [2021-05-21 15:39:51,333 INFO L78 Accepts]: Start accepts. Automaton has 19194 states and 77882 transitions. Word has length 74 [2021-05-21 15:39:51,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:51,333 INFO L482 AbstractCegarLoop]: Abstraction has 19194 states and 77882 transitions. [2021-05-21 15:39:51,333 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand 19194 states and 77882 transitions. [2021-05-21 15:39:51,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-21 15:39:51,354 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:51,354 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:51,354 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-05-21 15:39:51,354 INFO L430 AbstractCegarLoop]: === Iteration 45 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:51,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:51,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1675812887, now seen corresponding path program 8 times [2021-05-21 15:39:51,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:51,355 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598650305] [2021-05-21 15:39:51,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:51,595 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:51,595 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598650305] [2021-05-21 15:39:51,595 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598650305] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:51,595 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:51,595 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-21 15:39:51,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919096022] [2021-05-21 15:39:51,595 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-21 15:39:51,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:51,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-21 15:39:51,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-05-21 15:39:51,596 INFO L87 Difference]: Start difference. First operand 19194 states and 77882 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:52,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:52,254 INFO L93 Difference]: Finished difference Result 22886 states and 90633 transitions. [2021-05-21 15:39:52,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-21 15:39:52,255 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-05-21 15:39:52,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:52,302 INFO L225 Difference]: With dead ends: 22886 [2021-05-21 15:39:52,302 INFO L226 Difference]: Without dead ends: 22022 [2021-05-21 15:39:52,303 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 404.4ms TimeCoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2021-05-21 15:39:52,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22022 states. [2021-05-21 15:39:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22022 to 19223. [2021-05-21 15:39:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19223 states, 19221 states have (on average 4.054263565891473) internal successors, (77927), 19222 states have internal predecessors, (77927), 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-05-21 15:39:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19223 states to 19223 states and 77927 transitions. [2021-05-21 15:39:52,792 INFO L78 Accepts]: Start accepts. Automaton has 19223 states and 77927 transitions. Word has length 74 [2021-05-21 15:39:52,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:52,792 INFO L482 AbstractCegarLoop]: Abstraction has 19223 states and 77927 transitions. [2021-05-21 15:39:52,792 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:52,792 INFO L276 IsEmpty]: Start isEmpty. Operand 19223 states and 77927 transitions. [2021-05-21 15:39:52,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-21 15:39:52,813 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:52,813 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 15:39:52,813 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-05-21 15:39:52,813 INFO L430 AbstractCegarLoop]: === Iteration 46 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:52,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:52,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1475525857, now seen corresponding path program 9 times [2021-05-21 15:39:52,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:52,813 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013351996] [2021-05-21 15:39:52,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:53,019 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:53,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013351996] [2021-05-21 15:39:53,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013351996] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:53,019 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:53,019 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-21 15:39:53,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495562032] [2021-05-21 15:39:53,020 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-21 15:39:53,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:53,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-21 15:39:53,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-05-21 15:39:53,020 INFO L87 Difference]: Start difference. First operand 19223 states and 77927 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:53,404 INFO L93 Difference]: Finished difference Result 21916 states and 86727 transitions. [2021-05-21 15:39:53,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-21 15:39:53,405 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-05-21 15:39:53,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:53,448 INFO L225 Difference]: With dead ends: 21916 [2021-05-21 15:39:53,448 INFO L226 Difference]: Without dead ends: 21052 [2021-05-21 15:39:53,448 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 244.2ms TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-05-21 15:39:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21052 states. [2021-05-21 15:39:53,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21052 to 18224. [2021-05-21 15:39:53,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18224 states, 18222 states have (on average 4.059708045220064) internal successors, (73976), 18223 states have internal predecessors, (73976), 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-05-21 15:39:53,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18224 states to 18224 states and 73976 transitions. [2021-05-21 15:39:53,772 INFO L78 Accepts]: Start accepts. Automaton has 18224 states and 73976 transitions. Word has length 74 [2021-05-21 15:39:53,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:53,772 INFO L482 AbstractCegarLoop]: Abstraction has 18224 states and 73976 transitions. [2021-05-21 15:39:53,772 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 15:39:53,773 INFO L276 IsEmpty]: Start isEmpty. Operand 18224 states and 73976 transitions. [2021-05-21 15:39:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-21 15:39:53,794 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:53,794 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, 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-05-21 15:39:53,794 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-05-21 15:39:53,794 INFO L430 AbstractCegarLoop]: === Iteration 47 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:53,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:53,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1183741372, now seen corresponding path program 1 times [2021-05-21 15:39:53,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:53,795 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812634415] [2021-05-21 15:39:53,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:54,241 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2021-05-21 15:39:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:54,735 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:54,735 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812634415] [2021-05-21 15:39:54,735 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812634415] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:54,735 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:54,735 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-21 15:39:54,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265975927] [2021-05-21 15:39:54,736 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-21 15:39:54,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:54,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-21 15:39:54,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-05-21 15:39:54,736 INFO L87 Difference]: Start difference. First operand 18224 states and 73976 transitions. Second operand has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 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-05-21 15:39:56,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:56,368 INFO L93 Difference]: Finished difference Result 23749 states and 93878 transitions. [2021-05-21 15:39:56,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-21 15:39:56,369 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 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-05-21 15:39:56,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:56,417 INFO L225 Difference]: With dead ends: 23749 [2021-05-21 15:39:56,418 INFO L226 Difference]: Without dead ends: 23065 [2021-05-21 15:39:56,418 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1292.7ms TimeCoverageRelationStatistics Valid=258, Invalid=1998, Unknown=0, NotChecked=0, Total=2256 [2021-05-21 15:39:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23065 states. [2021-05-21 15:39:56,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23065 to 18224. [2021-05-21 15:39:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18224 states, 18222 states have (on average 4.059708045220064) internal successors, (73976), 18223 states have internal predecessors, (73976), 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-05-21 15:39:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18224 states to 18224 states and 73976 transitions. [2021-05-21 15:39:56,849 INFO L78 Accepts]: Start accepts. Automaton has 18224 states and 73976 transitions. Word has length 76 [2021-05-21 15:39:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:56,849 INFO L482 AbstractCegarLoop]: Abstraction has 18224 states and 73976 transitions. [2021-05-21 15:39:56,849 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 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-05-21 15:39:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 18224 states and 73976 transitions. [2021-05-21 15:39:56,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-21 15:39:56,871 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:56,871 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, 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-05-21 15:39:56,871 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-05-21 15:39:56,871 INFO L430 AbstractCegarLoop]: === Iteration 48 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:56,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:56,871 INFO L82 PathProgramCache]: Analyzing trace with hash -342292756, now seen corresponding path program 2 times [2021-05-21 15:39:56,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:56,872 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558051824] [2021-05-21 15:39:56,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:57,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:57,374 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:57,374 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558051824] [2021-05-21 15:39:57,374 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558051824] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:57,374 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:57,374 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-21 15:39:57,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227391520] [2021-05-21 15:39:57,374 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-21 15:39:57,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:57,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-21 15:39:57,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2021-05-21 15:39:57,375 INFO L87 Difference]: Start difference. First operand 18224 states and 73976 transitions. Second operand has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 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-05-21 15:39:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:39:58,887 INFO L93 Difference]: Finished difference Result 22030 states and 86807 transitions. [2021-05-21 15:39:58,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-21 15:39:58,888 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 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-05-21 15:39:58,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:39:58,933 INFO L225 Difference]: With dead ends: 22030 [2021-05-21 15:39:58,933 INFO L226 Difference]: Without dead ends: 21346 [2021-05-21 15:39:58,933 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 964.1ms TimeCoverageRelationStatistics Valid=196, Invalid=1526, Unknown=0, NotChecked=0, Total=1722 [2021-05-21 15:39:58,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21346 states. [2021-05-21 15:39:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21346 to 16478. [2021-05-21 15:39:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16478 states, 16476 states have (on average 4.074471959213401) internal successors, (67131), 16477 states have internal predecessors, (67131), 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-05-21 15:39:59,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16478 states to 16478 states and 67131 transitions. [2021-05-21 15:39:59,216 INFO L78 Accepts]: Start accepts. Automaton has 16478 states and 67131 transitions. Word has length 76 [2021-05-21 15:39:59,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:39:59,216 INFO L482 AbstractCegarLoop]: Abstraction has 16478 states and 67131 transitions. [2021-05-21 15:39:59,216 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 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-05-21 15:39:59,216 INFO L276 IsEmpty]: Start isEmpty. Operand 16478 states and 67131 transitions. [2021-05-21 15:39:59,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-21 15:39:59,237 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:39:59,237 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, 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-05-21 15:39:59,238 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-05-21 15:39:59,238 INFO L430 AbstractCegarLoop]: === Iteration 49 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:39:59,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:39:59,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1885510190, now seen corresponding path program 3 times [2021-05-21 15:39:59,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:39:59,238 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321229343] [2021-05-21 15:39:59,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:39:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:39:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:39:59,687 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:39:59,687 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321229343] [2021-05-21 15:39:59,687 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321229343] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:39:59,687 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:39:59,687 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-21 15:39:59,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126790892] [2021-05-21 15:39:59,687 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-21 15:39:59,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:39:59,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-21 15:39:59,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2021-05-21 15:39:59,687 INFO L87 Difference]: Start difference. First operand 16478 states and 67131 transitions. Second operand has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 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-05-21 15:40:00,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:40:00,909 INFO L93 Difference]: Finished difference Result 21346 states and 84263 transitions. [2021-05-21 15:40:00,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-21 15:40:00,910 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 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-05-21 15:40:00,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:40:00,954 INFO L225 Difference]: With dead ends: 21346 [2021-05-21 15:40:00,954 INFO L226 Difference]: Without dead ends: 21004 [2021-05-21 15:40:00,954 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 760.6ms TimeCoverageRelationStatistics Valid=160, Invalid=1246, Unknown=0, NotChecked=0, Total=1406 [2021-05-21 15:40:00,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21004 states. [2021-05-21 15:40:01,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21004 to 16478. [2021-05-21 15:40:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16478 states, 16476 states have (on average 4.074471959213401) internal successors, (67131), 16477 states have internal predecessors, (67131), 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-05-21 15:40:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16478 states to 16478 states and 67131 transitions. [2021-05-21 15:40:01,236 INFO L78 Accepts]: Start accepts. Automaton has 16478 states and 67131 transitions. Word has length 76 [2021-05-21 15:40:01,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:40:01,236 INFO L482 AbstractCegarLoop]: Abstraction has 16478 states and 67131 transitions. [2021-05-21 15:40:01,236 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 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-05-21 15:40:01,236 INFO L276 IsEmpty]: Start isEmpty. Operand 16478 states and 67131 transitions. [2021-05-21 15:40:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-21 15:40:01,256 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:40:01,256 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, 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-05-21 15:40:01,256 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-05-21 15:40:01,256 INFO L430 AbstractCegarLoop]: === Iteration 50 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:40:01,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:40:01,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1564620922, now seen corresponding path program 4 times [2021-05-21 15:40:01,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:40:01,257 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939360393] [2021-05-21 15:40:01,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:40:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 15:40:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 15:40:01,603 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 15:40:01,603 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939360393] [2021-05-21 15:40:01,603 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939360393] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 15:40:01,603 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 15:40:01,603 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-21 15:40:01,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764805841] [2021-05-21 15:40:01,603 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-21 15:40:01,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 15:40:01,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-21 15:40:01,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-05-21 15:40:01,604 INFO L87 Difference]: Start difference. First operand 16478 states and 67131 transitions. Second operand has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 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-05-21 15:40:02,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 15:40:02,704 INFO L93 Difference]: Finished difference Result 16265 states and 64818 transitions. [2021-05-21 15:40:02,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-21 15:40:02,705 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 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-05-21 15:40:02,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 15:40:02,818 INFO L225 Difference]: With dead ends: 16265 [2021-05-21 15:40:02,818 INFO L226 Difference]: Without dead ends: 15923 [2021-05-21 15:40:02,818 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 662.9ms TimeCoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2021-05-21 15:40:02,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15923 states. [2021-05-21 15:40:02,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15923 to 11363. [2021-05-21 15:40:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11363 states, 11362 states have (on average 4.191867628938567) internal successors, (47628), 11362 states have internal predecessors, (47628), 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-05-21 15:40:03,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11363 states to 11363 states and 47628 transitions. [2021-05-21 15:40:03,023 INFO L78 Accepts]: Start accepts. Automaton has 11363 states and 47628 transitions. Word has length 76 [2021-05-21 15:40:03,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 15:40:03,023 INFO L482 AbstractCegarLoop]: Abstraction has 11363 states and 47628 transitions. [2021-05-21 15:40:03,023 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 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-05-21 15:40:03,023 INFO L276 IsEmpty]: Start isEmpty. Operand 11363 states and 47628 transitions. [2021-05-21 15:40:03,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-05-21 15:40:03,041 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 15:40:03,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05-21 15:40:03,041 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-05-21 15:40:03,042 INFO L430 AbstractCegarLoop]: === Iteration 51 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-05-21 15:40:03,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 15:40:03,042 INFO L82 PathProgramCache]: Analyzing trace with hash 511479404, now seen corresponding path program 1 times [2021-05-21 15:40:03,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 15:40:03,042 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909328557] [2021-05-21 15:40:03,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 15:40:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 15:40:03,057 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 15:40:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 15:40:03,074 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 15:40:03,103 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-21 15:40:03,103 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-05-21 15:40:03,104 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-05-21 15:40:03,105 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-05-21 15:40:03,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.05 03:40:03 BasicIcfg [2021-05-21 15:40:03,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-21 15:40:03,177 INFO L168 Benchmark]: Toolchain (without parser) took 152116.18 ms. Allocated memory was 381.7 MB in the beginning and 15.9 GB in the end (delta: 15.5 GB). Free memory was 343.7 MB in the beginning and 13.9 GB in the end (delta: -13.6 GB). Peak memory consumption was 1.9 GB. Max. memory is 16.0 GB. [2021-05-21 15:40:03,177 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 381.7 MB. Free memory is still 362.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-05-21 15:40:03,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 465.61 ms. Allocated memory is still 381.7 MB. Free memory was 343.5 MB in the beginning and 305.4 MB in the end (delta: 38.1 MB). Peak memory consumption was 40.7 MB. Max. memory is 16.0 GB. [2021-05-21 15:40:03,177 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.86 ms. Allocated memory is still 381.7 MB. Free memory was 305.4 MB in the beginning and 303.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-05-21 15:40:03,177 INFO L168 Benchmark]: Boogie Preprocessor took 15.76 ms. Allocated memory is still 381.7 MB. Free memory was 303.3 MB in the beginning and 302.1 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-05-21 15:40:03,177 INFO L168 Benchmark]: RCFGBuilder took 413.25 ms. Allocated memory is still 381.7 MB. Free memory was 302.1 MB in the beginning and 271.9 MB in the end (delta: 30.3 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.0 GB. [2021-05-21 15:40:03,177 INFO L168 Benchmark]: TraceAbstraction took 151190.38 ms. Allocated memory was 381.7 MB in the beginning and 15.9 GB in the end (delta: 15.5 GB). Free memory was 270.9 MB in the beginning and 13.9 GB in the end (delta: -13.6 GB). Peak memory consumption was 1.9 GB. Max. memory is 16.0 GB. [2021-05-21 15:40:03,178 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.11 ms. Allocated memory is still 381.7 MB. Free memory is still 362.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 465.61 ms. Allocated memory is still 381.7 MB. Free memory was 343.5 MB in the beginning and 305.4 MB in the end (delta: 38.1 MB). Peak memory consumption was 40.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 25.86 ms. Allocated memory is still 381.7 MB. Free memory was 305.4 MB in the beginning and 303.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 15.76 ms. Allocated memory is still 381.7 MB. Free memory was 303.3 MB in the beginning and 302.1 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 413.25 ms. Allocated memory is still 381.7 MB. Free memory was 302.1 MB in the beginning and 271.9 MB in the end (delta: 30.3 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 151190.38 ms. Allocated memory was 381.7 MB in the beginning and 15.9 GB in the end (delta: 15.5 GB). Free memory was 270.9 MB in the beginning and 13.9 GB in the end (delta: -13.6 GB). Peak memory consumption was 1.9 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1123]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1124] 0 char *v; VAL [v={0:0}] [L1161] 0 pthread_t t; VAL [v={0:0}] [L1162] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={0:0}] [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t1, 0, thread1, 0)=-2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={0:0}] [L1148] 1 \read(t1) VAL [\read(t1)=-2, arg={0:0}, arg={0:0}, arg={0:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={0:0}] [L1127] 2 v = malloc(sizeof(char)) VAL [\read(t1)=-2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1128] 2 return 0; VAL [\read(t1)=-2, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=-2, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1149] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t2, 0, thread2, 0)=-1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1150] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t3, 0, thread3, 0)=0, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1151] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t4, 0, thread2, 0)=1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1133] 5 v[0] = 'X' VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t4, 0, thread2, 0)=1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1135] 5 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t4, 0, thread2, 0)=1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1133] 3 v[0] = 'X' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1135] 3 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1163] 0 \read(t) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1133] 6 v[0] = 'X' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1140] 4 v[0] = 'Y' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1142] 4 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1135] 6 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1153] 1 \read(t2) VAL [\read(t2)=-1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=-1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1154] 1 \read(t3) VAL [\read(t3)=0, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=0, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1155] 1 \read(t4) VAL [\read(t4)=1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1156] 1 \read(t5) VAL [\read(t5)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] [L1163] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] [L1164] 0 v[0] VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] [L1123] COND TRUE 0 !expression VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] [L1123] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 216 locations, 12 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 150853.5ms, OverallIterations: 51, TraceHistogramMax: 1, EmptinessCheckTime: 1264.6ms, AutomataDifference: 69710.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5153.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 11798 SDtfs, 19899 SDslu, 106910 SDs, 0 SdLazy, 49674 SolverSat, 2654 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22559.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1722 GetRequests, 107 SyntacticMatches, 135 SemanticMatches, 1480 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9517 ImplicationChecksByTransitivity, 33996.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=70531occurred in iteration=0, InterpolantAutomatonStates: 1108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 56163.5ms AutomataMinimizationTime, 50 MinimizatonAttempts, 329056 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 69.5ms SsaConstructionTime, 427.6ms SatisfiabilityAnalysisTime, 17596.4ms InterpolantComputationTime, 3439 NumberOfCodeBlocks, 3439 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 3279 ConstructedInterpolants, 0 QuantifiedInterpolants, 73527 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 50 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...