/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-18 10:21:04,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 10:21:04,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 10:21:04,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 10:21:04,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 10:21:04,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 10:21:04,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 10:21:04,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 10:21:04,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 10:21:04,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 10:21:04,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 10:21:04,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 10:21:04,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 10:21:04,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 10:21:04,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 10:21:04,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 10:21:04,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 10:21:04,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 10:21:04,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 10:21:04,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 10:21:04,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 10:21:04,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 10:21:04,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 10:21:04,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 10:21:04,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 10:21:04,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 10:21:04,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 10:21:04,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 10:21:04,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 10:21:04,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 10:21:04,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 10:21:04,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 10:21:04,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 10:21:04,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 10:21:04,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 10:21:04,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 10:21:04,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 10:21:04,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 10:21:04,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 10:21:04,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 10:21:04,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 10:21:04,371 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2022-01-18 10:21:04,397 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 10:21:04,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 10:21:04,398 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 10:21:04,399 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 10:21:04,399 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 10:21:04,399 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 10:21:04,400 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 10:21:04,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 10:21:04,400 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 10:21:04,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 10:21:04,401 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 10:21:04,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 10:21:04,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 10:21:04,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 10:21:04,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 10:21:04,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 10:21:04,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 10:21:04,402 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 10:21:04,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 10:21:04,402 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 10:21:04,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 10:21:04,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 10:21:04,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 10:21:04,402 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 10:21:04,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 10:21:04,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 10:21:04,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 10:21:04,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 10:21:04,403 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 10:21:04,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 10:21:04,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 10:21:04,403 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 10:21:04,403 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 10:21:04,404 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2022-01-18 10:21:04,404 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 [2022-01-18 10:21:04,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 10:21:04,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 10:21:04,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 10:21:04,662 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 10:21:04,663 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 10:21:04,664 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i [2022-01-18 10:21:04,720 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3630e3f6/cfe29e0229794f978d25ff4c91125816/FLAG591b1d5ac [2022-01-18 10:21:05,199 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 10:21:05,199 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i [2022-01-18 10:21:05,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3630e3f6/cfe29e0229794f978d25ff4c91125816/FLAG591b1d5ac [2022-01-18 10:21:05,224 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3630e3f6/cfe29e0229794f978d25ff4c91125816 [2022-01-18 10:21:05,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 10:21:05,227 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 10:21:05,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 10:21:05,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 10:21:05,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 10:21:05,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:21:05" (1/1) ... [2022-01-18 10:21:05,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e0ff97a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:21:05, skipping insertion in model container [2022-01-18 10:21:05,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:21:05" (1/1) ... [2022-01-18 10:21:05,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 10:21:05,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 10:21:05,597 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i[41323,41336] [2022-01-18 10:21:05,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 10:21:05,654 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 10:21:05,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i[41323,41336] [2022-01-18 10:21:05,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 10:21:05,745 INFO L208 MainTranslator]: Completed translation [2022-01-18 10:21:05,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:21:05 WrapperNode [2022-01-18 10:21:05,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 10:21:05,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 10:21:05,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 10:21:05,747 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 10:21:05,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:21:05" (1/1) ... [2022-01-18 10:21:05,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:21:05" (1/1) ... [2022-01-18 10:21:05,815 INFO L137 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 189 [2022-01-18 10:21:05,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 10:21:05,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 10:21:05,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 10:21:05,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 10:21:05,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:21:05" (1/1) ... [2022-01-18 10:21:05,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:21:05" (1/1) ... [2022-01-18 10:21:05,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:21:05" (1/1) ... [2022-01-18 10:21:05,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:21:05" (1/1) ... [2022-01-18 10:21:05,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:21:05" (1/1) ... [2022-01-18 10:21:05,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:21:05" (1/1) ... [2022-01-18 10:21:05,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:21:05" (1/1) ... [2022-01-18 10:21:05,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 10:21:05,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 10:21:05,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 10:21:05,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 10:21:05,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:21:05" (1/1) ... [2022-01-18 10:21:05,861 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 10:21:05,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:21:05,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-18 10:21:05,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-18 10:21:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 10:21:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 10:21:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 10:21:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 10:21:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-18 10:21:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 10:21:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-01-18 10:21:05,934 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-01-18 10:21:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 10:21:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 10:21:05,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 10:21:05,936 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 10:21:06,107 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 10:21:06,108 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 10:21:06,308 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 10:21:06,317 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 10:21:06,317 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2022-01-18 10:21:06,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:21:06 BoogieIcfgContainer [2022-01-18 10:21:06,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 10:21:06,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 10:21:06,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 10:21:06,325 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 10:21:06,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 10:21:05" (1/3) ... [2022-01-18 10:21:06,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0517ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:21:06, skipping insertion in model container [2022-01-18 10:21:06,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:21:05" (2/3) ... [2022-01-18 10:21:06,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0517ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:21:06, skipping insertion in model container [2022-01-18 10:21:06,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:21:06" (3/3) ... [2022-01-18 10:21:06,328 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_77-tricky_address4_racing.i [2022-01-18 10:21:06,332 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 10:21:06,332 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 10:21:06,332 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-18 10:21:06,332 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 10:21:06,378 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,378 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,378 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,378 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,379 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,379 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,379 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,379 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,379 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,382 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,382 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,382 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,382 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,382 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,385 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,385 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,385 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,385 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,393 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,393 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,393 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,393 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,393 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,396 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,396 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,396 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,396 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,396 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,396 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,400 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,400 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,400 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,400 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,400 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,401 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,401 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,401 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,401 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,401 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,402 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,402 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,402 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,402 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,402 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,402 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,403 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,403 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,403 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,403 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,404 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,404 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,406 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,407 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,407 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,407 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,407 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,407 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,407 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,408 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,408 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,408 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,408 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,408 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,408 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,408 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,408 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,409 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,409 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,409 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,409 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,409 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,409 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,409 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,410 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:06,412 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-01-18 10:21:06,450 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 10:21:06,456 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 10:21:06,456 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-18 10:21:06,471 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 172 places, 200 transitions, 408 flow [2022-01-18 10:21:06,626 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4000 states, 3993 states have (on average 2.374154770848986) internal successors, (9480), 3999 states have internal predecessors, (9480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:06,639 INFO L276 IsEmpty]: Start isEmpty. Operand has 4000 states, 3993 states have (on average 2.374154770848986) internal successors, (9480), 3999 states have internal predecessors, (9480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:06,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-18 10:21:06,651 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:21:06,652 INFO L514 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] [2022-01-18 10:21:06,653 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 10:21:06,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:21:06,663 INFO L85 PathProgramCache]: Analyzing trace with hash 614106673, now seen corresponding path program 1 times [2022-01-18 10:21:06,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:21:06,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383770969] [2022-01-18 10:21:06,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:06,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:21:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:21:06,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:21:06,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383770969] [2022-01-18 10:21:06,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383770969] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:21:06,852 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 10:21:06,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 10:21:06,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819756213] [2022-01-18 10:21:06,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:21:06,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 10:21:06,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:21:06,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 10:21:06,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 10:21:06,895 INFO L87 Difference]: Start difference. First operand has 4000 states, 3993 states have (on average 2.374154770848986) internal successors, (9480), 3999 states have internal predecessors, (9480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:06,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:21:06,975 INFO L93 Difference]: Finished difference Result 3874 states and 7664 transitions. [2022-01-18 10:21:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 10:21:06,978 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-01-18 10:21:06,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:21:07,014 INFO L225 Difference]: With dead ends: 3874 [2022-01-18 10:21:07,014 INFO L226 Difference]: Without dead ends: 2566 [2022-01-18 10:21:07,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 10:21:07,020 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:21:07,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:21:07,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2022-01-18 10:21:07,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2566. [2022-01-18 10:21:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 2559 states have (on average 1.9538882375928097) internal successors, (5000), 2565 states have internal predecessors, (5000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 5000 transitions. [2022-01-18 10:21:07,162 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 5000 transitions. Word has length 50 [2022-01-18 10:21:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:21:07,164 INFO L470 AbstractCegarLoop]: Abstraction has 2566 states and 5000 transitions. [2022-01-18 10:21:07,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 5000 transitions. [2022-01-18 10:21:07,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-18 10:21:07,170 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:21:07,170 INFO L514 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] [2022-01-18 10:21:07,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 10:21:07,171 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 10:21:07,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:21:07,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1211694797, now seen corresponding path program 1 times [2022-01-18 10:21:07,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:21:07,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330733892] [2022-01-18 10:21:07,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:07,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:21:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:21:07,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:21:07,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330733892] [2022-01-18 10:21:07,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330733892] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:21:07,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 10:21:07,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 10:21:07,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127637537] [2022-01-18 10:21:07,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:21:07,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 10:21:07,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:21:07,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 10:21:07,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 10:21:07,286 INFO L87 Difference]: Start difference. First operand 2566 states and 5000 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:07,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:21:07,339 INFO L93 Difference]: Finished difference Result 2570 states and 5004 transitions. [2022-01-18 10:21:07,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 10:21:07,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-01-18 10:21:07,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:21:07,350 INFO L225 Difference]: With dead ends: 2570 [2022-01-18 10:21:07,350 INFO L226 Difference]: Without dead ends: 2570 [2022-01-18 10:21:07,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 10:21:07,352 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 3 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:21:07,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 318 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:21:07,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2022-01-18 10:21:07,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2567. [2022-01-18 10:21:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2567 states, 2560 states have (on average 1.953515625) internal successors, (5001), 2566 states have internal predecessors, (5001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 5001 transitions. [2022-01-18 10:21:07,423 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 5001 transitions. Word has length 50 [2022-01-18 10:21:07,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:21:07,424 INFO L470 AbstractCegarLoop]: Abstraction has 2567 states and 5001 transitions. [2022-01-18 10:21:07,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 5001 transitions. [2022-01-18 10:21:07,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-18 10:21:07,428 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:21:07,429 INFO L514 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] [2022-01-18 10:21:07,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 10:21:07,429 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 10:21:07,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:21:07,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1970782420, now seen corresponding path program 1 times [2022-01-18 10:21:07,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:21:07,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836445716] [2022-01-18 10:21:07,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:07,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:21:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:07,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:21:07,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:21:07,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836445716] [2022-01-18 10:21:07,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836445716] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:21:07,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568311718] [2022-01-18 10:21:07,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:07,541 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:21:07,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:21:07,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:21:07,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-18 10:21:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:07,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-18 10:21:07,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:21:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:21:07,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 10:21:07,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568311718] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:21:07,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 10:21:07,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-01-18 10:21:07,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225686362] [2022-01-18 10:21:07,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:21:07,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 10:21:07,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:21:07,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 10:21:07,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-18 10:21:07,851 INFO L87 Difference]: Start difference. First operand 2567 states and 5001 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:07,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:21:07,886 INFO L93 Difference]: Finished difference Result 2552 states and 4986 transitions. [2022-01-18 10:21:07,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 10:21:07,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-01-18 10:21:07,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:21:07,929 INFO L225 Difference]: With dead ends: 2552 [2022-01-18 10:21:07,929 INFO L226 Difference]: Without dead ends: 2552 [2022-01-18 10:21:07,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-18 10:21:07,930 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 68 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:21:07,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 316 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:21:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2022-01-18 10:21:07,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2552. [2022-01-18 10:21:07,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2546 states have (on average 1.9583660644147682) internal successors, (4986), 2551 states have internal predecessors, (4986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 4986 transitions. [2022-01-18 10:21:07,992 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 4986 transitions. Word has length 55 [2022-01-18 10:21:07,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:21:07,992 INFO L470 AbstractCegarLoop]: Abstraction has 2552 states and 4986 transitions. [2022-01-18 10:21:07,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:07,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 4986 transitions. [2022-01-18 10:21:07,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-18 10:21:07,994 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:21:07,994 INFO L514 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] [2022-01-18 10:21:08,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-18 10:21:08,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:21:08,195 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 10:21:08,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:21:08,196 INFO L85 PathProgramCache]: Analyzing trace with hash 449728335, now seen corresponding path program 1 times [2022-01-18 10:21:08,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:21:08,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932581239] [2022-01-18 10:21:08,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:08,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:21:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:21:08,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:21:08,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932581239] [2022-01-18 10:21:08,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932581239] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:21:08,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745499908] [2022-01-18 10:21:08,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:08,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:21:08,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:21:08,304 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:21:08,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-18 10:21:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:08,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-18 10:21:08,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:21:08,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:21:08,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:21:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:21:08,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745499908] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:21:08,708 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:21:08,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-18 10:21:08,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159372614] [2022-01-18 10:21:08,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:21:08,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 10:21:08,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:21:08,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 10:21:08,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-18 10:21:08,713 INFO L87 Difference]: Start difference. First operand 2552 states and 4986 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:08,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:21:08,801 INFO L93 Difference]: Finished difference Result 2562 states and 4996 transitions. [2022-01-18 10:21:08,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 10:21:08,802 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-01-18 10:21:08,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:21:08,813 INFO L225 Difference]: With dead ends: 2562 [2022-01-18 10:21:08,813 INFO L226 Difference]: Without dead ends: 2562 [2022-01-18 10:21:08,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-01-18 10:21:08,817 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 16 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:21:08,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 795 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:21:08,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2022-01-18 10:21:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2562. [2022-01-18 10:21:08,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2562 states, 2556 states have (on average 1.9546165884194053) internal successors, (4996), 2561 states have internal predecessors, (4996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 4996 transitions. [2022-01-18 10:21:08,868 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 4996 transitions. Word has length 65 [2022-01-18 10:21:08,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:21:08,869 INFO L470 AbstractCegarLoop]: Abstraction has 2562 states and 4996 transitions. [2022-01-18 10:21:08,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:08,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 4996 transitions. [2022-01-18 10:21:08,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-18 10:21:08,871 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:21:08,871 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:21:08,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-18 10:21:09,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-18 10:21:09,096 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 10:21:09,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:21:09,096 INFO L85 PathProgramCache]: Analyzing trace with hash 305383343, now seen corresponding path program 2 times [2022-01-18 10:21:09,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:21:09,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319530759] [2022-01-18 10:21:09,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:09,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:21:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-18 10:21:09,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:21:09,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319530759] [2022-01-18 10:21:09,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319530759] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:21:09,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947862036] [2022-01-18 10:21:09,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 10:21:09,151 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:21:09,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:21:09,152 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:21:09,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-18 10:21:09,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 10:21:09,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 10:21:09,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 10:21:09,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:21:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:21:09,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:21:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:21:09,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947862036] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:21:09,578 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:21:09,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-01-18 10:21:09,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834700200] [2022-01-18 10:21:09,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:21:09,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-18 10:21:09,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:21:09,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-18 10:21:09,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-01-18 10:21:09,579 INFO L87 Difference]: Start difference. First operand 2562 states and 4996 transitions. Second operand has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 19 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:09,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:21:09,781 INFO L93 Difference]: Finished difference Result 580 states and 1021 transitions. [2022-01-18 10:21:09,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-18 10:21:09,781 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 19 states have internal predecessors, (121), 0 states have call successors, (0), 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 75 [2022-01-18 10:21:09,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:21:09,783 INFO L225 Difference]: With dead ends: 580 [2022-01-18 10:21:09,783 INFO L226 Difference]: Without dead ends: 394 [2022-01-18 10:21:09,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=780, Unknown=0, NotChecked=0, Total=1056 [2022-01-18 10:21:09,784 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 415 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 10:21:09,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [415 Valid, 1006 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 10:21:09,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-01-18 10:21:09,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2022-01-18 10:21:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 1.7150127226463103) internal successors, (674), 393 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:09,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 674 transitions. [2022-01-18 10:21:09,792 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 674 transitions. Word has length 75 [2022-01-18 10:21:09,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:21:09,793 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 674 transitions. [2022-01-18 10:21:09,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 19 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:09,793 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 674 transitions. [2022-01-18 10:21:09,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-18 10:21:09,794 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:21:09,794 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:21:09,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-18 10:21:10,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:21:10,007 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 10:21:10,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:21:10,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1085374393, now seen corresponding path program 1 times [2022-01-18 10:21:10,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:21:10,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636463059] [2022-01-18 10:21:10,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:10,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:21:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:21:10,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:21:10,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636463059] [2022-01-18 10:21:10,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636463059] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:21:10,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020179247] [2022-01-18 10:21:10,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:10,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:21:10,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:21:10,211 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:21:10,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-18 10:21:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:10,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-18 10:21:10,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:21:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:21:10,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:21:10,767 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:21:10,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020179247] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:21:10,768 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:21:10,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-18 10:21:10,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189781667] [2022-01-18 10:21:10,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:21:10,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-18 10:21:10,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:21:10,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-18 10:21:10,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-18 10:21:10,770 INFO L87 Difference]: Start difference. First operand 394 states and 674 transitions. Second operand has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 23 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:11,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:21:11,044 INFO L93 Difference]: Finished difference Result 409 states and 689 transitions. [2022-01-18 10:21:11,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-18 10:21:11,044 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 23 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-01-18 10:21:11,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:21:11,046 INFO L225 Difference]: With dead ends: 409 [2022-01-18 10:21:11,046 INFO L226 Difference]: Without dead ends: 409 [2022-01-18 10:21:11,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-01-18 10:21:11,048 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 46 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 10:21:11,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 583 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 10:21:11,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-01-18 10:21:11,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2022-01-18 10:21:11,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 408 states have (on average 1.6887254901960784) internal successors, (689), 408 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 689 transitions. [2022-01-18 10:21:11,057 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 689 transitions. Word has length 103 [2022-01-18 10:21:11,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:21:11,057 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 689 transitions. [2022-01-18 10:21:11,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 23 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 689 transitions. [2022-01-18 10:21:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-18 10:21:11,059 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:21:11,059 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:21:11,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-18 10:21:11,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:21:11,275 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 10:21:11,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:21:11,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1164011634, now seen corresponding path program 2 times [2022-01-18 10:21:11,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:21:11,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126458733] [2022-01-18 10:21:11,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:11,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:21:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:21:11,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:21:11,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126458733] [2022-01-18 10:21:11,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126458733] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:21:11,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 10:21:11,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-18 10:21:11,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539833319] [2022-01-18 10:21:11,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:21:11,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-18 10:21:11,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:21:11,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-18 10:21:11,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-01-18 10:21:11,706 INFO L87 Difference]: Start difference. First operand 409 states and 689 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 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) [2022-01-18 10:21:12,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:21:12,444 INFO L93 Difference]: Finished difference Result 401 states and 666 transitions. [2022-01-18 10:21:12,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-18 10:21:12,445 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 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 118 [2022-01-18 10:21:12,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:21:12,446 INFO L225 Difference]: With dead ends: 401 [2022-01-18 10:21:12,446 INFO L226 Difference]: Without dead ends: 346 [2022-01-18 10:21:12,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2022-01-18 10:21:12,447 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 304 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 10:21:12,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 888 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-18 10:21:12,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-01-18 10:21:12,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2022-01-18 10:21:12,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.6318840579710145) internal successors, (563), 345 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:12,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 563 transitions. [2022-01-18 10:21:12,454 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 563 transitions. Word has length 118 [2022-01-18 10:21:12,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:21:12,454 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 563 transitions. [2022-01-18 10:21:12,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 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) [2022-01-18 10:21:12,454 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 563 transitions. [2022-01-18 10:21:12,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-01-18 10:21:12,455 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:21:12,455 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:21:12,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 10:21:12,456 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 10:21:12,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:21:12,456 INFO L85 PathProgramCache]: Analyzing trace with hash -553527554, now seen corresponding path program 1 times [2022-01-18 10:21:12,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:21:12,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863351133] [2022-01-18 10:21:12,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:12,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:21:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:13,133 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:21:13,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:21:13,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863351133] [2022-01-18 10:21:13,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863351133] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:21:13,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459087790] [2022-01-18 10:21:13,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:13,134 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:21:13,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:21:13,135 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:21:13,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-18 10:21:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:13,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-18 10:21:13,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:21:13,329 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-18 10:21:13,756 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:21:13,756 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:21:13,807 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:21:13,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:21:13,992 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-01-18 10:21:14,044 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-18 10:21:14,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 10:21:14,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459087790] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:21:14,044 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 10:21:14,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 25 [2022-01-18 10:21:14,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501277947] [2022-01-18 10:21:14,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:21:14,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 10:21:14,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:21:14,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 10:21:14,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2022-01-18 10:21:14,046 INFO L87 Difference]: Start difference. First operand 346 states and 563 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:14,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:21:14,131 INFO L93 Difference]: Finished difference Result 342 states and 557 transitions. [2022-01-18 10:21:14,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 10:21:14,131 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-01-18 10:21:14,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:21:14,131 INFO L225 Difference]: With dead ends: 342 [2022-01-18 10:21:14,131 INFO L226 Difference]: Without dead ends: 0 [2022-01-18 10:21:14,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=674, Unknown=0, NotChecked=0, Total=812 [2022-01-18 10:21:14,132 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 111 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:21:14,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 340 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:21:14,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-18 10:21:14,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-18 10:21:14,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:14,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-18 10:21:14,133 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2022-01-18 10:21:14,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:21:14,133 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-18 10:21:14,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:14,134 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-18 10:21:14,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-18 10:21:14,136 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-18 10:21:14,136 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-01-18 10:21:14,136 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-01-18 10:21:14,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-18 10:21:14,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:21:14,357 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2022-01-18 10:21:14,358 INFO L308 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2022-01-18 10:21:14,361 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-18 10:21:14,361 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 10:21:14,362 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-18 10:21:14,364 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 172 places, 200 transitions, 408 flow [2022-01-18 10:21:14,378 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 716 states, 714 states have (on average 2.046218487394958) internal successors, (1461), 715 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 716 states, 714 states have (on average 2.046218487394958) internal successors, (1461), 715 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:14,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-18 10:21:14,379 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:21:14,380 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:21:14,380 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-18 10:21:14,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:21:14,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1921288591, now seen corresponding path program 1 times [2022-01-18 10:21:14,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:21:14,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509609646] [2022-01-18 10:21:14,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:14,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:21:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:21:14,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:21:14,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509609646] [2022-01-18 10:21:14,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509609646] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:21:14,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 10:21:14,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 10:21:14,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938518644] [2022-01-18 10:21:14,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:21:14,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 10:21:14,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:21:14,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 10:21:14,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 10:21:14,396 INFO L87 Difference]: Start difference. First operand has 716 states, 714 states have (on average 2.046218487394958) internal successors, (1461), 715 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:14,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:21:14,399 INFO L93 Difference]: Finished difference Result 705 states and 1306 transitions. [2022-01-18 10:21:14,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 10:21:14,400 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 50 [2022-01-18 10:21:14,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:21:14,402 INFO L225 Difference]: With dead ends: 705 [2022-01-18 10:21:14,402 INFO L226 Difference]: Without dead ends: 704 [2022-01-18 10:21:14,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 10:21:14,403 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:21:14,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:21:14,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-01-18 10:21:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2022-01-18 10:21:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 701 states have (on average 1.861626248216833) internal successors, (1305), 703 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1305 transitions. [2022-01-18 10:21:14,414 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1305 transitions. Word has length 50 [2022-01-18 10:21:14,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:21:14,415 INFO L470 AbstractCegarLoop]: Abstraction has 704 states and 1305 transitions. [2022-01-18 10:21:14,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1305 transitions. [2022-01-18 10:21:14,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-18 10:21:14,415 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:21:14,415 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:21:14,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 10:21:14,415 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-18 10:21:14,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:21:14,416 INFO L85 PathProgramCache]: Analyzing trace with hash -959674574, now seen corresponding path program 1 times [2022-01-18 10:21:14,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:21:14,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724227781] [2022-01-18 10:21:14,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:14,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:21:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:21:14,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:21:14,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724227781] [2022-01-18 10:21:14,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724227781] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:21:14,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 10:21:14,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 10:21:14,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88232652] [2022-01-18 10:21:14,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:21:14,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 10:21:14,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:21:14,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 10:21:14,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 10:21:14,434 INFO L87 Difference]: Start difference. First operand 704 states and 1305 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:21:14,444 INFO L93 Difference]: Finished difference Result 708 states and 1309 transitions. [2022-01-18 10:21:14,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 10:21:14,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 50 [2022-01-18 10:21:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:21:14,447 INFO L225 Difference]: With dead ends: 708 [2022-01-18 10:21:14,447 INFO L226 Difference]: Without dead ends: 708 [2022-01-18 10:21:14,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 10:21:14,447 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 3 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:21:14,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 210 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:21:14,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-01-18 10:21:14,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 705. [2022-01-18 10:21:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 702 states have (on average 1.8603988603988604) internal successors, (1306), 704 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1306 transitions. [2022-01-18 10:21:14,459 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1306 transitions. Word has length 50 [2022-01-18 10:21:14,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:21:14,459 INFO L470 AbstractCegarLoop]: Abstraction has 705 states and 1306 transitions. [2022-01-18 10:21:14,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1306 transitions. [2022-01-18 10:21:14,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-18 10:21:14,460 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:21:14,460 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:21:14,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-18 10:21:14,460 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-18 10:21:14,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:21:14,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1718762197, now seen corresponding path program 1 times [2022-01-18 10:21:14,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:21:14,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301795136] [2022-01-18 10:21:14,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:14,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:21:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:21:14,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:21:14,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301795136] [2022-01-18 10:21:14,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301795136] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:21:14,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236908350] [2022-01-18 10:21:14,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:14,486 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:21:14,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:21:14,487 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:21:14,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-18 10:21:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:14,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-18 10:21:14,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:21:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:21:14,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:21:14,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:21:14,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236908350] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:21:14,722 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:21:14,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-18 10:21:14,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183863448] [2022-01-18 10:21:14,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:21:14,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 10:21:14,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:21:14,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 10:21:14,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-18 10:21:14,726 INFO L87 Difference]: Start difference. First operand 705 states and 1306 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:14,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:21:14,766 INFO L93 Difference]: Finished difference Result 715 states and 1316 transitions. [2022-01-18 10:21:14,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 10:21:14,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-18 10:21:14,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:21:14,769 INFO L225 Difference]: With dead ends: 715 [2022-01-18 10:21:14,769 INFO L226 Difference]: Without dead ends: 715 [2022-01-18 10:21:14,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-01-18 10:21:14,770 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 13 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:21:14,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 418 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:21:14,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-01-18 10:21:14,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2022-01-18 10:21:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 712 states have (on average 1.848314606741573) internal successors, (1316), 714 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:14,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1316 transitions. [2022-01-18 10:21:14,782 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1316 transitions. Word has length 55 [2022-01-18 10:21:14,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:21:14,782 INFO L470 AbstractCegarLoop]: Abstraction has 715 states and 1316 transitions. [2022-01-18 10:21:14,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:14,782 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1316 transitions. [2022-01-18 10:21:14,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-18 10:21:14,784 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:21:14,784 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:21:14,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-18 10:21:14,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:21:14,999 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-18 10:21:15,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:21:15,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2122069387, now seen corresponding path program 2 times [2022-01-18 10:21:15,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:21:15,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481656136] [2022-01-18 10:21:15,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:15,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:21:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:15,068 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:21:15,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:21:15,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481656136] [2022-01-18 10:21:15,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481656136] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:21:15,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745346293] [2022-01-18 10:21:15,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 10:21:15,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:21:15,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:21:15,070 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:21:15,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-18 10:21:15,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 10:21:15,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 10:21:15,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 10:21:15,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:21:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:21:15,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:21:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:21:15,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745346293] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:21:15,412 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:21:15,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-01-18 10:21:15,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068757123] [2022-01-18 10:21:15,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:21:15,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-18 10:21:15,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:21:15,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-18 10:21:15,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-01-18 10:21:15,413 INFO L87 Difference]: Start difference. First operand 715 states and 1316 transitions. Second operand has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:15,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:21:15,574 INFO L93 Difference]: Finished difference Result 735 states and 1336 transitions. [2022-01-18 10:21:15,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-18 10:21:15,575 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 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 [2022-01-18 10:21:15,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:21:15,577 INFO L225 Difference]: With dead ends: 735 [2022-01-18 10:21:15,577 INFO L226 Difference]: Without dead ends: 735 [2022-01-18 10:21:15,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2022-01-18 10:21:15,578 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 33 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:21:15,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 631 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:21:15,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-01-18 10:21:15,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2022-01-18 10:21:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 732 states have (on average 1.825136612021858) internal successors, (1336), 734 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1336 transitions. [2022-01-18 10:21:15,592 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1336 transitions. Word has length 65 [2022-01-18 10:21:15,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:21:15,592 INFO L470 AbstractCegarLoop]: Abstraction has 735 states and 1336 transitions. [2022-01-18 10:21:15,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1336 transitions. [2022-01-18 10:21:15,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-18 10:21:15,593 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:21:15,593 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:21:15,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-18 10:21:15,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:21:15,820 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-18 10:21:15,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:21:15,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1016344139, now seen corresponding path program 3 times [2022-01-18 10:21:15,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:21:15,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763639082] [2022-01-18 10:21:15,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:15,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:21:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:15,976 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:21:15,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:21:15,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763639082] [2022-01-18 10:21:15,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763639082] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:21:15,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389649378] [2022-01-18 10:21:15,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 10:21:15,977 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:21:15,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:21:15,978 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:21:15,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-18 10:21:16,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-01-18 10:21:16,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 10:21:16,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-18 10:21:16,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:21:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:21:16,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:21:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:21:16,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389649378] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:21:16,468 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:21:16,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-18 10:21:16,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643077752] [2022-01-18 10:21:16,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:21:16,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-18 10:21:16,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:21:16,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-18 10:21:16,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-18 10:21:16,469 INFO L87 Difference]: Start difference. First operand 735 states and 1336 transitions. Second operand has 23 states, 23 states have (on average 4.260869565217392) internal successors, (98), 23 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:21:16,725 INFO L93 Difference]: Finished difference Result 750 states and 1351 transitions. [2022-01-18 10:21:16,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-18 10:21:16,725 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.260869565217392) internal successors, (98), 23 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-01-18 10:21:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:21:16,728 INFO L225 Difference]: With dead ends: 750 [2022-01-18 10:21:16,728 INFO L226 Difference]: Without dead ends: 750 [2022-01-18 10:21:16,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-01-18 10:21:16,730 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 44 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 10:21:16,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 632 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 10:21:16,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-01-18 10:21:16,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 750. [2022-01-18 10:21:16,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 747 states have (on average 1.8085676037483267) internal successors, (1351), 749 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1351 transitions. [2022-01-18 10:21:16,743 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1351 transitions. Word has length 85 [2022-01-18 10:21:16,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:21:16,743 INFO L470 AbstractCegarLoop]: Abstraction has 750 states and 1351 transitions. [2022-01-18 10:21:16,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.260869565217392) internal successors, (98), 23 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1351 transitions. [2022-01-18 10:21:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-18 10:21:16,744 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:21:16,745 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:21:16,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-18 10:21:16,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-18 10:21:16,951 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-18 10:21:16,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:21:16,952 INFO L85 PathProgramCache]: Analyzing trace with hash 282089810, now seen corresponding path program 4 times [2022-01-18 10:21:16,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:21:16,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933341765] [2022-01-18 10:21:16,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:16,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:21:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 10:21:16,971 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-18 10:21:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 10:21:17,007 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-18 10:21:17,008 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-18 10:21:17,008 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-18 10:21:17,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-18 10:21:17,008 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2022-01-18 10:21:17,008 INFO L308 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2022-01-18 10:21:17,009 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-01-18 10:21:17,009 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-01-18 10:21:17,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,036 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,036 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,036 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,036 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,036 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,036 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,036 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,036 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,036 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,036 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,036 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,036 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,038 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,038 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,038 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,038 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,038 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,038 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,038 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,038 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,038 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,038 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,038 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,039 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,039 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,039 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,039 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,039 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,039 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,039 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,039 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,039 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,039 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,039 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,045 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,045 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,045 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,045 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,045 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,045 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,045 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,045 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,047 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,047 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,047 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,047 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,047 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,047 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,047 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,047 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,047 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,047 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,047 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,047 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,048 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,048 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,048 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,048 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,048 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,048 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,048 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,048 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,048 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,048 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,048 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,048 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,049 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,049 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,049 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,049 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,049 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,049 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,049 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,049 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,049 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,049 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,049 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,049 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,049 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,049 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,050 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,050 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,050 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,050 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,050 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,050 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,050 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,050 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,050 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,050 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,050 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,050 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,050 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,051 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,051 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,051 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,051 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,051 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,051 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,051 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,051 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,051 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,051 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,051 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,051 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,051 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,055 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,055 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,055 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,055 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,055 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,055 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,055 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,055 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,055 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,055 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,055 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,055 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,055 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,056 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,056 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,056 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,056 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,056 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,056 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,056 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,056 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,056 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,057 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,057 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,057 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,057 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,057 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,057 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,057 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,057 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,057 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,057 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,057 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,057 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,057 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,057 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,057 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,058 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,058 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,058 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,058 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,058 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,058 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,058 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,058 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,058 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,058 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,059 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,059 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,059 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,059 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,059 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,059 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,059 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,059 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,059 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,059 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,059 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,059 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,059 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:21:17,060 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-18 10:21:17,061 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 10:21:17,062 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 10:21:17,062 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-18 10:21:17,064 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 235 places, 275 transitions, 568 flow [2022-01-18 10:21:22,701 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 246626 states, 246607 states have (on average 3.569030887201093) internal successors, (880148), 246625 states have internal predecessors, (880148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 246626 states, 246607 states have (on average 3.569030887201093) internal successors, (880148), 246625 states have internal predecessors, (880148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:23,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-18 10:21:23,059 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:21:23,059 INFO L514 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] [2022-01-18 10:21:23,059 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:21:23,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:21:23,060 INFO L85 PathProgramCache]: Analyzing trace with hash -451559023, now seen corresponding path program 1 times [2022-01-18 10:21:23,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:21:23,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673679169] [2022-01-18 10:21:23,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:23,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:21:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:23,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:21:23,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:21:23,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673679169] [2022-01-18 10:21:23,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673679169] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:21:23,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 10:21:23,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 10:21:23,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544905242] [2022-01-18 10:21:23,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:21:23,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 10:21:23,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:21:23,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 10:21:23,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 10:21:23,427 INFO L87 Difference]: Start difference. First operand has 246626 states, 246607 states have (on average 3.569030887201093) internal successors, (880148), 246625 states have internal predecessors, (880148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:26,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:21:26,144 INFO L93 Difference]: Finished difference Result 235018 states and 700260 transitions. [2022-01-18 10:21:26,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 10:21:26,144 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-01-18 10:21:26,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:21:27,029 INFO L225 Difference]: With dead ends: 235018 [2022-01-18 10:21:27,030 INFO L226 Difference]: Without dead ends: 192260 [2022-01-18 10:21:27,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 10:21:27,030 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:21:27,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:21:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192260 states. [2022-01-18 10:21:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192260 to 192260. [2022-01-18 10:21:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192260 states, 192230 states have (on average 2.9647505592259273) internal successors, (569914), 192259 states have internal predecessors, (569914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:33,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192260 states to 192260 states and 569914 transitions. [2022-01-18 10:21:33,471 INFO L78 Accepts]: Start accepts. Automaton has 192260 states and 569914 transitions. Word has length 50 [2022-01-18 10:21:33,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:21:33,471 INFO L470 AbstractCegarLoop]: Abstraction has 192260 states and 569914 transitions. [2022-01-18 10:21:33,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:33,475 INFO L276 IsEmpty]: Start isEmpty. Operand 192260 states and 569914 transitions. [2022-01-18 10:21:33,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-18 10:21:33,476 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:21:33,476 INFO L514 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] [2022-01-18 10:21:33,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-18 10:21:33,476 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:21:33,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:21:33,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2017606803, now seen corresponding path program 1 times [2022-01-18 10:21:33,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:21:33,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972342204] [2022-01-18 10:21:33,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:33,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:21:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:21:33,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:21:33,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972342204] [2022-01-18 10:21:33,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972342204] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:21:33,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 10:21:33,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 10:21:33,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769308747] [2022-01-18 10:21:33,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:21:33,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 10:21:33,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:21:33,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 10:21:33,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 10:21:33,497 INFO L87 Difference]: Start difference. First operand 192260 states and 569914 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:34,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:21:34,874 INFO L93 Difference]: Finished difference Result 192264 states and 569918 transitions. [2022-01-18 10:21:34,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 10:21:34,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-01-18 10:21:34,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:21:35,403 INFO L225 Difference]: With dead ends: 192264 [2022-01-18 10:21:35,404 INFO L226 Difference]: Without dead ends: 192264 [2022-01-18 10:21:35,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 10:21:35,404 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 3 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:21:35,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 446 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:21:35,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192264 states. [2022-01-18 10:21:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192264 to 192261. [2022-01-18 10:21:40,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192261 states, 192231 states have (on average 2.9647403384469726) internal successors, (569915), 192260 states have internal predecessors, (569915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192261 states to 192261 states and 569915 transitions. [2022-01-18 10:21:41,243 INFO L78 Accepts]: Start accepts. Automaton has 192261 states and 569915 transitions. Word has length 50 [2022-01-18 10:21:41,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:21:41,243 INFO L470 AbstractCegarLoop]: Abstraction has 192261 states and 569915 transitions. [2022-01-18 10:21:41,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:41,243 INFO L276 IsEmpty]: Start isEmpty. Operand 192261 states and 569915 transitions. [2022-01-18 10:21:41,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-18 10:21:41,244 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:21:41,244 INFO L514 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] [2022-01-18 10:21:41,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-18 10:21:41,245 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:21:41,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:21:41,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1078955039, now seen corresponding path program 1 times [2022-01-18 10:21:41,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:21:41,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438361782] [2022-01-18 10:21:41,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:41,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:21:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:21:41,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:21:41,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438361782] [2022-01-18 10:21:41,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438361782] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:21:41,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301433353] [2022-01-18 10:21:41,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:41,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:21:41,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:21:41,320 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:21:41,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-18 10:21:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:41,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-18 10:21:41,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:21:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:21:41,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 10:21:41,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301433353] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:21:41,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 10:21:41,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-01-18 10:21:41,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113845519] [2022-01-18 10:21:41,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:21:41,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 10:21:41,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:21:41,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 10:21:41,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-18 10:21:41,541 INFO L87 Difference]: Start difference. First operand 192261 states and 569915 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:42,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:21:42,328 INFO L93 Difference]: Finished difference Result 192246 states and 569900 transitions. [2022-01-18 10:21:42,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 10:21:42,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-01-18 10:21:42,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:21:43,007 INFO L225 Difference]: With dead ends: 192246 [2022-01-18 10:21:43,007 INFO L226 Difference]: Without dead ends: 192246 [2022-01-18 10:21:43,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-18 10:21:43,008 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 68 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:21:43,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 446 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:21:43,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192246 states. [2022-01-18 10:21:47,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192246 to 192246. [2022-01-18 10:21:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192246 states, 192217 states have (on average 2.9648782365763693) internal successors, (569900), 192245 states have internal predecessors, (569900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192246 states to 192246 states and 569900 transitions. [2022-01-18 10:21:48,746 INFO L78 Accepts]: Start accepts. Automaton has 192246 states and 569900 transitions. Word has length 55 [2022-01-18 10:21:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:21:48,746 INFO L470 AbstractCegarLoop]: Abstraction has 192246 states and 569900 transitions. [2022-01-18 10:21:48,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 192246 states and 569900 transitions. [2022-01-18 10:21:48,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-18 10:21:48,748 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:21:48,751 INFO L514 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] [2022-01-18 10:21:48,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-18 10:21:48,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-18 10:21:48,959 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:21:48,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:21:48,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1428162091, now seen corresponding path program 1 times [2022-01-18 10:21:48,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:21:48,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830109599] [2022-01-18 10:21:48,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:48,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:21:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:49,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:21:49,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:21:49,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830109599] [2022-01-18 10:21:49,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830109599] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:21:49,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632920010] [2022-01-18 10:21:49,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:49,003 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:21:49,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:21:49,004 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:21:49,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-18 10:21:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:49,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-18 10:21:49,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:21:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:21:49,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:21:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:21:49,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632920010] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:21:49,288 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:21:49,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-18 10:21:49,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841858785] [2022-01-18 10:21:49,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:21:49,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 10:21:49,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:21:49,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 10:21:49,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-18 10:21:49,290 INFO L87 Difference]: Start difference. First operand 192246 states and 569900 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:50,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:21:50,911 INFO L93 Difference]: Finished difference Result 192256 states and 569910 transitions. [2022-01-18 10:21:50,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 10:21:50,911 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-01-18 10:21:50,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:21:51,495 INFO L225 Difference]: With dead ends: 192256 [2022-01-18 10:21:51,495 INFO L226 Difference]: Without dead ends: 192256 [2022-01-18 10:21:51,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-01-18 10:21:51,496 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 10 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:21:51,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1553 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:21:51,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192256 states. [2022-01-18 10:21:55,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192256 to 192256. [2022-01-18 10:21:56,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192256 states, 192227 states have (on average 2.9647760200179993) internal successors, (569910), 192255 states have internal predecessors, (569910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:56,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192256 states to 192256 states and 569910 transitions. [2022-01-18 10:21:56,982 INFO L78 Accepts]: Start accepts. Automaton has 192256 states and 569910 transitions. Word has length 65 [2022-01-18 10:21:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:21:56,982 INFO L470 AbstractCegarLoop]: Abstraction has 192256 states and 569910 transitions. [2022-01-18 10:21:56,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 192256 states and 569910 transitions. [2022-01-18 10:21:56,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-18 10:21:56,985 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:21:56,985 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:21:57,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-18 10:21:57,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-18 10:21:57,191 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:21:57,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:21:57,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2019148117, now seen corresponding path program 2 times [2022-01-18 10:21:57,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:21:57,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417333424] [2022-01-18 10:21:57,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:57,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:21:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-18 10:21:57,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:21:57,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417333424] [2022-01-18 10:21:57,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417333424] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:21:57,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590140585] [2022-01-18 10:21:57,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 10:21:57,229 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:21:57,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:21:57,230 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:21:57,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-18 10:21:57,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 10:21:57,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 10:21:57,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 10:21:57,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:21:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:21:57,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:21:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:21:57,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590140585] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:21:57,627 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:21:57,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-01-18 10:21:57,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753367259] [2022-01-18 10:21:57,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:21:57,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-18 10:21:57,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:21:57,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-18 10:21:57,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-01-18 10:21:57,628 INFO L87 Difference]: Start difference. First operand 192256 states and 569910 transitions. Second operand has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 19 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:21:59,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:21:59,428 INFO L93 Difference]: Finished difference Result 190564 states and 566476 transitions. [2022-01-18 10:21:59,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-18 10:21:59,429 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 19 states have internal predecessors, (121), 0 states have call successors, (0), 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 75 [2022-01-18 10:21:59,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:21:59,972 INFO L225 Difference]: With dead ends: 190564 [2022-01-18 10:21:59,973 INFO L226 Difference]: Without dead ends: 190564 [2022-01-18 10:21:59,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=780, Unknown=0, NotChecked=0, Total=1056 [2022-01-18 10:21:59,974 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 477 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 2229 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 10:21:59,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [477 Valid, 2229 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 10:22:00,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190564 states. [2022-01-18 10:22:03,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190564 to 190564. [2022-01-18 10:22:04,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190564 states, 190538 states have (on average 2.9730342503857496) internal successors, (566476), 190563 states have internal predecessors, (566476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:22:05,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190564 states to 190564 states and 566476 transitions. [2022-01-18 10:22:05,429 INFO L78 Accepts]: Start accepts. Automaton has 190564 states and 566476 transitions. Word has length 75 [2022-01-18 10:22:05,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:22:05,429 INFO L470 AbstractCegarLoop]: Abstraction has 190564 states and 566476 transitions. [2022-01-18 10:22:05,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 19 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:22:05,429 INFO L276 IsEmpty]: Start isEmpty. Operand 190564 states and 566476 transitions. [2022-01-18 10:22:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-18 10:22:05,435 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:22:05,435 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:22:05,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-18 10:22:05,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:22:05,656 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:22:05,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:22:05,656 INFO L85 PathProgramCache]: Analyzing trace with hash 44072195, now seen corresponding path program 1 times [2022-01-18 10:22:05,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:22:05,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697898455] [2022-01-18 10:22:05,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:22:05,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:22:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:22:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:22:05,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:22:05,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697898455] [2022-01-18 10:22:05,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697898455] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:22:05,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14987400] [2022-01-18 10:22:05,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:22:05,810 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:22:05,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:22:05,811 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:22:05,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-18 10:22:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:22:05,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-18 10:22:05,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:22:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:22:06,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:22:06,262 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:22:06,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14987400] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:22:06,263 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:22:06,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-18 10:22:06,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312716905] [2022-01-18 10:22:06,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:22:06,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-18 10:22:06,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:22:06,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-18 10:22:06,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-18 10:22:06,265 INFO L87 Difference]: Start difference. First operand 190564 states and 566476 transitions. Second operand has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 23 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:22:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:22:07,979 INFO L93 Difference]: Finished difference Result 190579 states and 566491 transitions. [2022-01-18 10:22:07,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-18 10:22:07,980 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 23 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-01-18 10:22:07,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:22:08,521 INFO L225 Difference]: With dead ends: 190579 [2022-01-18 10:22:08,521 INFO L226 Difference]: Without dead ends: 190579 [2022-01-18 10:22:08,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-01-18 10:22:08,522 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 38 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 2225 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 10:22:08,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 2225 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 10:22:08,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190579 states. [2022-01-18 10:22:12,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190579 to 190579. [2022-01-18 10:22:12,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190579 states, 190553 states have (on average 2.9728789365688284) internal successors, (566491), 190578 states have internal predecessors, (566491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:22:13,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190579 states to 190579 states and 566491 transitions. [2022-01-18 10:22:13,816 INFO L78 Accepts]: Start accepts. Automaton has 190579 states and 566491 transitions. Word has length 103 [2022-01-18 10:22:13,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:22:13,816 INFO L470 AbstractCegarLoop]: Abstraction has 190579 states and 566491 transitions. [2022-01-18 10:22:13,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 23 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:22:13,816 INFO L276 IsEmpty]: Start isEmpty. Operand 190579 states and 566491 transitions. [2022-01-18 10:22:13,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-18 10:22:13,822 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:22:13,822 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:22:13,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-01-18 10:22:14,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:22:14,045 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:22:14,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:22:14,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1321944183, now seen corresponding path program 2 times [2022-01-18 10:22:14,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:22:14,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588942313] [2022-01-18 10:22:14,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:22:14,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:22:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:22:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:22:14,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:22:14,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588942313] [2022-01-18 10:22:14,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588942313] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:22:14,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 10:22:14,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-18 10:22:14,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733783788] [2022-01-18 10:22:14,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:22:14,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-18 10:22:14,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:22:14,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-18 10:22:14,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-01-18 10:22:14,327 INFO L87 Difference]: Start difference. First operand 190579 states and 566491 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 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) [2022-01-18 10:22:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:22:17,379 INFO L93 Difference]: Finished difference Result 245805 states and 723805 transitions. [2022-01-18 10:22:17,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-18 10:22:17,379 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 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 118 [2022-01-18 10:22:17,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:22:18,153 INFO L225 Difference]: With dead ends: 245805 [2022-01-18 10:22:18,153 INFO L226 Difference]: Without dead ends: 239070 [2022-01-18 10:22:18,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2022-01-18 10:22:18,154 INFO L933 BasicCegarLoop]: 573 mSDtfsCounter, 1253 mSDsluCounter, 4781 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 5275 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-18 10:22:18,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1253 Valid, 5275 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-18 10:22:18,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239070 states. [2022-01-18 10:22:23,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239070 to 203101. [2022-01-18 10:22:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203101 states, 203075 states have (on average 2.9727933029668843) internal successors, (603700), 203100 states have internal predecessors, (603700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:22:24,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203101 states to 203101 states and 603700 transitions. [2022-01-18 10:22:24,145 INFO L78 Accepts]: Start accepts. Automaton has 203101 states and 603700 transitions. Word has length 118 [2022-01-18 10:22:24,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:22:24,145 INFO L470 AbstractCegarLoop]: Abstraction has 203101 states and 603700 transitions. [2022-01-18 10:22:24,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 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) [2022-01-18 10:22:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand 203101 states and 603700 transitions. [2022-01-18 10:22:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-18 10:22:24,154 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:22:24,154 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:22:24,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-18 10:22:24,155 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:22:24,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:22:24,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1385235796, now seen corresponding path program 1 times [2022-01-18 10:22:24,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:22:24,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129249771] [2022-01-18 10:22:24,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:22:24,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:22:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:22:24,200 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:22:24,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:22:24,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129249771] [2022-01-18 10:22:24,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129249771] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:22:24,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117689717] [2022-01-18 10:22:24,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:22:24,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:22:24,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:22:24,204 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:22:24,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-18 10:22:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:22:24,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 10:22:24,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:22:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:22:24,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:22:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:22:24,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117689717] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:22:24,621 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:22:24,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-01-18 10:22:24,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389914462] [2022-01-18 10:22:24,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:22:24,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-18 10:22:24,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:22:24,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-18 10:22:24,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-01-18 10:22:24,622 INFO L87 Difference]: Start difference. First operand 203101 states and 603700 transitions. Second operand has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:22:25,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:22:25,640 INFO L93 Difference]: Finished difference Result 37997 states and 108990 transitions. [2022-01-18 10:22:25,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 10:22:25,641 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 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 120 [2022-01-18 10:22:25,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:22:25,717 INFO L225 Difference]: With dead ends: 37997 [2022-01-18 10:22:25,717 INFO L226 Difference]: Without dead ends: 31301 [2022-01-18 10:22:25,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2022-01-18 10:22:25,718 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 1334 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:22:25,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1334 Valid, 1468 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:22:25,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31301 states. [2022-01-18 10:22:26,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31301 to 31301. [2022-01-18 10:22:26,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31301 states, 31296 states have (on average 2.8634969325153374) internal successors, (89616), 31300 states have internal predecessors, (89616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:22:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31301 states to 31301 states and 89616 transitions. [2022-01-18 10:22:26,257 INFO L78 Accepts]: Start accepts. Automaton has 31301 states and 89616 transitions. Word has length 120 [2022-01-18 10:22:26,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:22:26,257 INFO L470 AbstractCegarLoop]: Abstraction has 31301 states and 89616 transitions. [2022-01-18 10:22:26,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:22:26,258 INFO L276 IsEmpty]: Start isEmpty. Operand 31301 states and 89616 transitions. [2022-01-18 10:22:26,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-01-18 10:22:26,267 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:22:26,267 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:22:26,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-18 10:22:26,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-01-18 10:22:26,476 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:22:26,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:22:26,476 INFO L85 PathProgramCache]: Analyzing trace with hash 919551082, now seen corresponding path program 1 times [2022-01-18 10:22:26,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:22:26,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075363623] [2022-01-18 10:22:26,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:22:26,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:22:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:22:27,177 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:22:27,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:22:27,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075363623] [2022-01-18 10:22:27,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075363623] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:22:27,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410130226] [2022-01-18 10:22:27,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:22:27,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:22:27,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:22:27,180 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:22:27,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-18 10:22:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:22:27,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-18 10:22:27,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:22:27,326 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-18 10:22:27,738 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:22:27,739 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:22:27,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:22:27,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:22:27,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-01-18 10:22:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-18 10:22:28,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 10:22:28,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410130226] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:22:28,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 10:22:28,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 26 [2022-01-18 10:22:28,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125065352] [2022-01-18 10:22:28,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:22:28,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 10:22:28,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:22:28,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 10:22:28,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2022-01-18 10:22:28,014 INFO L87 Difference]: Start difference. First operand 31301 states and 89616 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:22:28,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:22:28,757 INFO L93 Difference]: Finished difference Result 34572 states and 98066 transitions. [2022-01-18 10:22:28,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 10:22:28,758 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-01-18 10:22:28,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:22:28,808 INFO L225 Difference]: With dead ends: 34572 [2022-01-18 10:22:28,808 INFO L226 Difference]: Without dead ends: 30172 [2022-01-18 10:22:28,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2022-01-18 10:22:28,809 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 692 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 10:22:28,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [692 Valid, 1570 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-18 10:22:28,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30172 states. [2022-01-18 10:22:29,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30172 to 26927. [2022-01-18 10:22:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26927 states, 26924 states have (on average 2.8463081265785175) internal successors, (76634), 26926 states have internal predecessors, (76634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:22:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26927 states to 26927 states and 76634 transitions. [2022-01-18 10:22:29,257 INFO L78 Accepts]: Start accepts. Automaton has 26927 states and 76634 transitions. Word has length 127 [2022-01-18 10:22:29,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:22:29,257 INFO L470 AbstractCegarLoop]: Abstraction has 26927 states and 76634 transitions. [2022-01-18 10:22:29,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:22:29,258 INFO L276 IsEmpty]: Start isEmpty. Operand 26927 states and 76634 transitions. [2022-01-18 10:22:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-01-18 10:22:29,264 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:22:29,264 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:22:29,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-18 10:22:29,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:22:29,465 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:22:29,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:22:29,466 INFO L85 PathProgramCache]: Analyzing trace with hash -278495548, now seen corresponding path program 1 times [2022-01-18 10:22:29,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:22:29,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703471405] [2022-01-18 10:22:29,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:22:29,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:22:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:22:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:22:30,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:22:30,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703471405] [2022-01-18 10:22:30,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703471405] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:22:30,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274865725] [2022-01-18 10:22:30,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:22:30,055 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:22:30,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:22:30,056 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:22:30,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-18 10:22:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:22:30,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-18 10:22:30,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:22:30,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-18 10:22:30,574 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:22:30,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:22:30,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:22:30,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:22:30,761 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-01-18 10:22:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-18 10:22:30,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:22:30,940 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_702) |c_~#a~0.base|) (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|)) 0)) is different from false [2022-01-18 10:22:31,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-01-18 10:22:31,900 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-18 10:22:31,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-18 10:22:31,927 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 1 not checked. [2022-01-18 10:22:31,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274865725] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:22:31,927 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:22:31,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 29 [2022-01-18 10:22:31,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228341555] [2022-01-18 10:22:31,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:22:31,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 10:22:31,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:22:31,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 10:22:31,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=644, Unknown=1, NotChecked=52, Total=812 [2022-01-18 10:22:31,932 INFO L87 Difference]: Start difference. First operand 26927 states and 76634 transitions. Second operand has 29 states, 29 states have (on average 7.0344827586206895) internal successors, (204), 29 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:22:32,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:22:32,998 INFO L93 Difference]: Finished difference Result 29171 states and 82237 transitions. [2022-01-18 10:22:32,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 10:22:32,998 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.0344827586206895) internal successors, (204), 29 states have internal predecessors, (204), 0 states have call successors, (0), 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 128 [2022-01-18 10:22:32,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:22:33,041 INFO L225 Difference]: With dead ends: 29171 [2022-01-18 10:22:33,042 INFO L226 Difference]: Without dead ends: 21750 [2022-01-18 10:22:33,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 250 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=322, Invalid=1163, Unknown=1, NotChecked=74, Total=1560 [2022-01-18 10:22:33,043 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 1438 mSDsluCounter, 3583 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 3899 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 295 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-18 10:22:33,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1438 Valid, 3899 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 656 Invalid, 0 Unknown, 295 Unchecked, 0.6s Time] [2022-01-18 10:22:33,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21750 states. [2022-01-18 10:22:33,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21750 to 21228. [2022-01-18 10:22:33,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21228 states, 21226 states have (on average 2.823282766418543) internal successors, (59927), 21227 states have internal predecessors, (59927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:22:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21228 states to 21228 states and 59927 transitions. [2022-01-18 10:22:33,408 INFO L78 Accepts]: Start accepts. Automaton has 21228 states and 59927 transitions. Word has length 128 [2022-01-18 10:22:33,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:22:33,408 INFO L470 AbstractCegarLoop]: Abstraction has 21228 states and 59927 transitions. [2022-01-18 10:22:33,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.0344827586206895) internal successors, (204), 29 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:22:33,409 INFO L276 IsEmpty]: Start isEmpty. Operand 21228 states and 59927 transitions. [2022-01-18 10:22:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-01-18 10:22:33,432 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:22:33,432 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:22:33,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-18 10:22:33,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:22:33,635 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:22:33,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:22:33,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1377157963, now seen corresponding path program 1 times [2022-01-18 10:22:33,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:22:33,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489597246] [2022-01-18 10:22:33,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:22:33,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:22:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:22:33,739 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-01-18 10:22:33,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:22:33,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489597246] [2022-01-18 10:22:33,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489597246] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:22:33,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 10:22:33,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 10:22:33,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030540238] [2022-01-18 10:22:33,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:22:33,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 10:22:33,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:22:33,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 10:22:33,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-18 10:22:33,741 INFO L87 Difference]: Start difference. First operand 21228 states and 59927 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:22:33,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:22:33,904 INFO L93 Difference]: Finished difference Result 21272 states and 59263 transitions. [2022-01-18 10:22:33,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-18 10:22:33,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2022-01-18 10:22:33,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:22:33,934 INFO L225 Difference]: With dead ends: 21272 [2022-01-18 10:22:33,934 INFO L226 Difference]: Without dead ends: 20108 [2022-01-18 10:22:33,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-01-18 10:22:33,934 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 485 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 10:22:33,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 435 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 10:22:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20108 states. [2022-01-18 10:22:34,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20108 to 18128. [2022-01-18 10:22:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18128 states, 18124 states have (on average 2.798995806665195) internal successors, (50729), 18127 states have internal predecessors, (50729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:22:34,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18128 states to 18128 states and 50729 transitions. [2022-01-18 10:22:34,221 INFO L78 Accepts]: Start accepts. Automaton has 18128 states and 50729 transitions. Word has length 153 [2022-01-18 10:22:34,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:22:34,222 INFO L470 AbstractCegarLoop]: Abstraction has 18128 states and 50729 transitions. [2022-01-18 10:22:34,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:22:34,222 INFO L276 IsEmpty]: Start isEmpty. Operand 18128 states and 50729 transitions. [2022-01-18 10:22:34,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-01-18 10:22:34,244 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:22:34,245 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:22:34,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-18 10:22:34,245 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:22:34,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:22:34,245 INFO L85 PathProgramCache]: Analyzing trace with hash 799567723, now seen corresponding path program 1 times [2022-01-18 10:22:34,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:22:34,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96026723] [2022-01-18 10:22:34,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:22:34,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:22:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:22:35,085 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-18 10:22:35,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:22:35,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96026723] [2022-01-18 10:22:35,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96026723] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:22:35,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956687517] [2022-01-18 10:22:35,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:22:35,086 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:22:35,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:22:35,087 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:22:35,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-18 10:22:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:22:35,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-18 10:22:35,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:22:35,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-18 10:22:35,756 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:22:35,756 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:22:35,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:22:35,922 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:22:36,050 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-18 10:22:36,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 10:22:36,240 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-18 10:22:36,410 INFO L353 Elim1Store]: treesize reduction 8, result has 55.6 percent of original size [2022-01-18 10:22:36,411 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2022-01-18 10:22:36,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-01-18 10:22:53,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2022-01-18 10:22:53,178 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-18 10:22:53,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:22:53,618 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_825 Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_823) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) v_ArrVal_825) (+ |c_~#a~0.offset| .cse0 28)) 0)))) is different from false [2022-01-18 10:22:53,699 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_825 Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread2of2ForFork0_#t~post33#1| 28) |c_~#a~0.offset| 28) v_ArrVal_825) (+ |c_~#a~0.offset| .cse0 28)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_823) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0))))) is different from false [2022-01-18 10:22:53,718 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_823 (Array Int Int)) (v_ArrVal_825 Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28) v_ArrVal_825) (+ |c_~#a~0.offset| .cse0 28)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_823) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0))))) is different from false [2022-01-18 10:22:53,745 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 10:22:53,745 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-18 10:22:53,756 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 10:22:53,756 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 48 [2022-01-18 10:22:53,762 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-01-18 10:22:54,332 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_825 Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28) v_ArrVal_825) (+ |c_~#a~0.offset| .cse0 28)) 0) (and (= |c_~#a~0.base| |c_t_funThread2of2ForFork0_~p~0#1.base|) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (= |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ |c_~#a~0.offset| .cse0)))))) is different from false [2022-01-18 10:22:55,579 WARN L838 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (v_ArrVal_825 Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse1 (* 28 |t_funThread2of2ForFork0_~i~0#1|)) (.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (and (= (+ .cse0 |~#a~0.offset|) (+ .cse1 |~#a~0.offset|)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ .cse1 28 |~#a~0.offset|) v_ArrVal_825) (+ .cse0 28 |~#a~0.offset|)) 0)))) is different from false [2022-01-18 10:22:55,877 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_820 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (v_ArrVal_825 Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse1 (* 28 |t_funThread2of2ForFork0_~i~0#1|)) (.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (and (= (+ .cse0 |~#a~0.offset|) (+ .cse1 |~#a~0.offset|)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_820) |c_~#a~0.base|) (+ .cse1 28 |~#a~0.offset|) v_ArrVal_825) (+ .cse0 28 |~#a~0.offset|)) 0)))) is different from false [2022-01-18 10:23:06,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2022-01-18 10:23:06,766 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-18 10:23:06,767 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-18 10:23:06,834 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 1 not checked. [2022-01-18 10:23:06,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956687517] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:23:06,834 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:23:06,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 55 [2022-01-18 10:23:06,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706196925] [2022-01-18 10:23:06,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:23:06,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-01-18 10:23:06,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:23:06,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-01-18 10:23:06,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=2087, Unknown=14, NotChecked=594, Total=2970 [2022-01-18 10:23:06,836 INFO L87 Difference]: Start difference. First operand 18128 states and 50729 transitions. Second operand has 55 states, 55 states have (on average 5.418181818181818) internal successors, (298), 55 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:23:17,726 WARN L228 SmtUtils]: Spent 8.37s on a formula simplification. DAG size of input: 55 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:23:26,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:23:26,635 INFO L93 Difference]: Finished difference Result 20410 states and 57020 transitions. [2022-01-18 10:23:26,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-18 10:23:26,636 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 5.418181818181818) internal successors, (298), 55 states have internal predecessors, (298), 0 states have call successors, (0), 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 156 [2022-01-18 10:23:26,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:23:26,675 INFO L225 Difference]: With dead ends: 20410 [2022-01-18 10:23:26,675 INFO L226 Difference]: Without dead ends: 20284 [2022-01-18 10:23:26,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 281 SyntacticMatches, 11 SemanticMatches, 76 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=913, Invalid=4201, Unknown=22, NotChecked=870, Total=6006 [2022-01-18 10:23:26,677 INFO L933 BasicCegarLoop]: 353 mSDtfsCounter, 2155 mSDsluCounter, 6376 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2155 SdHoareTripleChecker+Valid, 6711 SdHoareTripleChecker+Invalid, 4626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3372 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-18 10:23:26,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2155 Valid, 6711 Invalid, 4626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1142 Invalid, 0 Unknown, 3372 Unchecked, 0.8s Time] [2022-01-18 10:23:26,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20284 states. [2022-01-18 10:23:26,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20284 to 19429. [2022-01-18 10:23:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19429 states, 19425 states have (on average 2.802779922779923) internal successors, (54444), 19428 states have internal predecessors, (54444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:23:27,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19429 states to 19429 states and 54444 transitions. [2022-01-18 10:23:27,005 INFO L78 Accepts]: Start accepts. Automaton has 19429 states and 54444 transitions. Word has length 156 [2022-01-18 10:23:27,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:23:27,005 INFO L470 AbstractCegarLoop]: Abstraction has 19429 states and 54444 transitions. [2022-01-18 10:23:27,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 5.418181818181818) internal successors, (298), 55 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:23:27,006 INFO L276 IsEmpty]: Start isEmpty. Operand 19429 states and 54444 transitions. [2022-01-18 10:23:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-01-18 10:23:27,029 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:23:27,029 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:23:27,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-01-18 10:23:27,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-18 10:23:27,230 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:23:27,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:23:27,230 INFO L85 PathProgramCache]: Analyzing trace with hash -506493501, now seen corresponding path program 2 times [2022-01-18 10:23:27,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:23:27,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112714080] [2022-01-18 10:23:27,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:23:27,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:23:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:23:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-18 10:23:28,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:23:28,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112714080] [2022-01-18 10:23:28,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112714080] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:23:28,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669401788] [2022-01-18 10:23:28,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 10:23:28,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:23:28,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:23:28,248 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:23:28,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-18 10:23:28,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 10:23:28,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 10:23:28,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-18 10:23:28,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:23:28,490 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-18 10:23:29,114 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:23:29,114 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:23:29,179 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:23:29,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:23:29,444 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-18 10:23:29,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 10:23:29,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-18 10:23:29,788 INFO L353 Elim1Store]: treesize reduction 8, result has 55.6 percent of original size [2022-01-18 10:23:29,789 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2022-01-18 10:23:29,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-01-18 10:23:58,107 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2022-01-18 10:23:58,225 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-18 10:23:58,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:23:58,726 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_911 Int) (|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_909 (Array Int Int))) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) v_ArrVal_911) (+ |c_~#a~0.offset| .cse0 28)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_909) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0))))) is different from false [2022-01-18 10:23:58,816 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_911 Int) (v_ArrVal_909 (Array Int Int))) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread2of2ForFork0_#t~post33#1| 28) |c_~#a~0.offset| 28) v_ArrVal_911) (+ |c_~#a~0.offset| .cse0 28)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_909) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0))))) is different from false [2022-01-18 10:23:58,834 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_911 Int) (|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_909 (Array Int Int))) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28) v_ArrVal_911) (+ |c_~#a~0.offset| .cse0 28)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_909) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0))))) is different from false [2022-01-18 10:23:58,860 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 10:23:58,861 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-18 10:23:58,873 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 10:23:58,873 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 48 [2022-01-18 10:23:58,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-01-18 10:23:59,520 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_911 Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28) v_ArrVal_911) (+ |c_~#a~0.offset| .cse0 28)) 0) (and (= |c_~#a~0.base| |c_t_funThread2of2ForFork0_~p~0#1.base|) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (= |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ |c_~#a~0.offset| .cse0)))))) is different from false [2022-01-18 10:24:00,811 WARN L838 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (v_ArrVal_911 Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse1 (* 28 |t_funThread2of2ForFork0_~i~0#1|)) (.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (and (= (+ .cse0 |~#a~0.offset|) (+ .cse1 |~#a~0.offset|)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ .cse1 28 |~#a~0.offset|) v_ArrVal_911) (+ .cse0 28 |~#a~0.offset|)) 0)))) is different from false [2022-01-18 10:24:01,060 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (v_ArrVal_911 Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse1 (* 28 |t_funThread2of2ForFork0_~i~0#1|)) (.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (and (= (+ .cse0 |~#a~0.offset|) (+ .cse1 |~#a~0.offset|)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_906) |c_~#a~0.base|) (+ .cse1 28 |~#a~0.offset|) v_ArrVal_911) (+ .cse0 28 |~#a~0.offset|)) 0)))) is different from false [2022-01-18 10:24:12,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2022-01-18 10:24:12,907 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-18 10:24:12,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-18 10:24:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 1 not checked. [2022-01-18 10:24:13,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669401788] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:24:13,581 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:24:13,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 21] total 57 [2022-01-18 10:24:13,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739771319] [2022-01-18 10:24:13,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:24:13,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-01-18 10:24:13,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:24:13,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-01-18 10:24:13,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=2204, Unknown=26, NotChecked=618, Total=3192 [2022-01-18 10:24:13,583 INFO L87 Difference]: Start difference. First operand 19429 states and 54444 transitions. Second operand has 57 states, 57 states have (on average 5.228070175438597) internal successors, (298), 57 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:24:29,359 WARN L228 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 64 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:24:34,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:24:34,445 INFO L93 Difference]: Finished difference Result 22455 states and 62601 transitions. [2022-01-18 10:24:34,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-18 10:24:34,446 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 5.228070175438597) internal successors, (298), 57 states have internal predecessors, (298), 0 states have call successors, (0), 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 156 [2022-01-18 10:24:34,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:24:34,480 INFO L225 Difference]: With dead ends: 22455 [2022-01-18 10:24:34,480 INFO L226 Difference]: Without dead ends: 22337 [2022-01-18 10:24:34,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 291 SyntacticMatches, 26 SemanticMatches, 89 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2433 ImplicationChecksByTransitivity, 51.3s TimeCoverageRelationStatistics Valid=1353, Invalid=5785, Unknown=26, NotChecked=1026, Total=8190 [2022-01-18 10:24:34,482 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 2164 mSDsluCounter, 8103 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2164 SdHoareTripleChecker+Valid, 8482 SdHoareTripleChecker+Invalid, 5354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3499 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-18 10:24:34,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2164 Valid, 8482 Invalid, 5354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1739 Invalid, 0 Unknown, 3499 Unchecked, 1.1s Time] [2022-01-18 10:24:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22337 states. [2022-01-18 10:24:34,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22337 to 20096. [2022-01-18 10:24:34,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20096 states, 20092 states have (on average 2.7993231136770853) internal successors, (56244), 20095 states have internal predecessors, (56244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:24:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20096 states to 20096 states and 56244 transitions. [2022-01-18 10:24:34,830 INFO L78 Accepts]: Start accepts. Automaton has 20096 states and 56244 transitions. Word has length 156 [2022-01-18 10:24:34,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:24:34,830 INFO L470 AbstractCegarLoop]: Abstraction has 20096 states and 56244 transitions. [2022-01-18 10:24:34,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 5.228070175438597) internal successors, (298), 57 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:24:34,830 INFO L276 IsEmpty]: Start isEmpty. Operand 20096 states and 56244 transitions. [2022-01-18 10:24:34,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-01-18 10:24:34,852 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:24:34,853 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:24:34,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-01-18 10:24:35,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-18 10:24:35,053 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:24:35,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:24:35,054 INFO L85 PathProgramCache]: Analyzing trace with hash -85959427, now seen corresponding path program 3 times [2022-01-18 10:24:35,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:24:35,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903939524] [2022-01-18 10:24:35,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:24:35,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:24:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:26:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 237 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 10:26:41,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:26:41,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903939524] [2022-01-18 10:26:41,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903939524] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:26:41,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415967141] [2022-01-18 10:26:41,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 10:26:41,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:26:41,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:26:41,283 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:26:41,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-01-18 10:26:41,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 10:26:41,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 10:26:41,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-18 10:26:41,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:26:41,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-18 10:26:42,450 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:26:42,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:26:42,594 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:26:42,698 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:26:43,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-18 10:26:43,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 10:26:43,446 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-18 10:26:43,804 INFO L353 Elim1Store]: treesize reduction 8, result has 55.6 percent of original size [2022-01-18 10:26:43,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2022-01-18 10:26:44,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-01-18 10:27:10,345 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2022-01-18 10:27:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-18 10:27:10,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:27:11,855 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_995 (Array Int Int)) (v_ArrVal_996 Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_995) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) v_ArrVal_996) (+ |c_~#a~0.offset| .cse0 28)) 0)))) is different from false [2022-01-18 10:27:11,948 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_995 (Array Int Int)) (v_ArrVal_996 Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_995) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread2of2ForFork0_#t~post33#1| 28) |c_~#a~0.offset| 28) v_ArrVal_996) (+ |c_~#a~0.offset| .cse0 28)) 0)))) is different from false [2022-01-18 10:27:11,965 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_995 (Array Int Int)) (v_ArrVal_996 Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28) v_ArrVal_996) (+ |c_~#a~0.offset| .cse0 28)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_995) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0))))) is different from false [2022-01-18 10:27:11,988 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 10:27:11,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-18 10:27:11,999 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 10:27:11,999 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 48 [2022-01-18 10:27:12,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-01-18 10:27:12,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_996 Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28) v_ArrVal_996) (+ |c_~#a~0.offset| .cse0 28)) 0) (and (= |c_~#a~0.base| |c_t_funThread2of2ForFork0_~p~0#1.base|) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (= |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ |c_~#a~0.offset| .cse0)))))) is different from false [2022-01-18 10:27:14,051 WARN L838 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_996 Int)) (let ((.cse1 (* 28 |t_funThread2of2ForFork0_~i~0#1|)) (.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (and (= (+ .cse0 |~#a~0.offset|) (+ .cse1 |~#a~0.offset|)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ .cse1 28 |~#a~0.offset|) v_ArrVal_996) (+ .cse0 28 |~#a~0.offset|)) 0)))) is different from false [2022-01-18 10:27:14,291 WARN L838 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_992 (Array Int Int)) (v_ArrVal_996 Int)) (let ((.cse1 (* 28 |t_funThread2of2ForFork0_~i~0#1|)) (.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (and (= (+ .cse0 |~#a~0.offset|) (+ .cse1 |~#a~0.offset|)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_992) |c_~#a~0.base|) (+ .cse1 28 |~#a~0.offset|) v_ArrVal_996) (+ .cse0 28 |~#a~0.offset|)) 0)))) is different from false [2022-01-18 10:27:28,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2022-01-18 10:27:29,189 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-18 10:27:29,189 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-18 10:27:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 1 not checked. [2022-01-18 10:27:31,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415967141] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:27:31,966 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:27:31,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 21, 21] total 80 [2022-01-18 10:27:31,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888596601] [2022-01-18 10:27:31,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:27:31,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-01-18 10:27:31,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:27:31,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-01-18 10:27:31,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=4827, Unknown=24, NotChecked=894, Total=6320 [2022-01-18 10:27:31,969 INFO L87 Difference]: Start difference. First operand 20096 states and 56244 transitions. Second operand has 80 states, 80 states have (on average 4.325) internal successors, (346), 80 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:27:55,223 WARN L228 SmtUtils]: Spent 14.82s on a formula simplification. DAG size of input: 51 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:28:09,899 WARN L228 SmtUtils]: Spent 14.61s on a formula simplification. DAG size of input: 53 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:28:19,390 WARN L228 SmtUtils]: Spent 9.44s on a formula simplification. DAG size of input: 47 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:28:31,179 WARN L228 SmtUtils]: Spent 11.73s on a formula simplification. DAG size of input: 62 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:28:42,909 WARN L228 SmtUtils]: Spent 11.53s on a formula simplification. DAG size of input: 47 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:28:53,771 WARN L228 SmtUtils]: Spent 10.80s on a formula simplification. DAG size of input: 48 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:28:54,913 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (<= |c_ULTIMATE.start_main_~i~3#1| 1) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (not (= |c_~#a~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (exists ((|t_funThread2of2ForFork0_~i~0#1| Int) (v_ArrVal_996 Int)) (let ((.cse0 (* 28 |t_funThread2of2ForFork0_~i~0#1|))) (and (= (store ((as const (Array Int Int)) 0) (+ |c_~#a~0.offset| .cse0) v_ArrVal_996) (select |c_#memory_int| |c_~#a~0.base|)) (not (= (* |c_t_funThread1of2ForFork0_~i~0#1| 28) .cse0))))) (= |c_~#a~0.offset| 0) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (= |c_~#__global_lock~0.offset| 0) (<= |c_~#__global_lock~0.base| 3) (= |c_~#a~0.base| 4) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#a~0.base|)) (<= |c_~#a~0.base| 4) (exists ((|t_funThread2of2ForFork0_~i~0#1| Int) (v_ArrVal_996 Int)) (let ((.cse1 (* 28 |t_funThread2of2ForFork0_~i~0#1|))) (and (= (store ((as const (Array Int Int)) 0) (+ |c_~#a~0.offset| .cse1) v_ArrVal_996) (select |c_#memory_int| |c_~#a~0.base|)) (not (= (+ (* |c_t_funThread1of2ForFork0_#t~post33#1| 28) 28) .cse1))))) (<= 4 |c_~#a~0.base|) (forall ((|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_992 (Array Int Int)) (v_ArrVal_996 Int)) (let ((.cse3 (* 28 |t_funThread2of2ForFork0_~i~0#1|)) (.cse2 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (and (= (+ .cse2 |~#a~0.offset|) (+ .cse3 |~#a~0.offset|)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_992) |c_~#a~0.base|) (+ .cse3 28 |~#a~0.offset|) v_ArrVal_996) (+ .cse2 28 |~#a~0.offset|)) 0))))) is different from false [2022-01-18 10:29:13,374 WARN L228 SmtUtils]: Spent 16.21s on a formula simplification. DAG size of input: 46 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:29:21,364 WARN L228 SmtUtils]: Spent 7.91s on a formula simplification. DAG size of input: 35 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:30:28,512 WARN L228 SmtUtils]: Spent 9.35s on a formula simplification. DAG size of input: 50 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:31:37,936 WARN L228 SmtUtils]: Spent 6.61s on a formula simplification. DAG size of input: 55 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:32:16,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:32:16,359 INFO L93 Difference]: Finished difference Result 31043 states and 88045 transitions. [2022-01-18 10:32:16,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-01-18 10:32:16,360 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 4.325) internal successors, (346), 80 states have internal predecessors, (346), 0 states have call successors, (0), 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 156 [2022-01-18 10:32:16,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:32:16,415 INFO L225 Difference]: With dead ends: 31043 [2022-01-18 10:32:16,415 INFO L226 Difference]: Without dead ends: 31043 [2022-01-18 10:32:16,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 292 SyntacticMatches, 17 SemanticMatches, 140 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 6251 ImplicationChecksByTransitivity, 315.2s TimeCoverageRelationStatistics Valid=2349, Invalid=15656, Unknown=113, NotChecked=1904, Total=20022 [2022-01-18 10:32:16,420 INFO L933 BasicCegarLoop]: 423 mSDtfsCounter, 3725 mSDsluCounter, 11735 mSDsCounter, 0 mSdLazyCounter, 4025 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3725 SdHoareTripleChecker+Valid, 12158 SdHoareTripleChecker+Invalid, 8914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 4025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4713 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-01-18 10:32:16,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3725 Valid, 12158 Invalid, 8914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 4025 Invalid, 0 Unknown, 4713 Unchecked, 5.2s Time] [2022-01-18 10:32:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31043 states. [2022-01-18 10:32:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31043 to 22198. [2022-01-18 10:32:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22198 states, 22194 states have (on average 2.8163467603856898) internal successors, (62506), 22197 states have internal predecessors, (62506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:32:16,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22198 states to 22198 states and 62506 transitions. [2022-01-18 10:32:16,861 INFO L78 Accepts]: Start accepts. Automaton has 22198 states and 62506 transitions. Word has length 156 [2022-01-18 10:32:16,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:32:16,861 INFO L470 AbstractCegarLoop]: Abstraction has 22198 states and 62506 transitions. [2022-01-18 10:32:16,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 4.325) internal successors, (346), 80 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 10:32:16,861 INFO L276 IsEmpty]: Start isEmpty. Operand 22198 states and 62506 transitions. [2022-01-18 10:32:16,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-01-18 10:32:16,888 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:32:16,888 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:32:16,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-01-18 10:32:17,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-01-18 10:32:17,102 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:32:17,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:32:17,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1166377771, now seen corresponding path program 4 times [2022-01-18 10:32:17,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:32:17,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322094636] [2022-01-18 10:32:17,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:32:17,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:32:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:32:25,527 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:32:25,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:32:25,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322094636] [2022-01-18 10:32:25,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322094636] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:32:25,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654197983] [2022-01-18 10:32:25,528 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 10:32:25,528 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:32:25,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:32:25,536 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:32:25,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-01-18 10:32:25,656 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 10:32:25,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 10:32:25,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-18 10:32:25,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:32:26,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-18 10:32:27,210 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:32:27,210 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:32:27,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:32:27,673 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:32:28,275 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-18 10:32:29,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 10:32:29,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-18 10:32:29,862 INFO L353 Elim1Store]: treesize reduction 8, result has 55.6 percent of original size [2022-01-18 10:32:29,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2022-01-18 10:32:30,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-01-18 10:32:47,174 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2022-01-18 10:32:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-18 10:32:47,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:32:50,253 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1081) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) v_ArrVal_1083) (+ |c_~#a~0.offset| .cse0 28)) 0)))) is different from false [2022-01-18 10:32:50,418 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1081) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0)) (= 0 (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread2of2ForFork0_#t~post33#1| 28) |c_~#a~0.offset| 28) v_ArrVal_1083) (+ |c_~#a~0.offset| .cse0 28)))))) is different from false [2022-01-18 10:32:50,449 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1081) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0)) (= 0 (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28) v_ArrVal_1083) (+ |c_~#a~0.offset| .cse0 28)))))) is different from false [2022-01-18 10:32:50,497 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 10:32:50,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-18 10:32:50,517 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 10:32:50,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 48 [2022-01-18 10:32:50,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-01-18 10:32:51,367 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (= 0 (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28) v_ArrVal_1083) (+ |c_~#a~0.offset| .cse0 28))) (and (= |c_~#a~0.base| |c_t_funThread2of2ForFork0_~p~0#1.base|) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (= |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ |c_~#a~0.offset| .cse0)))))) is different from false [2022-01-18 10:32:52,809 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 Int) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse1 (* |t_funThread1of2ForFork0_~i~0#1| 28)) (.cse0 (* 28 |t_funThread2of2ForFork0_~i~0#1|))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ .cse0 28 |~#a~0.offset|) v_ArrVal_1083) (+ .cse1 28 |~#a~0.offset|)) 0) (and (= (+ .cse1 |~#a~0.offset|) (+ .cse0 |~#a~0.offset|)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))))) is different from false [2022-01-18 10:32:53,626 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 Int) (v_ArrVal_1078 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse1 (* 28 |t_funThread2of2ForFork0_~i~0#1|)) (.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (and (= (+ .cse0 |~#a~0.offset|) (+ .cse1 |~#a~0.offset|)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (= 0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1078) |c_~#a~0.base|) (+ .cse1 28 |~#a~0.offset|) v_ArrVal_1083) (+ .cse0 28 |~#a~0.offset|)))))) is different from false [2022-01-18 10:33:20,075 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 Received shutdown request... [2022-01-18 10:34:34,591 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-18 10:34:34,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-01-18 10:34:34,626 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-18 10:34:34,626 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-18 10:34:34,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-01-18 10:34:34,792 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 157 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations of DualJunctionQuantifierElimination. [2022-01-18 10:34:34,792 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-01-18 10:34:34,792 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-01-18 10:34:34,792 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-01-18 10:34:34,793 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:34:34,793 INFO L308 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2022-01-18 10:34:34,794 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-18 10:34:34,794 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 10:34:34,794 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-18 10:34:34,794 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing initial abstraction,while executing BasicCegarLoop. [2022-01-18 10:34:34,794 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-18 10:34:34,795 INFO L732 BasicCegarLoop]: Path program histogram: [] [2022-01-18 10:34:34,795 INFO L308 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2022-01-18 10:34:34,795 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2022-01-18 10:34:34,795 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 10:34:34,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 10:34:34 BasicIcfg [2022-01-18 10:34:34,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 10:34:34,798 INFO L158 Benchmark]: Toolchain (without parser) took 809571.73ms. Allocated memory was 360.7MB in the beginning and 15.7GB in the end (delta: 15.3GB). Free memory was 304.6MB in the beginning and 13.4GB in the end (delta: -13.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.0GB. [2022-01-18 10:34:34,799 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 360.7MB. Free memory was 323.1MB in the beginning and 322.9MB in the end (delta: 181.9kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 10:34:34,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.31ms. Allocated memory is still 360.7MB. Free memory was 304.4MB in the beginning and 314.6MB in the end (delta: -10.1MB). Peak memory consumption was 20.0MB. Max. memory is 16.0GB. [2022-01-18 10:34:34,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.18ms. Allocated memory is still 360.7MB. Free memory was 314.6MB in the beginning and 311.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-18 10:34:34,799 INFO L158 Benchmark]: Boogie Preprocessor took 37.56ms. Allocated memory is still 360.7MB. Free memory was 311.4MB in the beginning and 309.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 10:34:34,799 INFO L158 Benchmark]: RCFGBuilder took 466.26ms. Allocated memory is still 360.7MB. Free memory was 309.3MB in the beginning and 291.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2022-01-18 10:34:34,799 INFO L158 Benchmark]: TraceAbstraction took 808476.83ms. Allocated memory was 360.7MB in the beginning and 15.7GB in the end (delta: 15.3GB). Free memory was 290.5MB in the beginning and 13.4GB in the end (delta: -13.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.0GB. [2022-01-18 10:34:34,800 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.14ms. Allocated memory is still 360.7MB. Free memory was 323.1MB in the beginning and 322.9MB in the end (delta: 181.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 518.31ms. Allocated memory is still 360.7MB. Free memory was 304.4MB in the beginning and 314.6MB in the end (delta: -10.1MB). Peak memory consumption was 20.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 68.18ms. Allocated memory is still 360.7MB. Free memory was 314.6MB in the beginning and 311.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.56ms. Allocated memory is still 360.7MB. Free memory was 311.4MB in the beginning and 309.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 466.26ms. Allocated memory is still 360.7MB. Free memory was 309.3MB in the beginning and 291.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 808476.83ms. Allocated memory was 360.7MB in the beginning and 15.7GB in the end (delta: 15.3GB). Free memory was 290.5MB in the beginning and 13.4GB in the end (delta: -13.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 157 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations of DualJunctionQuantifierElimination. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 157 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations of DualJunctionQuantifierElimination. - TimeoutResultAtElement [Line: 954]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing initial abstraction,while executing BasicCegarLoop. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 231 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 963 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 963 mSDsluCounter, 4411 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3356 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 555 IncrementalHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 1073 mSDtfsCounter, 555 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 783 GetRequests, 642 SyntacticMatches, 2 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4000occurred in iteration=0, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1068 NumberOfCodeBlocks, 1068 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1295 ConstructedInterpolants, 0 QuantifiedInterpolants, 6844 SizeOfPredicates, 29 NumberOfNonLiveVariables, 955 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 16 InterpolantComputations, 5 PerfectInterpolantSequences, 733/1114 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 292 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 797.7s, OverallIterations: 15, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.5s, AutomataDifference: 346.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13842 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13842 mSDsluCounter, 47126 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 11879 IncrementalHoareTripleChecker+Unchecked, 43041 mSDsCounter, 545 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9172 IncrementalHoareTripleChecker+Invalid, 21596 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 545 mSolverCounterUnsat, 4329 mSDtfsCounter, 9172 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2565 GetRequests, 1991 SyntacticMatches, 59 SemanticMatches, 515 ConstructedPredicates, 20 IntricatePredicates, 1 DeprecatedPredicates, 11628 ImplicationChecksByTransitivity, 407.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246626occurred in iteration=0, InterpolantAutomatonStates: 268, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 43.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 53660 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 260.9s InterpolantComputationTime, 2653 NumberOfCodeBlocks, 2608 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3580 ConstructedInterpolants, 503 QuantifiedInterpolants, 54749 SizeOfPredicates, 113 NumberOfNonLiveVariables, 2441 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 32 InterpolantComputations, 6 PerfectInterpolantSequences, 4306/4975 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 231 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 93 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 2002 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1480 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 199 IncrementalHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 536 mSDtfsCounter, 199 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 393 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=750occurred in iteration=5, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 610 NumberOfCodeBlocks, 610 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 704 ConstructedInterpolants, 0 QuantifiedInterpolants, 1054 SizeOfPredicates, 22 NumberOfNonLiveVariables, 458 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 55/448 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 292 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown